How nikhi-bit/nikhil-_leetcode works
This repository is a collection of independent C++ LeetCode solutions, not a single application or shared runtime. The principal workflow is to select a problem, provide its inputs to that problem’s Solution method (typically through the judge), and receive its answer. The graph groups representative solutions by algorithmic theme; sampled binary-search solutions also show their internal feasibility checks. The README excerpt is truncated and only some implementations were sampled, so other listed solutions are represented only where their paths and problem names are explicit in the tree.
Main entry points: 1283-find-the-smallest-divisor-given-a-threshold.cpp Smallest Divisor · 0875-koko-eating-bananas.cpp Banana Speed · 0410-split-array-largest-sum.cpp Split Array Sum · 1011-capacity-to-ship-packages-within-d-days.cpp Ship Capacity
Components 23
Array Operations
- Two Sum
0001-two-sum/0001-two-sum.cpp - Four Sum
0018-4sum/0018-4sum.cpp - Window Average
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.cpp
Binary Search
- Rotated Search
0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.cpp - Rotated Search Duplicates
0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.cpp - Smallest Divisor
1283-find-the-smallest-divisor-given-a-threshold/1283-find-the-smallest-divisor-given-a-threshold.cpp - Divisor Feasibility
1283-find-the-smallest-divisor-given-a-threshold/1283-find-the-smallest-divisor-given-a-threshold.cpp - Banana Speed
0875-koko-eating-bananas/0875-koko-eating-bananas.cpp - Speed Feasibility
0875-koko-eating-bananas/0875-koko-eating-bananas.cpp - Split Array Sum
0410-split-array-largest-sum/0410-split-array-largest-sum.cpp - Split Feasibility
0410-split-array-largest-sum/0410-split-array-largest-sum.cpp - Ship Capacity
1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.cpp - Capacity Feasibility
1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.cpp - Magnetic Force
1552-magnetic-force-between-two-balls/1552-magnetic-force-between-two-balls.cpp - Placement Feasibility
1552-magnetic-force-between-two-balls/1552-magnetic-force-between-two-balls.cpp - Trip Completion Time
2187-minimum-time-to-complete-trips/2187-minimum-time-to-complete-trips.cpp - Trip Feasibility
2187-minimum-time-to-complete-trips/2187-minimum-time-to-complete-trips.cpp
Combinatorial Search
- Combination Sum
0039-combination-sum/0039-combination-sum.cpp - Generate Parentheses
0022-generate-parentheses/0022-generate-parentheses.cpp
Strings And Numbers
- String Search
0028-find-the-index-of-the-first-occurrence-in-a-string/0028-find-the-index-of-the-first-occurrence-in-a-string.cpp - Valid Palindrome
0125-valid-palindrome/0125-valid-palindrome.cpp - Happy Number
0202-happy-number/0202-happy-number.cpp
Other components
- LeetCode Judge
Connections 22
- LeetCode Judge → Two Sum: invokes
- LeetCode Judge → Four Sum: invokes
- LeetCode Judge → Window Average: invokes
- LeetCode Judge → Rotated Search: invokes
- LeetCode Judge → Rotated Search Duplicates: invokes
- LeetCode Judge → Smallest Divisor: invokes
- LeetCode Judge → Banana Speed: invokes
- LeetCode Judge → Split Array Sum: invokes
- LeetCode Judge → Ship Capacity: invokes
- LeetCode Judge → Magnetic Force: invokes
- LeetCode Judge → Trip Completion Time: invokes
- LeetCode Judge → Combination Sum: invokes
- LeetCode Judge → Generate Parentheses: invokes
- LeetCode Judge → String Search: invokes
- LeetCode Judge → Valid Palindrome: invokes
- LeetCode Judge → Happy Number: invokes
- Smallest Divisor → Divisor Feasibility: checks candidates
- Banana Speed → Speed Feasibility: checks candidates
- Split Array Sum → Split Feasibility: checks candidates
- Ship Capacity → Capacity Feasibility: checks candidates
- Magnetic Force → Placement Feasibility: checks candidates
- Trip Completion Time → Trip Feasibility: checks candidates