Push Zeros, Closest Leaf, and Min Jumps in Tree
Filed under Samsung
The question
Push all zeros of an array to the end while maintaining relative order of other elements, find the length of the closest leaf from a given node in a binary tree, and find the minimum number of jumps to reach a second node from a first one in a binary tree.
No write-up yet. Related questions below have one.
Related Samsung questions
Collected from public candidate posts and coding forums. Updated Nov 2026.