A rapid-fire round of short questions, about 4-5 minutes each: find the height of a binary tree; name a problem solved well with postorder traversal; compare merge sort and quick sort on arrays and on…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.