How imganpat/cracking-leetcode works
This repository is a collection of independent LeetCode solutions, mainly in Java with a few JavaScript entries—not a single application with a shared runtime. The user-facing workflow is to choose a problem, run its standalone solution with the platform-provided inputs, and receive the computed answer. The README organizes problems by topic; the groups below reflect those distinct solution areas. The sampled files show individual algorithms, not a shared dispatcher, so links from the initiating user are dashed to indicate the general, unverified invocation pattern.
Main entry points: 0033-search-in-rotated-sorted-array Array and search solutions · 0643-maximum-average-subarray-i Window and range solutions · 1792-maximum-average-pass-ratio Heap and greedy solutions · 0303-range-sum-query-immutable Prefix sum solutions
Components 17
Arrays and search
- Array and search solutions
0033-search-in-rotated-sorted-array - Window and range solutions
0643-maximum-average-subarray-i - Heap and greedy solutions
1792-maximum-average-pass-ratio - Prefix sum solutions
0303-range-sum-query-immutable
Strings and combinations
- String window solutions
0076-minimum-window-substring - String and combination solutions
0017-letter-combinations-of-a-phone-number
Trees and lists
- Tree traversal solutions
0637-average-of-levels-in-binary-tree - BST solutions
0099-recover-binary-search-tree - Tree aggregation solutions
2265-count-nodes-equal-to-average-of-subtree - Linked-list solutions
0002-add-two-numbers
Graphs and grids
- Course scheduling solutions
0207-course-schedule - Graph path solutions
0743-network-delay-time - Grid traversal solutions
0200-number-of-islands
Dynamic programming
- Sequence DP solutions
0300-longest-increasing-subsequence - Planning DP solutions
0198-house-robber - Counting DP solutions
0096-unique-binary-search-trees
Other components
- Problem solver
Connections 16
- Problem solver → Array and search solutions: selects and runs
- Problem solver → Window and range solutions: selects and runs
- Problem solver → Heap and greedy solutions: selects and runs
- Problem solver → Prefix sum solutions: selects and runs
- Problem solver → String window solutions: selects and runs
- Problem solver → String and combination solutions: selects and runs
- Problem solver → Tree traversal solutions: selects and runs
- Problem solver → BST solutions: selects and runs
- Problem solver → Tree aggregation solutions: selects and runs
- Problem solver → Linked-list solutions: selects and runs
- Problem solver → Course scheduling solutions: selects and runs
- Problem solver → Graph path solutions: selects and runs
- Problem solver → Grid traversal solutions: selects and runs
- Problem solver → Sequence DP solutions: selects and runs
- Problem solver → Planning DP solutions: selects and runs
- Problem solver → Counting DP solutions: selects and runs