How sanju1098/leetcode-problems works
This repository is a collection of independent LeetCode solution files, not a single application or shared runtime. Each JavaScript or Java file implements a problem-specific function or data structure that a judge supplies with inputs and consumes as a result. The tree includes algorithms for arrays and strings, trees and lists, grids and geometry, scheduling, and graph optimization. The README provides no broader product workflow, and the sampled solutions do not import one another, so the graph shows representative independent solutions rather than invented connections. Other files in the tree are likewise standalone solutions.
Main entry points: find-servers-that-handled-most-number-of-requests.js Server metrics · process-tasks-using-servers.js Task scheduling · minimum-operations-to-make-elements-within-k-subarrays-equal.js Window optimization · minimum-pair-removal-to-sort-array-ii.js Pair removal
Components 16
Algorithm solutions
- Task scheduling
2012-process-tasks-using-servers/process-tasks-using-servers.js - Server metrics
1710-find-servers-that-handled-most-number-of-requests/find-servers-that-handled-most-number-of-requests.js - Window optimization
3717-minimum-operations-to-make-elements-within-k-subarrays-equal/minimum-operations-to-make-elements-within-k-subarrays-equal.js - Pair removal
3772-minimum-pair-removal-to-sort-array-ii/minimum-pair-removal-to-sort-array-ii.js - Graph paths
3887-minimum-cost-path-with-edge-reversals/minimum-cost-path-with-edge-reversals.js - BST balancing
1285-balance-a-binary-search-tree/balance-a-binary-search-tree.js - BST ancestor
235-lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.js - Grid propagation
1036-rotting-oranges/rotting-oranges.js - Rectangle geometry
3325-find-the-largest-area-of-square-inside-two-rectangles/find-the-largest-area-of-square-inside-two-rectangles.js - Binary search
792-binary-search/binary-search.js
Data structures
- Min heap
2012-process-tasks-using-servers/process-tasks-using-servers.js - Availability tree
1710-find-servers-that-handled-most-number-of-requests/find-servers-that-handled-most-number-of-requests.js - Fenwick trees
3717-minimum-operations-to-make-elements-within-k-subarrays-equal/minimum-operations-to-make-elements-within-k-subarrays-equal.js - Typed min heap
3772-minimum-pair-removal-to-sort-array-ii/minimum-pair-removal-to-sort-array-ii.js - Path min heap
3887-minimum-cost-path-with-edge-reversals/minimum-cost-path-with-edge-reversals.js
Other components
- LeetCode judge
Connections 16
- LeetCode judge → Task scheduling: calls
2012-process-tasks-using-servers/process-tasks-using-servers.js - LeetCode judge → Server metrics: calls
1710-find-servers-that-handled-most-number-of-requests/find-servers-that-handled-most-number-of-requests.js - LeetCode judge → Window optimization: calls
3717-minimum-operations-to-make-elements-within-k-subarrays-equal/minimum-operations-to-make-elements-within-k-subarrays-equal.js - LeetCode judge → Pair removal: calls
3772-minimum-pair-removal-to-sort-array-ii/minimum-pair-removal-to-sort-array-ii.js - LeetCode judge → Graph paths: calls
3887-minimum-cost-path-with-edge-reversals/minimum-cost-path-with-edge-reversals.js - LeetCode judge → BST balancing: calls
1285-balance-a-binary-search-tree/balance-a-binary-search-tree.js - LeetCode judge → BST ancestor: calls
235-lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.js - LeetCode judge → Grid propagation: calls
- LeetCode judge → Rectangle geometry: calls
3325-find-the-largest-area-of-square-inside-two-rectangles/find-the-largest-area-of-square-inside-two-rectangles.js - LeetCode judge → Binary search: calls
792-binary-search/binary-search.js - Task scheduling → Min heap: defines and uses
2012-process-tasks-using-servers/process-tasks-using-servers.js - Server metrics → Availability tree: defines and uses
1710-find-servers-that-handled-most-number-of-requests/find-servers-that-handled-most-number-of-requests.js - Server metrics → Min heap: defines and uses
1710-find-servers-that-handled-most-number-of-requests/find-servers-that-handled-most-number-of-requests.js - Window optimization → Fenwick trees: defines and uses
3717-minimum-operations-to-make-elements-within-k-subarrays-equal/minimum-operations-to-make-elements-within-k-subarrays-equal.js - Pair removal → Typed min heap: uses
3772-minimum-pair-removal-to-sort-array-ii/minimum-pair-removal-to-sort-array-ii.js - Graph paths → Path min heap: defines and uses
3887-minimum-cost-path-with-edge-reversals/minimum-cost-path-with-edge-reversals.js