Data Structures & Algorithms

DS

Foundations

Data Structures

"What exists?" Basics, Linear, Trees, Graphs, and Hash-based structures.

Explore Topics ↓

ALGO

Logic

Algorithms

"How do we process?" Sorting, Searching, DP, Greedy, and Recursion patterns.

Explore Topics ↓

PROB

Practice

Problem Solving

"How do I practice?" Categorized by pattern, difficulty, and platform metadata.

Start Solving ↓

RES

Extras

Resources

Sheets, blogs, video playlists, and interview preparation strategies.

View Resources ↓

Basics & Foundations

ADT, Time & Space Complexity (Big-O), Recursive vs Iterative, Best/Avg/Worst Cases.

Start Learning →

Linear Data Structures

Arrays, Strings, Linked Lists (Singly/Doubly/Circular), Stacks, Queues & Deques.

Start Learning →

Hash-Based Structures

Hash Tables, Functions, Collision Handling (Chaining/Open Addressing), Maps & Sets.

Start Learning →

Non-Linear Data Structures

Trees, BST, AVL, Heaps (Min/Max), Segment Trees, Fenwick Trees, Tries.

Start Learning →

Graph Data Structures

Adj Matrix/List, Directed vs Undirected, Weighted, Cyclic, DAG, Bipartite Graphs.

Start Learning →

Advanced Structures

Disjoint Set Union (DSU), Sparse Tables, Skip List, LRU Cache, Bloom Filter.

Start Learning →

Searching Algos

Linear, Binary, Binary on Answer, and Ternary Search.

Start Learning →

Sorting Algos

Bubble, Merge, Quick, Heap, Radix, Bucket Sort, and Stability.

Start Learning →

Two Pointers

Opposite Direction, Same Direction, Fast & Slow Pointers.

Start Learning →

Sliding Window

Fixed/Variable Window and Window with Frequency Count.

Start Learning →

Recursion & Backtracking

Stack Analysis, Subsets, N-Queens, and Sudoku Solver.

Start Learning →

Divide & Conquer

Merge Sort, Quick Sort, and Binary Search Variants.

Start Learning →

Greedy Algos

Activity Selection, Huffman Encoding, and Job Sequencing.

Start Learning →

Dynamic Programming

1D/2D DP, Knapsack, LIS, LCS, MCM, Trees, Grids, and Bitmask.

Start Learning →

Graph Algos

BFS/DFS, Dijkstra, MST (Prim/Kruskal), SCC, and Bridges.

Start Learning →

String Algos

KMP, Rabin-Karp, Z-Algo, and Trie-Based Searching.

Start Learning →

Bit Manipulation

XOR, Set/Clear Bits, Power of Two, and Subsets.

Start Learning →

Arrays

Easy → Med → Hard. The base of almost everything.

Start Solving →

Strings

Basic & Medium. Specialized arrays; solve immediately after arrays.

Start Solving →

Recursion

PatternWise. Mandatory before trees, backtracking, and DP.

Start Solving →

Bit Manipulation

Concepts & Problems. Needs recursion + math thinking.

Start Solving →

Binary Search

1D, 2D Arrays & Search Space. Relies on array + recursion mindset.

Start Solving →

Window & 2-Pointer

Combined Problems. Built on arrays + binary search intuition.

Start Solving →

Stack & Queues

Monotonic Stack & Implementation. Introduces vital logic.

Start Solving →

Linked List

Single & Double LL. Pointer logic follows stack/queues best.

Start Solving →

Greedy Algos

Easy/Med/Hard. Decision-making based on intuition & sorting.

Start Solving →

Heaps

Works best after greedy; many problems are greedy + heap combos.

Start Solving →

Binary Trees

Traversals & Problems. Requires recursion + stack comfort.

Start Solving →

BST

Concept & Problems. Special case; never do BST before BT.

Start Solving →

Tries

Advanced structure. Needs recursion + bit/string understanding.

Start Solving →

Graphs

Concepts & Problems. DFS/BFS relies on recursion & stacks.

Start Solving →

Dynamic Programming

Patterns & Problems. The Final Boss; requires full mindset.

Start Solving →

Planned

DSA Sheets

Striver, Blind75, and Company-specific sheets.

Planned

Video & Blogs

Curated walkthroughs and optimization notes.

Planned

CP Roadmap

Codeforces/Codechef rating-based progression.