Problems
Data Structures — select a topic.
Choose a topic to see problems in Data Structures.
- 2D DP & Knapsack Variants 6
- Array Techniques 8
- Arrays 10
- Backtracking (Advanced) 7
- BFS on Grids (Variants) 4
- Binary Lifting & LCA 4
- Binary Search 9
- Binary Search Applications 4
- Binary Search on Answer 5
- Binary Search Tree 8
- Binary Search Tree (Advanced) 3
- Binary Tree Construction 4
- Binary Tree Path Problems 3
- Binary Trees 19
- Bipartite Graphs & Matching 3
- Bit Manipulation 12
- Bitmask DP 4
- Bitmask Subset Enumeration 5
- Bridges & Connectivity 4
- Cache Eviction Policies 4
- Calendar Computations 5
- Change-Making & Cutting Problems 5
- Circular Buffers & Ring Structures 4
- Constraint Search Problems 4
- Counting & Bucket Sort 2
- Counting & Combinatorics 5
- Counting Sequences (Combinatorial Numbers) 4
- Custom Sorting Rules 5
- Cyclic Sort & In-place Arrays 4
- Design (Cache & Data Structures) 9
- Difference Array & Range Updates 3
- Digit & Number DP 4
- Digit Problems 5
- Disjoint Set (Union-Find) 8
- Divide and Conquer 4
- Dynamic Programming 18
- Euler Tour & Subtree Queries 4
- Expression & Parentheses 2
- Frequency Counting 4
- Functional Graphs & Cycles 4
- Game & Board Simulation 5
- Game Theory 5
- GCD, LCM & Diophantine Equations 5
- Geometry & Coordinates 6
- Graph Algorithms (Advanced) 6
- Graph Basics 6
- Graphs 12
- Greedy 9
- Greedy (Advanced) 8
- Greedy Scheduling 5
- Grid Path DP 3
- Grid Search (BFS & DFS) 7
- Hash Set Techniques 3
- Hash Tables & Probabilistic Structures 4
- Hashing 10
- Hashing (Advanced) 5
- Heap / Priority Queue 9
- Heap Scheduling Problems 5
- Heaps & Order Statistics 1
- Interval DP 5
- Interval Greedy Problems 4
- Intervals & Line Sweep 5
- K-Way Merge 4
- Linked List 11
- Linked List (Advanced) 9
- Math & Number Theory 10
- Matrix 7
- Matrix Exponentiation 4
- Matrix Operations 5
- Meet in the Middle 3
- Minimum Spanning Tree 4
- Monotonic Deque 3
- Number Parsing & Formatting 4
- Number Systems & Base Conversion 6
- Offline Counting Queries 3
- Ordered Map & Multiset Operations 4
- Palindromes 4
- Partition & Subset-Sum DP 3
- Permutations & Ordering 5
- Prefix Sum & Range Queries 6
- Prefix Sums with Hash Maps 6
- Queue 7
- Queue & Deque Simulations 4
- Recursion & Backtracking 9
- Recursion Fundamentals 6
- Rolling Hash & Rabin-Karp 3
- Run-Length & Encoding 5
- Segment Tree & Fenwick Tree 5
- Series & Closed-Form Math 5
- Shortest Path Algorithms 6
- Sieve & Modular Arithmetic 3
- Simulation & Implementation 6
- Sliding Window (Advanced) 7
- Sorting 9
- Sorting & Searching (Misc) 8
- Sorting Algorithm Analysis 7
- Sparse Matrix & Vector Operations 4
- Sparse Table & RMQ 3
- Stack 9
- Stack (Advanced) 7
- Stack & Queue Implementations 3
- Stock Trading DP 5
- Streaming & Online Algorithms 3
- String Algorithms (Advanced) 5
- String DP Classics 2
- String Matching Algorithms 5
- String Transformations 3
- Strings 10
- Subsequence DP 4
- Substring Window Counting 2
- Time-Based Design Problems 3
- Topological Sort & DAG 5
- Tree Diameter & Distances 4
- Tree DP & Advanced Trees 6
- Tree Traversals (Advanced) 6
- Trie 7
- Trie (Advanced) 4
- Triplet & Quadruplet Search 5
- Two Pointers & Sliding Window 8
- Union-Find (Advanced) 4
- Weighted Path Variants 4
- XOR Tricks 4
- Z-Function & Suffix Structures 4
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.