Coding Interview Study Guide

Radix Sort Algorithm

A number consists of digits. Example: 843. Its a 3-digit number. Radix sort, start by sorting numbers first by their...

Counting Sort Algorithm

Counting sort runs on relatively smaller set of input. Counting sort calculates, for every element in array - X, the...

Young Tableau problem - Cormen

Young Tableau A a X b matrix is Young Tableau if all rows(from left to right) and columns(from top to...

Min Priority Queue Implementation with Heap Data structure

Min Priority Queue is a data structure which manage a list of keys(values). And, gives priority to element with minimum...

Max Priority Queue Implementation with Heap Data structure

Max Priority Queue is a data structure which manage a list of keys(values). And, gives priority to element with maximum...

Two Sum Problem - Leet Code Solution

Problem Statement Given an array of integers, return indices of the two numbers such that they add up to a...

Heap Sort Algorithm

This is another very useful sorting algorithm based on Heap data structure. Read more about Heap Data Structure

What is Heap Data Structure

Its a tree based data structure which is a complete binary tree(all nodes have 2 nodes, leaf-child may not have...

Index for Coding Problems

Sorting Problems Merge Sort Quick Sort Heap Sort Bubble Sort Selection Sort Insertion Sort Count Sort Radix Sort

Tips to Coding Interview

Here are some tips while giving your coding interviews.

Maximum Subarray Problem

Problem Statement You are given an array of integers. And, you have find the range of indexes or sub-array from...

Quick Sort Algorithm

This algorithm is very useful for large input. And, is quite efficient one. It has several implementation, and it is...

Counting Inversions Coding Problem

** Inversion There is an array(a) and two indexes i and j. Inversion is the element for whom i <...

Merge Sort Algorithm

This algorithm is very efficient one, and is classic example of Divide and Conquer algorithms.

Bubble Sort Algorithm

This is kind of preliminary technique of sorting. And, this is the first algorithm that a beginner learns.

Coding Interview - Useful Terms Cheatsheet

Big-O notation In simpler terms, its kind of a unit to measure how efficient an algorithm is, with respect to...

Selection Sort Algorithm

It is one of a simple algorithm to study for a beginner to understanding sorting algorithms.

Insertion Sort Algorithm

Its a kind of incremental insertion technique, where the algorithm build up sorting by first sorting n-1 items.

List of Sorting Algorithms

This topic is one of the most common studied. When somebody started preparation of coding interviews. Sorting algorithms would in...

Coding Interview Cheatsheet

Absolute Must Have Below are must have topics that you must know: Algorithms Data Structures Concepts Breadth First Search (BFS)...