Pattern-wise roadmap · 68 patterns
Master DSA, One Pattern at a Time.
385 Handpicked Problems. 17 Essential Topics. One Structured Roadmap to Master Data Structures & Algorithms.
Total Problems
385
68 patterns
DSA Topics
17
Array to Bit Manipulation
Problems Solved
Overall Completion
Overall progress
Loading your progress…
– / 385
- Easy0/81
- Medium0/251
- Hard0/53
Up next
The roadmap
17 topics, one clear path
Work through topics in order or jump straight to the pattern you need. Each topic breaks down into the patterns that show up in interviews.
- 01
Array
Fundamental collection of elements stored at contiguous memory locations.
4 patterns · 24 problems0/24 - 02
Strings
Sequence of characters and common string manipulation patterns.
2 patterns · 11 problems0/11 - 03
Binary Search
Efficient search algorithm that divides the search interval in half.
4 patterns · 23 problems0/23 - 04
Stack
LIFO (Last In First Out) data structure patterns.
7 patterns · 32 problems0/32 - 05
Queue
First-in, first-out collection for processing elements in the order they arrive.
2 patterns · 6 problems0/6 - 06
Recursion
Solving problems by breaking them down into smaller, self-similar subproblems.
5 patterns · 20 problems0/20 - 07
Linked List
Linear data structure where elements are not stored at contiguous memory locations.
5 patterns · 29 problems0/29 - 08
Double Linked List
Linked List with navigation in both forward and backward directions.
2 patterns · 9 problems0/9 - 09
HashMap
Key-value pair data structure for O(1) average time complexity lookups.
2 patterns · 5 problems0/5 - 10
Binary Tree
Hierarchical data structure with a root value and subtrees of children.
5 patterns · 54 problems0/54 - 11
Graph
Non-linear data structure consisting of nodes and edges.
7 patterns · 43 problems0/43 - 12
Heap
Priority Queue data structure for efficient retrieval of highest/lowest priority elements.
4 patterns · 16 problems0/16 - 13
Backtracking
Algorithmic technique for solving problems recursively by trying to build a solution incrementally.
4 patterns · 24 problems0/24 - 14
Greedy
Algorithm paradigm that follows the problem solving heuristic of making the locally optimal choice.
2 patterns · 18 problems0/18 - 15
Dynamic Programming
Optimization method involving breaking down problems into simpler subproblems and storing their solutions.
7 patterns · 44 problems0/44 - 16
Trie
Tree-based data structure used for efficiently storing and retrieving keys in a dataset of strings.
3 patterns · 11 problems0/11 - 17
Bit Manipulation
Techniques that perform operations on data at the bit level.
3 patterns · 16 problems0/16