How anshulmaletha/leetcode works
This repository is a collection of independent LeetCode solutions, not a single application. The user-facing workflow is to choose a problem’s solution and use it in the corresponding challenge; each file implements its own algorithm and there is no shared runtime or cross-solution pipeline. The graph groups representative solutions by their algorithmic role. The README documents the collection, while sampled source shows standalone implementations; unsampled solutions are not assumed to share internal dependencies.
Main entry points: 0033-search-in-rotated-sorted-array.cpp Search solutions · 0074-search-a-2d-matrix.cpp Matrix search · 1011-capacity-to-ship-packages-within-d-days.cpp Capacity search · 1482-minimum-number-of-days-to-make-m-bouquets.cpp Bouquet scheduling
Components 15
Search and Optimization
- Search solutions
0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.cpp - Matrix search
0074-search-a-2d-matrix/0074-search-a-2d-matrix.cpp - Capacity search
1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.cpp - Bouquet scheduling
1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.cpp
Array Processing
- Array algorithms
0011-container-with-most-water/0011-container-with-most-water.cpp - Matrix traversal
0054-spiral-matrix/0054-spiral-matrix.cpp - Array rearrangement
4065-rearrange-array-by-removing-distinct-values/4065-rearrange-array-by-removing-distinct-values.cpp - Array extrema
4088-difference-between-peaks-and-valleys/4088-difference-between-peaks-and-valleys.cpp
String Processing
- String algorithms
0125-valid-palindrome/0125-valid-palindrome.cpp - Stack parsing
0020-valid-parentheses/0020-valid-parentheses.cpp - RPN evaluation
0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.cpp
Numeric and Logic
- Numeric solutions
0367-valid-perfect-square/0367-valid-perfect-square.cpp - Bit operations
0190-reverse-bits/0190-reverse-bits.cpp - Interval calculations
0495-teemo-attacking/0495-teemo-attacking.cpp
Other components
- LeetCode user
Connections 14
- LeetCode user → Search solutions: selects challenge
- LeetCode user → Matrix search: selects challenge
- LeetCode user → Capacity search: selects challenge
- LeetCode user → Bouquet scheduling: selects challenge
- LeetCode user → Array algorithms: selects challenge
- LeetCode user → Matrix traversal: selects challenge
- LeetCode user → Array rearrangement: selects challenge
- LeetCode user → Array extrema: selects challenge
- LeetCode user → String algorithms: selects challenge
- LeetCode user → Stack parsing: selects challenge
- LeetCode user → RPN evaluation: selects challenge
- LeetCode user → Numeric solutions: selects challenge
- LeetCode user → Bit operations: selects challenge
- LeetCode user → Interval calculations: selects challenge