DSA Library

Static & dynamic arrays, sorting, searching techniques.

Singly, doubly, circular lists and their operations.

LIFO structures, expression parsing, recursion simulations.

FIFO structures, priority queues, circular buffers.

Binary trees, BST, AVL, heaps, traversals.

Prefix trees for efficient string searching and storage.

BFS, DFS, shortest paths, MST, network flow.

Hash tables, collision resolution, caching strategies.

Optimization problems, memoization, tabulation.

Pattern matching, manipulation, parsing algorithms.

Local optimization strategies, Huffman coding.

Sudoku, N-Queens, combinatorial search problems.

Bitwise operators, binary optimization tricks.