DSA Tracker
Your DSA Journey
Practice 425 curated DSA problems by pattern. Browse freely, then sign in to save progress, notes, and revision history.
Track 425+ curated problems with spaced repetition
Browse freely. Sign in free to save progress, notes, and revision history.
DSA Prep — Problems
#
Problem
Difficulty
Actions
Bitwise XOR - Finding Single/Missing Number
Bitwise AND - Counting Set Bits (Hamming Weight)
Bitwise DP - Counting Bits Optimization
Bitwise Operations - Arithmetic Without +/-
Bitwise Operations - Power of Two/Four Check
Two Pointers - Converging (Sorted Array Target Sum)
Two Pointers - Fast & Slow (Cycle Detection)
Two Pointers - Fixed Separation (Nth Node from End)
Two Pointers - In-place Array Modification
Two Pointers - String Comparison with Backspaces
Two Pointers - Expanding From Center (Palindromes)
Two Pointers - String Reversal
Sliding Window - Fixed Size (Subarray Calculation)
Sliding Window - Variable Size (Condition-Based)
Sliding Window - Monotonic Queue for Max/Min
Sliding Window - Character Frequency Matching
Tree BFS - Level Order Traversal
Tree DFS - Recursive Preorder Traversal
Tree DFS - Recursive Inorder Traversal
Tree DFS - Recursive Postorder Traversal
Tree - Lowest Common Ancestor (LCA) Finding
Tree - Serialization and Deserialization
Graph DFS - Connected Components / Island Counting
Graph BFS - Connected Components / Island Counting
Graph DFS - Cycle Detection (Directed Graph)
Graph BFS - Topological Sort (Kahn's Algorithm)
Graph - Deep Copy / Cloning
Graph - Shortest Path (Dijkstra's Algorithm)
Graph - Shortest Path (Bellman-Ford / BFS+K)
Graph - Union-Find (Disjoint Set Union - DSU)
Strongly Connected Components (Kosaraju / Tarjan)
Bridges & Articulation Points (Tarjan low-link)
Minimum Spanning Tree (Kruskal / Prim / DSU + heap)
Bidirectional BFS (BFS optimization for known source & target)
DP - 1D Array (Fibonacci Style)
DP - 1D Array (Kadane's Algorithm for Max/Min Subarray)
DP - 1D Array (Coin Change / Unbounded Knapsack Style)
DP - 2D Array (Longest Common Subsequence - LCS)
DP - 2D Array (Edit Distance / Levenshtein Distance)
DP - 2D Array (Unique Paths on Grid)
DP - Catalan Numbers
DP - Longest Increasing Subsequence (LIS)
DP - Stock problems
Heap - Top K Elements (Selection/Frequency)
Heap - K-way Merge
Heap - Scheduling / Minimum Cost (Greedy with Priority Queue)
Backtracking - Subsets (Include/Exclude)
Backtracking - Permutations
Backtracking - Palindrome Partitioning
Greedy - Interval Merging/Scheduling
Greedy - Buy/Sell Stock
Greedy - Gas Station Circuit
Greedy - Task Scheduling (Frequency Based)
Greedy - Sorting Based
Binary Search - On Sorted Array/List
Binary Search - Find Min/Max in Rotated Sorted Array
Binary Search - On Answer / Condition Function
Binary Search - Find First/Last Occurrence
Binary Search - Median / Kth across Two Sorted Arrays
Stack - Valid Parentheses Matching
Stack - Monotonic Stack
Stack - Expression Evaluation (RPN/Infix)
Stack - Simulation / Backtracking Helper
Stack - Largest Rectangle in Histogram
Linked List - In-place Reversal
Linked List - Addition of Numbers
Linked List - Intersection Detection
Linked List - Reordering / Partitioning
Array/Matrix - Spiral Traversal
Array/Matrix - Set Matrix Zeroes (In-place Marking)
Array - Product Except Self (Prefix/Suffix Products)
Array - Plus One (Handling Carry)
Array - Merge Sorted Array (In-place from End)
Array - Cyclic Sort
String - Palindrome Check (Two Pointers / Reverse)
String - Multiply Strings (Manual Simulation)
String Matching - Naive / KMP / Rabin-Karp
String - Repeated Substring Pattern Detection
Design (General/Specific)
Tries
Why this tracker ranks
Pattern-first DSA practice
Problems are grouped by recurring interview patterns, helping learners practice concepts instead of random lists.
Revision workflow
Spaced repetition ready
Mark reviewed problems to schedule follow-ups and keep solved questions fresh before interviews.
Saved only on login
Private account progress
Guests can browse the full tracker. Progress updates ask for login before any user data is stored.
