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

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

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 is a data structure which manage a list of keys(values). And, gives priority to element with minimum...

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

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

This is another very useful sorting algorithm based on Heap data structure. Read more about 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...

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

Here are some tips while giving your coding interviews.

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

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

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

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

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

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

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

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

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

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

- Radix Sort Algorithm
- Counting Sort Algorithm
- Young Tableau problem - Cormen
- Min Priority Queue Implementation with Heap Data structure
- Max Priority Queue Implementation with Heap Data structure
- Two Sum Problem - Leet Code Solution
- Visual Studio Code - How to associate file extension to a known programming language
- Java - Union and Intersection of two lists
- Heap Sort Algorithm
- What is Heap Data Structure