# rathorchanchal1/leetcode_solutions architecture

> Architecture diagram of the GitHub repository rathorchanchal1/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/rathorchanchal1/leetcode_solutions
- Repository: https://github.com/rathorchanchal1/leetcode_solutions

## Overview

This repository is a collection of independent Java solutions to coding problems, not a shared application: a caller supplies problem inputs to an individual solution method and receives its result. The solutions cover arrays, searching, strings, and dynamic programming. The sampled 3Sum implementation calls its own twoSum helper; no other cross-solution calls or shared runtime are evidenced. README content is empty, so the map reflects the source index and sampled implementations rather than documented product capabilities.

Main entry points: [`Medium/15-3sum/Solution.java`](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/15-3sum/Solution.java) (3Sum)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_easy["Easy Solutions"]
  node_two_sum["Two Sum<br/>[Solution.java]"]
  node_valid_palindrome["Valid Palindrome<br/>[Solution.java]"]
  node_contains_duplicate["Contains Duplicate<br/>[Solution.java]"]
  node_palindrome_number["Palindrome Number<br/>[Solution.java]"]
end

subgraph group_array["Array Techniques"]
  node_container_water["Container Water<br/>[Solution.java]"]
  node_three_sum["3Sum<br/>[Solution.java]"]
  node_three_sum_helper["Two Sum Helper<br/>[Solution.java]"]
  node_product_except_self["Product Except Self<br/>[Solution.java]"]
  node_top_k_frequent["Top K Frequent<br/>[Solution.java]"]
  node_maximum_subarray["Maximum Subarray<br/>[Solution.java]"]
end

subgraph group_search["Search Problems"]
  node_find_minimum["Find Minimum<br/>[Solution.java]"]
  node_rotated_search["Rotated Search<br/>[Solution.java]"]
end

subgraph group_strings["Strings And DP"]
  node_longest_substring["Longest Substring<br/>[Solution.java]"]
  node_interleaving_string["Interleaving String<br/>[Solution.java]"]
end

node_actor(("Solution caller"))

node_three_sum -->|"calls"| node_three_sum_helper

click node_two_sum "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/1-two-sum/Solution.java"
click node_valid_palindrome "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/125-valid-palindrome/Solution.java"
click node_contains_duplicate "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/217-contains-duplicate/Solution.java"
click node_palindrome_number "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/9-palindrome-number/Solution.java"
click node_container_water "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/11-container-with-most-water/Solution.java"
click node_three_sum "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/15-3sum/Solution.java"
click node_three_sum_helper "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/15-3sum/Solution.java"
click node_product_except_self "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/238-product-of-array-except-self/Solution.java"
click node_top_k_frequent "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/347-top-k-frequent-elements/Solution.java"
click node_maximum_subarray "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/53-maximum-subarray/Solution.java"
click node_find_minimum "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/153-find-minimum-in-rotated-sorted-array/Solution.java"
click node_rotated_search "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/33-search-in-rotated-sorted-array/Solution.java"
click node_longest_substring "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/3-longest-substring-without-repeating-characters/Solution.java"
click node_interleaving_string "https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/97-interleaving-string/Solution.java"

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_two_sum,node_valid_palindrome,node_contains_duplicate,node_palindrome_number toneBlue
class node_container_water,node_three_sum,node_three_sum_helper,node_product_except_self,node_top_k_frequent,node_maximum_subarray toneAmber
class node_find_minimum,node_rotated_search toneMint
class node_longest_substring,node_interleaving_string toneRose
class node_actor toneIndigo
```

## Components

### Easy Solutions

- [Two Sum](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/1-two-sum/Solution.java): `Easy/1-two-sum/Solution.java`
- [Valid Palindrome](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/125-valid-palindrome/Solution.java): `Easy/125-valid-palindrome/Solution.java`
- [Contains Duplicate](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/217-contains-duplicate/Solution.java): `Easy/217-contains-duplicate/Solution.java`
- [Palindrome Number](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Easy/9-palindrome-number/Solution.java): `Easy/9-palindrome-number/Solution.java`

### Array Techniques

- [Container Water](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/11-container-with-most-water/Solution.java): `Medium/11-container-with-most-water/Solution.java`
- [3Sum](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/15-3sum/Solution.java): `Medium/15-3sum/Solution.java`
- [Two Sum Helper](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/15-3sum/Solution.java): `Medium/15-3sum/Solution.java`
- [Product Except Self](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/238-product-of-array-except-self/Solution.java): `Medium/238-product-of-array-except-self/Solution.java`
- [Top K Frequent](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/347-top-k-frequent-elements/Solution.java): `Medium/347-top-k-frequent-elements/Solution.java`
- [Maximum Subarray](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/53-maximum-subarray/Solution.java): `Medium/53-maximum-subarray/Solution.java`

### Search Problems

- [Find Minimum](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/153-find-minimum-in-rotated-sorted-array/Solution.java): `Medium/153-find-minimum-in-rotated-sorted-array/Solution.java`
- [Rotated Search](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/33-search-in-rotated-sorted-array/Solution.java): `Medium/33-search-in-rotated-sorted-array/Solution.java`

### Strings And DP

- [Longest Substring](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/3-longest-substring-without-repeating-characters/Solution.java): `Medium/3-longest-substring-without-repeating-characters/Solution.java`
- [Interleaving String](https://github.com/rathorchanchal1/leetcode_solutions/blob/main/Medium/97-interleaving-string/Solution.java): `Medium/97-interleaving-string/Solution.java`

### Other components

- **Solution caller**

## Connections

- 3Sum → Two Sum Helper: calls (evidence: `Medium/15-3sum/Solution.java`)
