Algorithms

Sorting and Searching

Binary Search – Different flavors

 

Stack and Queue

Stack Implementation Using Array

 

Graph

Depth First Search (DFS) for traversing a Graph

From a given graph, delete minimum number of edges such that there is no path from start node to end node

 

Geometry

Checking Collinearity of 3 points and their orientation