Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven a binary tree, determine the distance between given pairs of nodes in it. The distance between two nodes is defined as the total number of edges in the shortest path from one node and another.
Given a set of positive numbers, find all possible combinations of words formed by replacing the continuous digits with the English alphabet’s corresponding character.
Given a binary tree, write an efficient algorithm to print all nodes in a specific order. We need to print nodes of every level in alternating left and right.
This post will reverse the linked list using recursion in C, C++, Java, and Python.
Given a linked list, sort it using the merge sort algorithm. Merge sort is an efficient, general-purpose sorting algorithm that produces a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output.
Given a string and a dictionary of words, determine if the string can be segmented into a space-separated sequence of one or more dictionary words.
Find the optimal cost to construct a binary search tree where each key can repeat several times. We are given each key’s frequency in the same order as corresponding keys in the inorder traversal of a binary search tree.
Given an M × N matrix where each cell can have a value of 1, 0, or -1, where -1 denotes an unsafe cell, collect the maximum number of ones starting from the first cell and by visiting only safe cells (i.e., 0 or 1).
Given a string, count the number of times a given pattern appears in it as a subsequence.
Given an unlimited supply of coins of given denominations, find the total number of distinct ways to get the desired change.
Given a set of positive integers S, partition set S into two subsets, S1 and S2, such that the difference between the sum of elements in S1 and the sum of elements in S2 is minimized.
Given an array A, maximize value of expression (A[s] – A[r] + A[q] – A[p]), where p, q, r, and s are indices of the array and s > r > q > p.