SnowflakeCodingMembers
Reach Target via Add / Double / Halve
Members only
Given add(n)=n+2, dub(n)=n*2, split(n)=floor(n/2), implement func(a, b) returning one (not necessarily optimal) sequence of operations that takes a to b. BFS finds a shortest path, but the interviewer...
SWE
math
bfs
greedy
recursion
medium
Frequency
Single report
Last asked
2026-06-17
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
