Learning Paths

DSA concepts, time/space complexity, Big O notation, and mathematical basics

Arrays, prefix sum, sliding window, two pointers, and basic searching

All major sorting algorithms and their implementations

String algorithms and pattern matching techniques

Hash maps, hash sets, and collision handling

All types of linked lists and pointer-based operations

Linear data structures with LIFO and FIFO principles

Bitwise operations, XOR properties, and bitmasking

Binary trees, BST, traversals, and tree algorithms

Trie data structure for efficient string operations

Priority-based data structures and greedy algorithms

State-space exploration and recursive problem solving

Optimal substructure and memoization techniques

Graph representation, traversal, and shortest path algorithms