How adhithiya-77/leetcode-solutions works
This repository is a collection of standalone LeetCode solutions for DSA practice, not a single application. The intended workflow is to select a problem, provide its input to that solution’s method, and receive its result. The graph groups the solutions by their apparent algorithmic focus; individual implementations are independent. The README describes the collection, but does not specify a runtime dispatcher or shared execution layer, so caller-to-solution links are shown as unverified.
Main entry points: maximum-product-subarray.py Maximum Product · product-of-array-except-self.py Product Except Self · move-zeroes.py Move Zeroes · max-consecutive-ones.py Maximum Ones
Components 20
Array Algorithms
- Maximum Product
152-maximum-product-subarray/maximum-product-subarray.py - Product Except Self
238-product-of-array-except-self/product-of-array-except-self.py - Move Zeroes
283-move-zeroes/move-zeroes.py - Maximum Ones
485-max-consecutive-ones/max-consecutive-ones.py - Maximum Subarray
53-maximum-subarray/maximum-subarray.py - Sort Colors
75-sort-colors/sort-colors.py - Pivot Index
724-find-pivot-index/find-pivot-index.py - Stable Index
4284-smallest-stable-index-i/smallest-stable-index-i.py
Window And Prefix
- Subarray Divisible
1016-subarray-sums-divisible-by-k/subarray-sums-divisible-by-k.py - Ones III
1046-max-consecutive-ones-iii/max-consecutive-ones-iii.py - Minimum Subarray
209-minimum-size-subarray-sum/minimum-size-subarray-sum.py - Subarray Product
713-subarray-product-less-than-k/subarray-product-less-than-k.py
Two Pointer
- Container Water
11-container-with-most-water/container-with-most-water.py - Three Sum
15-3sum/3sum.py - Two Sum Sorted
167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py - Four Sum
18-4sum/4sum.py
String Algorithms
- Valid Palindrome
125-valid-palindrome/valid-palindrome.py - Palindrome II
680-valid-palindrome-ii/valid-palindrome-ii.py
Search And Index
- Binary Search
792-binary-search/binary-search.py
Other components
- Problem Caller
Connections 19
- Problem Caller → Subarray Divisible: invokes method
- Problem Caller → Ones III: invokes method
- Problem Caller → Minimum Subarray: invokes method
- Problem Caller → Subarray Product: invokes method
- Problem Caller → Container Water: invokes method
- Problem Caller → Three Sum: invokes method
- Problem Caller → Two Sum Sorted: invokes method
- Problem Caller → Four Sum: invokes method
- Problem Caller → Valid Palindrome: invokes method
- Problem Caller → Palindrome II: invokes method
- Problem Caller → Maximum Product: invokes method
- Problem Caller → Product Except Self: invokes method
- Problem Caller → Move Zeroes: invokes method
- Problem Caller → Maximum Ones: invokes method
- Problem Caller → Maximum Subarray: invokes method
- Problem Caller → Sort Colors: invokes method
- Problem Caller → Pivot Index: invokes method
- Problem Caller → Stable Index: invokes method
- Problem Caller → Binary Search: invokes method