Data Structures and Algorithms

Binary Search: Searching optimal points on monotones

Revisit binary search, and understand how it can be used it solving a class of optimization problems. Approach and code to SPOJ's most popular problem, aggressive cows is discussed as well.

Dynamic Programming: Collection of classical problems

Dynamic Programming is an algorithm paradigm that identifies the common overlapping problems and stores them into memory, to dramatically improve the speed of solving of problems.

Graphs: Traversals and commonly used algorithms

Understand the graph data structure in computer science, its representations. Then we discuss the most popular graph algorithms: DFS,BFS,DSU,MST and Dijikstra's algorithm. In Depth implementation of each of the algorithm will be provided.

Linked List

A deep dive into the classic linked list. Starts from the scratch, build a elementary linked list.