-
Geek for geeks
-
Competitive Programming 3, Halim
-
Introduction to Algorithms, Cormen
-
Cracking the coding interview, Laakmann
- BIT / Fenwick Tree
- Union-Find
- Trie
- LinkedList
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Shortest paths - One to All - Dijkstra's algorithm
- Shortest paths - All to All Floyd-Warshall algorithm
- Topological Ordering
- Strongly Connected Components - Lowpt (directed) algorithm
- Lowest Common Ancestor (LCA)
- Kadane's Algorithm
- Longest Palyndromic Sequence
- Knapsack Problem
- Number of ways to decode a message
- Greatest Common Divisor
- Binary Search
- Matching parenthesis
- Count Negative Integers in Row/Column-Wise Sorted Matrix