Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an integer array, find the equilibrium index in it. For an array A consisting n elements, index i is an equilibrium index if the sum of elements of subarray A[0…i-1] is equal to the sum of elements of subarray A[i+1…n-1].
Given an unsorted integer array, find a pair with the given sum in it.
Given a binary array, sort it in linear time and constant space. The output should print all zeros followed by all ones.
Given a BST and a positive number k, find the k’th largest node in the BST.
Given a BST and two nodes x and y in it, find the lowest common ancestor (LCA) of x and y. The LCA of x and y is the shared ancestor of x and y that is located farthest from the root.
Given an unsorted integer array that represents binary search tree keys, construct a height-balanced BST from it.
Given a BST, write an efficient function to search a given key in it. The algorithm should return the parent node of the key and print if the key is the left or right node of the parent node. If the key is not present in the BST, the algorithm should be able to determine that.
A Binary Search Tree (BST) is a rooted binary tree, whose nodes each store a key (and optionally, an associated value), and each has two distinguished subtrees, commonly denoted left and right.
Given a binary tree, print corner nodes of every level in it.
Given a binary tree, write an efficient algorithm to print all paths from the root node to every leaf node in it.
Given a binary tree, write an efficient algorithm to determine if it can be converted into another binary tree by doing any number of swaps of its right and left branches.
Given a binary tree, write an efficient algorithm to convert the binary tree to its mirror.