DSA Pattern Coverage & Quality Audit
Detailed quality matrices showing visualization availability, interactive playground status, interview coverage, and production readiness for each LeetCode pattern.
| Pattern Name | Status | Complexity | Concept Page | Visualization | Playground | Interview Qs | Benchmark Problems | Article |
|---|---|---|---|---|---|---|---|---|
Sliding WindowModule: arrays | Complete | Time: O(N), Space: O(1) or O(K) | View | Ready | Open | 14 Qs | Total: 3 Longest Substring Without Repeating CharactersMinimum Size Subarray Sum+1 more | Read |
Two PointersModule: arrays | Complete | Time: O(N), Space: O(1) | View | Ready | Open | 14 Qs | Total: 3 Two Sum II - Input Array Is Sorted3Sum+1 more | Read |
Binary SearchModule: binary-search | Complete | Time: O(log N), Space: O(1) | View | Ready | Open | 7 Qs | Total: 3 Binary SearchSearch in Rotated Sorted Array+1 more | Read |
Heap / Priority QueueModule: heap | Complete | Time: O(N log K), Space: O(K) | View | Missing | Open | 7 Qs | Total: 3 Kth Largest Element in an ArrayTop K Frequent Elements+1 more | Read |
Graph Traversals (BFS / DFS)Module: graphs | Complete | Time: O(V + E), Space: O(V) | View | Ready | Open | 7 Qs | Total: 3 Number of IslandsClone Graph+1 more | Read |
Dynamic ProgrammingModule: dynamic-programming | Complete | Time: O(N*W), Space: O(N*W) or O(N) | View | Ready | Open | 7 Qs | Total: 3 Climbing StairsCoin Change+1 more | Read |
Difference ArrayModule: advanced-arrays | Complete | Time: O(1) per update, O(N) reconstruction; Space: O(N) | Missing | Missing | Missing | None | Total: 2 Corporate Flight BookingsRange Addition | Missing |
Dutch National FlagModule: advanced-arrays | Complete | Time: O(N), Space: O(1) | Missing | Missing | Open | None | Total: 1 Sort Colors | Missing |
Cyclic SortModule: advanced-arrays | Complete | Time: O(N), Space: O(1) | Missing | Missing | Missing | None | Total: 2 Missing NumberFind All Numbers Disappeared | Missing |
Lower BoundModule: binary-search-patterns | Complete | Time: O(log N), Space: O(1) | Missing | Missing | Missing | None | Total: 1 Find First and Last Position of Element | Missing |
Upper BoundModule: binary-search-patterns | Complete | Time: O(log N), Space: O(1) | Missing | Missing | Missing | None | Total: 1 Find First and Last Position of Element | Missing |
Fast Slow PointerModule: linked-list-patterns | Complete | Time: O(N), Space: O(1) | Missing | Missing | Missing | None | Total: 2 Linked List CycleLinked List Cycle II | Missing |
Cycle DetectionModule: linked-list-patterns | Complete | Time: O(V + E) or O(N), Space: O(V) or O(1) | Missing | Missing | Missing | None | Total: 2 Linked List CycleCourse Schedule | Missing |
Disjoint Set UnionModule: advanced-dsa | Complete | Time: O(alpha(N)), Space: O(N) | Missing | Ready | Missing | None | Total: 2 Redundant ConnectionNumber of Provinces | Missing |
Floyd WarshallModule: advanced-dsa | Complete | Time: O(V^3), Space: O(V^2) | Missing | Ready | Missing | None | Total: 1 Find the City With the Smallest Number of Neighbors | Missing |
MSTModule: advanced-dsa | Complete | Time: O(E log V) or O(E log E), Space: O(V) | Missing | Ready | Missing | None | Total: 1 Min Cost to Connect All Points | Missing |
SCC / TarjanModule: advanced-dsa | Complete | Time: O(V + E), Space: O(V) | Missing | Ready | Missing | None | Total: 1 Critical Connections in a Network | Missing |
Interval DPModule: dynamic-programming | Complete | Time: O(N^3), Space: O(N^2) | View | Ready | Open | None | Total: 1 Burst Balloons | Missing |
State Machine DPModule: dynamic-programming | Complete | Time: O(N), Space: O(1) or O(N) | View | Ready | Open | None | Total: 1 Best Time to Buy and Sell Stock with Cooldown | Missing |
Digit DPModule: dynamic-programming | Complete | Time: O(len * states), Space: O(len * states) | View | Ready | Open | None | Total: 1 Number of Digit One | Missing |
Segment TreeModule: advanced-dsa | Complete | Time: O(log N) query/update, O(N) build; Space: O(N) | Missing | Ready | Missing | None | Total: 1 Range Sum Query - Mutable | Missing |
Fenwick TreeModule: advanced-dsa | Complete | Time: O(log N), Space: O(N) | Missing | Ready | Missing | None | Total: 1 Range Sum Query - Mutable | Missing |
Sparse TableModule: advanced-dsa | Complete | Time: O(N log N) build, O(1) query; Space: O(N log N) | Missing | Ready | Missing | None | Total: 1 Sliding Window Maximum | Missing |
Sweep LineModule: advanced-dsa | Complete | Time: O(N log N), Space: O(N) | Missing | Ready | Missing | None | Total: 1 The Skyline Problem | Missing |
Meet In The MiddleModule: advanced-dsa | Complete | Time: O(2^(N/2) * N), Space: O(2^(N/2)) | Missing | Ready | Missing | None | Total: 1 Closest Subsequence Sum | Missing |
QuickselectModule: advanced-dsa | Complete | Time: O(N) average, O(N^2) worst case; Space: O(1) | Missing | Ready | Missing | None | Total: 1 Kth Largest Element in an Array | Missing |
Maintains a sub-segment window over linear items (arrays/strings) to process contiguous values efficiently.
Uses two pointer variables moving inward or at different speeds to solve matching bounds.
Divides sorted search bounds in half on each step, reducing logarithmic checks.
Keeps elements ordered in a heap tree to fetch the minimum or maximum instantly in O(1) time.
Flood fills node nodes layer-by-layer (BFS queue) or traverses deep paths recursively (DFS stack).
Stores calculations of smaller subproblems in tables to resolve duplicates.
Enables range modifications on arrays in O(1) time by storing delta shifts at endpoints.
Three-way partitioning technique to sort elements in-place in linear time.
In-place array sorting when input values are in a bounded contiguous range.
Find the first element in a sorted collection that is not less than the target value.
Find the first element in a sorted collection that is strictly greater than the target value.
Uses two pointers moving at different speeds (1 step vs 2 steps) to evaluate nodes connectivity.
Verify node cycle overlaps inside lists or graphs.
Maintains partitions of elements and checks subset connections in constant time.
Computes all-pairs shortest paths on weighted graphs in cubic time.
Connect all vertices using edges of minimum total weight without cycles.
Find maximal subgraphs where every vertex is reachable from every other vertex.
Solve dynamic programming subproblems on intervals, expanding from size 1 to N.
DP where the choice at each step depends on transitioning between specific system states.
Count numbers satisfying a criteria in a range [A, B] by building digits recursively.
Tree structure storing interval results to answer range queries and updates in logarithmic time.
Array-based structure storing dynamic cumulative sums using bit alignments.
Pre-calculates values on power-of-two intervals to answer static range queries in constant O(1) time.
Solves geometric coordinate intersections by sorting event endpoints and sweeping a line across the space.
Search space splitting optimization for subset sums where input size is too large for simple recursion.
Find the Kth smallest/largest element in an unsorted array in linear time.