Pathfinding with Add/Duplicate/Split Operations

Problem Overview

Given two positive integers a and b, implement a function that outputs any valid path (sequence of operations) transforming a into b. Three operations are available: add(num) → returns num + 2, dub(num) → returns num 2, split(num) → returns…

• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people