Data Structures &Algorithms Roadmap

1D, 2D arrays, traversals, manipulations, and common patterns

String manipulation, pattern matching, and common algorithms

Singly, doubly linked lists, circular lists, and operations

LIFO/FIFO structures, implementations, and applications

HashMaps, hash sets, collision handling, and applications

Tree structures, properties, and basic operations

Recursive thinking, backtracking patterns, and optimization

Binary search, merge sort, quick sort, and problem decomposition

Greedy choice property, optimization problems

Memoization, tabulation, and optimization patterns

Min/max heaps, heap operations, and applications

Prefix trees, word games, and autocomplete implementations

Range queries, updates, and lazy propagation

Efficient prefix sum queries and updates

Connected components, cycle detection, path compression

Adjacency list, matrix, edge list representations

Breadth-first, depth-first search and applications

Dijkstra, Bellman-Ford, Floyd-Warshall, A* algorithms

Kruskal's, Prim's algorithms for optimization

Dependency resolution, course scheduling, DAG ordering

Kosaraju's, Tarjan's algorithms for directed graphs

Maximum flow, bipartite matching, min-cut problems

Prime numbers, GCD, LCM, modular arithmetic

Permutations, combinations, counting principles

Bitwise operations, masks, and optimization techniques

Point-line algorithms, convex hull, intersection problems

Matrix exponentiation, transformations, applications

Fixed and variable size windows for optimization

Colliding, expanding, and fast-slow pointer techniques

Maintaining order for efficiency and optimization

Cycle detection, middle element, partitioning

Merging, overlapping, and interval manipulation

Merging multiple sorted sequences efficiently

Basic DP concept and memoization techniques

Palindrome detection, longest palindromic subsequence

Sequence alignment, diff algorithms, similarity

Optimal subsequence, patience sorting

0/1 knapsack, unbounded knapsack, variants

2D DP, path counting, game theory

State compression, subset enumeration

Number counting with constraints

KMP, Rabin-Karp, Z-algorithm, suffix arrays

Quick sort, merge sort, heap sort, radix sort

Binary search variations, ternary search

Nim game, optimal strategies, minimax

N-Queens, Sudoku, subset generation

Big O notation, amortized analysis, best/average/worst cases

In-place algorithms, memory efficient techniques

Caching, precomputation, offline algorithms

Optimizing large value ranges

K largest, smallest, frequent elements

Interval manipulation and overlap handling

Array manipulation with specific constraints

Combinatorial generation and backtracking

Search in rotated arrays, sorted matrices

Common interview problems and templates