DSA Problems
Browse the public problem library with cleaner cards, stronger filtering, and only entries that have crossed the minimum data-quality threshold.
Curated public problem set
Practice from problems that are ready enough to actually learn from.
Entries with less than half of the important fields filled stay in admin only. This page now shows the cleaner, study-ready catalog.
Visible Problems
48
Strong Coverage
46
Topics / Patterns
15 / 41
Find a problem fastSearch by title, topic, or pattern and jump directly into a random ready problem when you want quick revision.
Find a problem fast
Search by title, topic, or pattern and jump directly into a random ready problem when you want quick revision.
View:
48 results in the public catalog
Array11
- Best Time to Buy and Sell Stock100% readybest-time-to-buy-and-sell-stockArrayGreedy / Kadane's VariantUpdated Apr 15, 2026
- Check if Array Is Sorted and Rotated100% readycheck-if-array-is-sorted-and-rotatedArrayLinear Scan / Circular ArrayUpdated Apr 15, 2026
- Max Consecutive Ones100% readymax-consecutive-onesArrayLinear Scan / Sliding WindowUpdated Apr 15, 2026
- Rearrange Array Elements by Sign100% readyrearrange-array-elements-by-signArrayTwo PointersUpdated Apr 15, 2026
- Remove Duplicates from Sorted Array100% readyremove-duplicates-from-sorted-arrayArrayTwo PointersUpdated Apr 15, 2026
- Single Element in a Sorted Array100% readysingle-element-in-a-sorted-arrayArrayBinary SearchUpdated Apr 15, 2026
- Union of Two Sorted Arrays100% readyunion-of-two-sorted-arraysArrayTwo Pointers / Merge ProcessUpdated Apr 15, 2026
Arrays2
Backtracking1
Binary Search1
- Lower Bound (Binary Search)100% readylower-boundBinary SearchLower Bound / First index with a[i] ≥ xUpdated Apr 5, 2026
Graph11
- Course Schedule II100% readycourse-schedule-iiGraphTopological Sort (Kahn's Algorithm)Updated Apr 25, 2026
- Detect Cycle in an Undirected Graph100% readydetect-cycle-in-an-undirected-graphGraphDFS / BFS with Parent TrackingUpdated Apr 16, 2026
- Find Eventual Safe States83% readyfind-eventual-safe-statesGraphReverse Topological Sort (Kahn's Algorithm)Updated Apr 27, 2026
- Reorder Routes to Make All Paths Lead to the City Zero100% readyreorder-routes-to-make-all-paths-lead-to-zeroGraphDFS + Direction TrackingUpdated Apr 14, 2026
- Shortest Path in Undirected Graph with Unit Distance100% readyshortest-path-undirected-unit-distanceGraphBFSUpdated Apr 28, 2026
Graph / Matrix4
- Number of Enclaves83% readynumber-of-enclavesGraph / MatrixBoundary DFS / Flood FillUpdated Apr 19, 2026
- Surrounded Regions83% readysurrounded-regionsGraph / MatrixBoundary DFS / Flood FillUpdated Apr 18, 2026
Graph / String1
- Word Ladder II83% readyword-ladder-iiGraph / StringBFS + DFS / Shortest Path ReconstructionUpdated Apr 21, 2026
Graphs5
- Connected Components in an Undirected Graph100% readyconnected-components-in-an-undirected-graphGraphsDFSUpdated Apr 11, 2026
- Count the Number of Complete Components100% readycount-the-number-of-complete-componentsGraphsDFSUpdated Apr 11, 2026
- Minimum Steps to Reach Target (Knight's Tour BFS)100% readymin-steps-to-reach-target-by-knightGraphsBreadth First Search (BFS)Updated Apr 14, 2026
- Number of Provinces100% readynumber-of-provincesGraphsConnected Components / DFSUpdated Apr 10, 2026
Greedy5
- Job Sequencing (Greedy)100% readyjob-sequencingGreedySort by profit + place latest slotUpdated Apr 5, 2026
- Merge Overlapping Subintervals100% readymerge-overlapping-subintervalsGreedyMerge IntervalsUpdated Apr 8, 2026
- Non-overlapping Intervals100% readynon-overlapping-intervalsGreedyInterval SchedulingUpdated Apr 8, 2026
Linked List2
- Add 1 to Linked List100% readyadd-1-to-linked-listLinked ListCarry Propagation / Reverse ListUpdated Apr 8, 2026
- Clone a Linked List with Next and Random Pointer100% readyclone-linked-list-random-pointerLinked ListHash Map / Interleaving NodesUpdated Apr 5, 2026