# Coding Interview Study Guide

### Coding Interview - Tips to Coding Interview

Here are some tips while giving your coding interviews.

### Coding Interview - Maximum Subarray Problem

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

### Coding Interview - Quick Sort

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

### Coding Interview - Counting Inversions

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

### Coding Interview - Merge Sort

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

### Coding Interview - Bubble Sort

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

### Coding Interview - Computer Algorithms Useful Terms Cheatsheet

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

### Coding Interview - Selection Sort

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

### Coding Interview - Insertion Sort

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

### Coding Interview - 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)...