Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGive an M × N matrix consisting of only 0 or 1, change all elements of row i and column j to 0 if cell (i, j) has value 0. Do this without using any extra space for every (i, j) having value 0.
Given an M × N matrix, shift all its elements by 1 in spiral order.
Given an array containing M × N elements, construct an M × N matrix from it in spiral order.
Given an M × N matrix, print the matrix in spiral order.
Given a binary matrix where 0 represents water and 1 represents land, and connected ones form an island, count the total islands.
Flood fill (also known as seed fill) is an algorithm that determines the area connected to a given node in a multi-dimensional array.
Given a maze in the form of the binary rectangular matrix, find the shortest path’s length in a maze from a given source to a given destination.
Given two arrays, reorder elements of the first array by the order of elements defined by the second array. The elements that are not present in the second array but present in the first array should be appended at the end sorted.
Given an array, sort its element by their frequency and index. i.e., if two elements have different frequencies, then the one which has more frequency should come first; otherwise, the one which has less index should come first.
A Hybrid Algorithm is an algorithm that combines two or more other algorithms that solve the same problem. In this article, a hybrid of the Quicksort with Insertion Sort is discussed to achieve better performance.
Write an iterative version of the recursive Quicksort algorithm.
Quicksort is an efficient in-place sorting algorithm, which usually performs about two to three times faster than merge sort and heapsort when implemented well. Quicksort is a comparison sort, meaning that it can sort items of any type for which a less-than relation is defined.