Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an N × N matrix where each cell has a distinct value in the 1 to N × N. Find the longest sequence formed by adjacent numbers in the matrix such that for each number, the number on the adjacent neighbor is +1 in its value.
Given an M × N matrix where each cell has a cost associated with it, find the minimum cost to reach the last cell (M-1, N-1) of the matrix from its first cell (0, 0). We can only move one unit right or one unit down from any cell, i.e., from cell (i, j), we can move to (i, j+1) or (i+1, j).
Matrix chain multiplication is an optimization problem that to find the most efficient way to multiply a given sequence of matrices. The problem is not actually to perform the multiplications but merely to decide the sequence of the matrix multiplications involved.
Given an M × N binary matrix, find the size of the largest square submatrix of 1’s present.
Edit distance is a way of quantifying how different two strings are from one another by counting the minimum number of operations required to transform one string into the other.
Find a subsequence of a given sequence such that the subsequence sum is as high as possible and the subsequence’s elements are in sorted order, from lowest to highest. This subsequence is not necessarily contiguous or unique.
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
The Longest Repeating Subsequence (LRS) problem is finding the longest subsequences of a string that occurs at least twice.
The Longest Palindromic Subsequence (LPS) problem is finding the longest subsequences of a string that is also a palindrome.