Algorithms

Core algorithms for coding interviews. Most topics are expanded to SDE-3 level: concept overview, core algorithms, pattern recognition, interview strategy, and quick revision.

Topic files

Topic	File	Highlights
Searching & Binary Search	searching.md	Standard BS, lower/upper bound, BS on answer, rotated array, peak.
Sorting	sorting.md	Big-O table (merge, quick, heap, counting, radix), QuickSelect, custom comparators.
Divide and Conquer	divide-and-conquer.md	Merge sort, quick sort, Master Theorem; D&C vs DP.
Mathematics	maths.md	Primes, GCD/LCM, modular arithmetic, combinatorics; common problems.
String	string.md	KMP, Rabin-Karp, longest palindromic substring, sliding window, LCS/edit distance.
Bit Manipulation	bit-manipulation.md	Operators, tricks, bitmask DP, XOR, subset enumeration.
Greedy	greedy.md	Proof techniques, intervals, scheduling, jump game, candy.
Backtracking	backtracking.md	Template, pruning, permutations/combinations, N-Queens, Word Search.
Graph	graph.md	BFS, DFS, Dijkstra, Bellman-Ford, topo sort, Kruskal; pattern recognition, strategy.
Union Find	union-find.md	DSU with path compression and rank; Kruskal, connectivity.
Dynamic Programming	dynamic-programming/README.md	State, recurrence, top-down vs bottom-up; link to 16 patterns in patterns/dp-advanced.md.
Recursion	recursion/README.md	Base case, recursive step, types; memoization, backtracking.
Miscellaneous	miscellaneous.md	Tips: categories, brute force, greedy, DP, maths, graph, debugging, edge cases.

Supplementary (same folder)

File	Description
dynamic-programming/dp-aditya-verma.md	DP from Aditya Verma style: 0/1 knapsack, recursive tree.
recursion/aditya-verma.md	Recursion: IP/OP, decision tree, hypothesis/induction.

How to use

• Patterns: patterns/dp-advanced.md for 16 DP patterns; patterns/leetcode-patterns.md for array, tree, graph, DP, backtracking.

• Roadmap: SDE3_DSA_ROADMAP.md for problem order and weekly plan.