# adhithiya-77/leetcode-solutions architecture

> Architecture diagram of the GitHub repository adhithiya-77/leetcode-solutions, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-01). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/adhithiya-77/leetcode-solutions
- Repository: https://github.com/adhithiya-77/leetcode-solutions

## Overview

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: [`152-maximum-product-subarray/maximum-product-subarray.py`](https://github.com/adhithiya-77/leetcode-solutions/blob/main/152-maximum-product-subarray/maximum-product-subarray.py) (Maximum Product), [`238-product-of-array-except-self/product-of-array-except-self.py`](https://github.com/adhithiya-77/leetcode-solutions/blob/main/238-product-of-array-except-self/product-of-array-except-self.py) (Product Except Self), [`283-move-zeroes/move-zeroes.py`](https://github.com/adhithiya-77/leetcode-solutions/blob/main/283-move-zeroes/move-zeroes.py) (Move Zeroes), [`485-max-consecutive-ones/max-consecutive-ones.py`](https://github.com/adhithiya-77/leetcode-solutions/blob/main/485-max-consecutive-ones/max-consecutive-ones.py) (Maximum Ones)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array Algorithms"]
  node_max_product["Maximum Product"]
  node_product_except_self["Product Except Self"]
  node_move_zeroes["Move Zeroes<br/>[move-zeroes.py]"]
  node_max_ones["Maximum Ones"]
  node_max_subarray["Maximum Subarray"]
  node_sort_colors["Sort Colors<br/>[sort-colors.py]"]
  node_pivot_index["Pivot Index"]
  node_stable_index["Stable Index"]
end

subgraph group_windows["Window And Prefix"]
  node_subarray_divk["Subarray Divisible"]
  node_ones_iii["Ones III"]
  node_min_subarray["Minimum Subarray"]
  node_subarray_product["Subarray Product"]
end

subgraph group_pointers["Two Pointer"]
  node_container_water["Container Water"]
  node_three_sum["Three Sum<br/>[3sum.py]"]
  node_two_sum_sorted["Two Sum Sorted"]
  node_four_sum["Four Sum<br/>[4sum.py]"]
end

subgraph group_strings["String Algorithms"]
  node_valid_palindrome["Valid Palindrome"]
  node_palindrome_ii["Palindrome II"]
end

subgraph group_search["Search And Index"]
  node_binary_search["Binary Search<br/>[binary-search.py]"]
end

node_caller(("Problem Caller"))

node_caller -.->|"invokes method"| node_subarray_divk
node_caller -.->|"invokes method"| node_ones_iii
node_caller -.->|"invokes method"| node_min_subarray
node_caller -.->|"invokes method"| node_subarray_product
node_caller -.->|"invokes method"| node_container_water
node_caller -.->|"invokes method"| node_three_sum
node_caller -.->|"invokes method"| node_two_sum_sorted
node_caller -.->|"invokes method"| node_four_sum
node_caller -.->|"invokes method"| node_valid_palindrome
node_caller -.->|"invokes method"| node_palindrome_ii
node_caller -.->|"invokes method"| node_max_product
node_caller -.->|"invokes method"| node_product_except_self
node_caller -.->|"invokes method"| node_move_zeroes
node_caller -.->|"invokes method"| node_max_ones
node_caller -.->|"invokes method"| node_max_subarray
node_caller -.->|"invokes method"| node_sort_colors
node_caller -.->|"invokes method"| node_pivot_index
node_caller -.->|"invokes method"| node_stable_index
node_caller -.->|"invokes method"| node_binary_search

click node_subarray_divk "https://github.com/adhithiya-77/leetcode-solutions/blob/main/1016-subarray-sums-divisible-by-k/subarray-sums-divisible-by-k.py"
click node_ones_iii "https://github.com/adhithiya-77/leetcode-solutions/blob/main/1046-max-consecutive-ones-iii/max-consecutive-ones-iii.py"
click node_min_subarray "https://github.com/adhithiya-77/leetcode-solutions/blob/main/209-minimum-size-subarray-sum/minimum-size-subarray-sum.py"
click node_subarray_product "https://github.com/adhithiya-77/leetcode-solutions/blob/main/713-subarray-product-less-than-k/subarray-product-less-than-k.py"
click node_container_water "https://github.com/adhithiya-77/leetcode-solutions/blob/main/11-container-with-most-water/container-with-most-water.py"
click node_three_sum "https://github.com/adhithiya-77/leetcode-solutions/blob/main/15-3sum/3sum.py"
click node_two_sum_sorted "https://github.com/adhithiya-77/leetcode-solutions/blob/main/167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py"
click node_four_sum "https://github.com/adhithiya-77/leetcode-solutions/blob/main/18-4sum/4sum.py"
click node_valid_palindrome "https://github.com/adhithiya-77/leetcode-solutions/blob/main/125-valid-palindrome/valid-palindrome.py"
click node_palindrome_ii "https://github.com/adhithiya-77/leetcode-solutions/blob/main/680-valid-palindrome-ii/valid-palindrome-ii.py"
click node_max_product "https://github.com/adhithiya-77/leetcode-solutions/blob/main/152-maximum-product-subarray/maximum-product-subarray.py"
click node_product_except_self "https://github.com/adhithiya-77/leetcode-solutions/blob/main/238-product-of-array-except-self/product-of-array-except-self.py"
click node_move_zeroes "https://github.com/adhithiya-77/leetcode-solutions/blob/main/283-move-zeroes/move-zeroes.py"
click node_max_ones "https://github.com/adhithiya-77/leetcode-solutions/blob/main/485-max-consecutive-ones/max-consecutive-ones.py"
click node_max_subarray "https://github.com/adhithiya-77/leetcode-solutions/blob/main/53-maximum-subarray/maximum-subarray.py"
click node_sort_colors "https://github.com/adhithiya-77/leetcode-solutions/blob/main/75-sort-colors/sort-colors.py"
click node_pivot_index "https://github.com/adhithiya-77/leetcode-solutions/blob/main/724-find-pivot-index/find-pivot-index.py"
click node_stable_index "https://github.com/adhithiya-77/leetcode-solutions/blob/main/4284-smallest-stable-index-i/smallest-stable-index-i.py"
click node_binary_search "https://github.com/adhithiya-77/leetcode-solutions/blob/main/792-binary-search/binary-search.py"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_max_product,node_product_except_self,node_move_zeroes,node_max_ones,node_max_subarray,node_sort_colors,node_pivot_index,node_stable_index toneBlue
class node_subarray_divk,node_ones_iii,node_min_subarray,node_subarray_product toneAmber
class node_container_water,node_three_sum,node_two_sum_sorted,node_four_sum toneMint
class node_valid_palindrome,node_palindrome_ii toneRose
class node_binary_search,node_caller toneIndigo
```

## Components

### Array Algorithms

- [Maximum Product](https://github.com/adhithiya-77/leetcode-solutions/blob/main/152-maximum-product-subarray/maximum-product-subarray.py): `152-maximum-product-subarray/maximum-product-subarray.py`
- [Product Except Self](https://github.com/adhithiya-77/leetcode-solutions/blob/main/238-product-of-array-except-self/product-of-array-except-self.py): `238-product-of-array-except-self/product-of-array-except-self.py`
- [Move Zeroes](https://github.com/adhithiya-77/leetcode-solutions/blob/main/283-move-zeroes/move-zeroes.py): `283-move-zeroes/move-zeroes.py`
- [Maximum Ones](https://github.com/adhithiya-77/leetcode-solutions/blob/main/485-max-consecutive-ones/max-consecutive-ones.py): `485-max-consecutive-ones/max-consecutive-ones.py`
- [Maximum Subarray](https://github.com/adhithiya-77/leetcode-solutions/blob/main/53-maximum-subarray/maximum-subarray.py): `53-maximum-subarray/maximum-subarray.py`
- [Sort Colors](https://github.com/adhithiya-77/leetcode-solutions/blob/main/75-sort-colors/sort-colors.py): `75-sort-colors/sort-colors.py`
- [Pivot Index](https://github.com/adhithiya-77/leetcode-solutions/blob/main/724-find-pivot-index/find-pivot-index.py): `724-find-pivot-index/find-pivot-index.py`
- [Stable Index](https://github.com/adhithiya-77/leetcode-solutions/blob/main/4284-smallest-stable-index-i/smallest-stable-index-i.py): `4284-smallest-stable-index-i/smallest-stable-index-i.py`

### Window And Prefix

- [Subarray Divisible](https://github.com/adhithiya-77/leetcode-solutions/blob/main/1016-subarray-sums-divisible-by-k/subarray-sums-divisible-by-k.py): `1016-subarray-sums-divisible-by-k/subarray-sums-divisible-by-k.py`
- [Ones III](https://github.com/adhithiya-77/leetcode-solutions/blob/main/1046-max-consecutive-ones-iii/max-consecutive-ones-iii.py): `1046-max-consecutive-ones-iii/max-consecutive-ones-iii.py`
- [Minimum Subarray](https://github.com/adhithiya-77/leetcode-solutions/blob/main/209-minimum-size-subarray-sum/minimum-size-subarray-sum.py): `209-minimum-size-subarray-sum/minimum-size-subarray-sum.py`
- [Subarray Product](https://github.com/adhithiya-77/leetcode-solutions/blob/main/713-subarray-product-less-than-k/subarray-product-less-than-k.py): `713-subarray-product-less-than-k/subarray-product-less-than-k.py`

### Two Pointer

- [Container Water](https://github.com/adhithiya-77/leetcode-solutions/blob/main/11-container-with-most-water/container-with-most-water.py): `11-container-with-most-water/container-with-most-water.py`
- [Three Sum](https://github.com/adhithiya-77/leetcode-solutions/blob/main/15-3sum/3sum.py): `15-3sum/3sum.py`
- [Two Sum Sorted](https://github.com/adhithiya-77/leetcode-solutions/blob/main/167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py): `167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py`
- [Four Sum](https://github.com/adhithiya-77/leetcode-solutions/blob/main/18-4sum/4sum.py): `18-4sum/4sum.py`

### String Algorithms

- [Valid Palindrome](https://github.com/adhithiya-77/leetcode-solutions/blob/main/125-valid-palindrome/valid-palindrome.py): `125-valid-palindrome/valid-palindrome.py`
- [Palindrome II](https://github.com/adhithiya-77/leetcode-solutions/blob/main/680-valid-palindrome-ii/valid-palindrome-ii.py): `680-valid-palindrome-ii/valid-palindrome-ii.py`

### Search And Index

- [Binary Search](https://github.com/adhithiya-77/leetcode-solutions/blob/main/792-binary-search/binary-search.py): `792-binary-search/binary-search.py`

### Other components

- **Problem Caller**

## Connections

- 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
