Watch others solve Recursion interview questions, see how they did, and learn from their mistakes.
Get step-by-step instructions on how to approach and solve common technical interview questions.
Write a program to reverse the given string.
Given an encoded string, return its decoded string.
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure.
Given a binary tree, extract all the leaves in repeated succession into a list of lists by starting at the bottom and working your way upwards.
Interview prep and job hunting are chaos and pain. We can help. Really.