← Amazon questions

Diagonal binary tree traversal and sub-arrays with zero sum

Filed under Amazon

Print a binary tree along its diagonal lines, and find all contiguous sub-arrays within an integer array that sum to zero.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.