Solve three tasks: 1) Reverse linked list in groups of k, traverse m, repeat. 2) Next Greater Element for each array element. 3) Boundary traversal of a binary tree.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.