# harshildhawan21/daily-leetcode architecture

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

- Interactive diagram: https://gitdiagram.com/harshildhawan21/daily-leetcode
- Repository: https://github.com/harshildhawan21/daily-leetcode

## Overview

This repository is an anthology of standalone coding-challenge solutions, not a shared application or library workflow. A user selects a problem-specific file, supplies its expected input to the solution method, and receives that algorithm’s result. The files cover array and numeric problems, strings, games and combinatorial search, grids and geometry, and interval or tree-based techniques. The sampled solutions show independent implementations with no imports or shared runtime; the README is empty, so no broader integration or invocation mechanism is documented.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays &amp; Numbers"]
  node_add_two["Add Two Numbers<br/>[Add Two numbers.py]"]
  node_cinema["Cinema Seats"]
  node_parity1["Uniform Parity I"]
  node_parity2["Uniform Parity II"]
  node_container["Container Water"]
  node_commas["Count Commas<br/>[Count_Commas.py]"]
  node_commas2["Count Commas Java"]
  node_subtree_avg["Subtree Average Count"]
  node_distribute["Distribute Elements"]
  node_divisibility["Divisibility Sum Product"]
  node_missing_elements["Find Missing Elements"]
  node_kth_amount["Kth Smallest Amount"]
  node_largest_missing["Largest Missing Integer"]
  node_reduce_x["Reduce X Operations"]
  node_lex_sequence["Smallest Sequence"]
  node_swap_array["Smallest Swapped Array"]
  node_longest_k["Longest Subarray K"]
  node_max_product["Maximum Product<br/>[MaxProduct.py]"]
  node_max_product2["Maximum Product Pair<br/>[MaxProductof2.py]"]
  node_median["Two-Array Median"]
  node_remove_minmax["Remove Min Max"]
  node_small_div_product["Small Divisible Product"]
  node_small_missing["Smallest Missing Integer"]
  node_small_index["Smallest Index Digit Sum"]
  node_missing_multiple["Smallest Missing Multiple"]
  node_stable1["Stable Index I"]
  node_stable2["Stable Index II"]
  node_two_sum["Two Sum<br/>[TwoSum.py]"]
  node_two_subarrays["Two Target Subarrays"]
  node_unique_even["Unique Even Numbers"]
end

subgraph group_strings["String Algorithms"]
  node_brace["Brace Expansion"]
  node_distinct_subseq["Distinct Subsequences"]
  node_bracket_pairs["Evaluate Bracket Pairs"]
end

subgraph group_combinatorial["Games &amp; Search"]
end

subgraph group_grids["Grids &amp; Geometry"]
end

subgraph group_structures["Intervals &amp; Trees"]
  node_x_value["Array X Value Queries"]
end

click node_add_two "https://github.com/harshildhawan21/daily-leetcode/blob/main/Add%20Two%20numbers.py"
click node_cinema "https://github.com/harshildhawan21/daily-leetcode/blob/main/Cinema_Seat_Allocation.py"
click node_parity1 "https://github.com/harshildhawan21/daily-leetcode/blob/main/Construct_Uniform_Parity_Array-1.py"
click node_parity2 "https://github.com/harshildhawan21/daily-leetcode/blob/main/Construct_Uniform_Parity_Array-2.py"
click node_container "https://github.com/harshildhawan21/daily-leetcode/blob/main/Container_with_Most_Water.py"
click node_commas "https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_Commas.py"
click node_commas2 "https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_Commas_2.java"
click node_subtree_avg "https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_nodes_Equals_to_Avg_of_Subtree.py"
click node_distribute "https://github.com/harshildhawan21/daily-leetcode/blob/main/Distributing_Elements_Into2_Arrays.py"
click node_divisibility "https://github.com/harshildhawan21/daily-leetcode/blob/main/Divisibility_by_Sum_Product.py"
click node_missing_elements "https://github.com/harshildhawan21/daily-leetcode/blob/main/FindMissingElements.py"
click node_kth_amount "https://github.com/harshildhawan21/daily-leetcode/blob/main/Kth_Smallest_Amount.py"
click node_largest_missing "https://github.com/harshildhawan21/daily-leetcode/blob/main/Largest_Missing_Integer.py"
click node_reduce_x "https://github.com/harshildhawan21/daily-leetcode/blob/main/Least_operation_reduce_X_To_0.py"
click node_lex_sequence "https://github.com/harshildhawan21/daily-leetcode/blob/main/LexicographicallySmallestSequence.py"
click node_swap_array "https://github.com/harshildhawan21/daily-leetcode/blob/main/Lexicographically_Smallest_Array_by_Swapping_Elements.py"
click node_longest_k "https://github.com/harshildhawan21/daily-leetcode/blob/main/LongestSubArray_KFeq.py"
click node_max_product "https://github.com/harshildhawan21/daily-leetcode/blob/main/MaxProduct.py"
click node_max_product2 "https://github.com/harshildhawan21/daily-leetcode/blob/main/MaxProductof2.py"
click node_median "https://github.com/harshildhawan21/daily-leetcode/blob/main/Median%20of%202%20sorted%20arrays.java"
click node_remove_minmax "https://github.com/harshildhawan21/daily-leetcode/blob/main/Removing_Min_Max_from_Array.py"
click node_small_div_product "https://github.com/harshildhawan21/daily-leetcode/blob/main/SmallestDivisibleProduct.py"
click node_small_missing "https://github.com/harshildhawan21/daily-leetcode/blob/main/SmallestMissingInt.py"
click node_small_index "https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Index_Digit_Sum_Equal_to_Index.py"
click node_missing_multiple "https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Missing_Multiple.py"
click node_stable1 "https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Stable_Index-1.py"
click node_stable2 "https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Stable_Index-2.py"
click node_two_sum "https://github.com/harshildhawan21/daily-leetcode/blob/main/TwoSum.py"
click node_two_subarrays "https://github.com/harshildhawan21/daily-leetcode/blob/main/Two_Non_Overlapping_Sub_Arrays_each_Target_Sum.py"
click node_unique_even "https://github.com/harshildhawan21/daily-leetcode/blob/main/Unique_3_digit_even_Number.py"
click node_x_value "https://github.com/harshildhawan21/daily-leetcode/blob/main/X_Value_Of_Array-2.java"
click node_brace "https://github.com/harshildhawan21/daily-leetcode/blob/main/Brace_Expansion-2.py"
click node_distinct_subseq "https://github.com/harshildhawan21/daily-leetcode/blob/main/Distinct_Subsequences.py"
click node_bracket_pairs "https://github.com/harshildhawan21/daily-leetcode/blob/main/Evaluating_bracket_Pairs_Of_String.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_add_two,node_cinema,node_parity1,node_parity2,node_container,node_commas,node_commas2,node_subtree_avg,node_distribute,node_divisibility,node_missing_elements,node_kth_amount,node_largest_missing,node_reduce_x,node_lex_sequence,node_swap_array,node_longest_k,node_max_product,node_max_product2,node_median,node_remove_minmax,node_small_div_product,node_small_missing,node_small_index,node_missing_multiple,node_stable1,node_stable2,node_two_sum,node_two_subarrays,node_unique_even toneBlue
class node_brace,node_distinct_subseq,node_bracket_pairs toneAmber
class node_x_value toneIndigo
```

## Components

### Arrays & Numbers

- [Add Two Numbers](https://github.com/harshildhawan21/daily-leetcode/blob/main/Add%20Two%20numbers.py): `Add Two numbers.py`
- [Cinema Seats](https://github.com/harshildhawan21/daily-leetcode/blob/main/Cinema_Seat_Allocation.py): `Cinema_Seat_Allocation.py`
- [Uniform Parity I](https://github.com/harshildhawan21/daily-leetcode/blob/main/Construct_Uniform_Parity_Array-1.py): `Construct_Uniform_Parity_Array-1.py`
- [Uniform Parity II](https://github.com/harshildhawan21/daily-leetcode/blob/main/Construct_Uniform_Parity_Array-2.py): `Construct_Uniform_Parity_Array-2.py`
- [Container Water](https://github.com/harshildhawan21/daily-leetcode/blob/main/Container_with_Most_Water.py): `Container_with_Most_Water.py`
- [Count Commas](https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_Commas.py): `Count_Commas.py`
- [Count Commas Java](https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_Commas_2.java): `Count_Commas_2.java`
- [Subtree Average Count](https://github.com/harshildhawan21/daily-leetcode/blob/main/Count_nodes_Equals_to_Avg_of_Subtree.py): `Count_nodes_Equals_to_Avg_of_Subtree.py`
- [Distribute Elements](https://github.com/harshildhawan21/daily-leetcode/blob/main/Distributing_Elements_Into2_Arrays.py): `Distributing_Elements_Into2_Arrays.py`
- [Divisibility Sum Product](https://github.com/harshildhawan21/daily-leetcode/blob/main/Divisibility_by_Sum_Product.py): `Divisibility_by_Sum_Product.py`
- [Find Missing Elements](https://github.com/harshildhawan21/daily-leetcode/blob/main/FindMissingElements.py): `FindMissingElements.py`
- [Kth Smallest Amount](https://github.com/harshildhawan21/daily-leetcode/blob/main/Kth_Smallest_Amount.py): `Kth_Smallest_Amount.py`
- [Largest Missing Integer](https://github.com/harshildhawan21/daily-leetcode/blob/main/Largest_Missing_Integer.py): `Largest_Missing_Integer.py`
- [Reduce X Operations](https://github.com/harshildhawan21/daily-leetcode/blob/main/Least_operation_reduce_X_To_0.py): `Least_operation_reduce_X_To_0.py`
- [Smallest Sequence](https://github.com/harshildhawan21/daily-leetcode/blob/main/LexicographicallySmallestSequence.py): `LexicographicallySmallestSequence.py`
- [Smallest Swapped Array](https://github.com/harshildhawan21/daily-leetcode/blob/main/Lexicographically_Smallest_Array_by_Swapping_Elements.py): `Lexicographically_Smallest_Array_by_Swapping_Elements.py`
- [Longest Subarray K](https://github.com/harshildhawan21/daily-leetcode/blob/main/LongestSubArray_KFeq.py): `LongestSubArray_KFeq.py`
- [Maximum Product](https://github.com/harshildhawan21/daily-leetcode/blob/main/MaxProduct.py): `MaxProduct.py`
- [Maximum Product Pair](https://github.com/harshildhawan21/daily-leetcode/blob/main/MaxProductof2.py): `MaxProductof2.py`
- [Two-Array Median](https://github.com/harshildhawan21/daily-leetcode/blob/main/Median%20of%202%20sorted%20arrays.java): `Median of 2 sorted arrays.java`
- [Remove Min Max](https://github.com/harshildhawan21/daily-leetcode/blob/main/Removing_Min_Max_from_Array.py): `Removing_Min_Max_from_Array.py`
- [Small Divisible Product](https://github.com/harshildhawan21/daily-leetcode/blob/main/SmallestDivisibleProduct.py): `SmallestDivisibleProduct.py`
- [Smallest Missing Integer](https://github.com/harshildhawan21/daily-leetcode/blob/main/SmallestMissingInt.py): `SmallestMissingInt.py`
- [Smallest Index Digit Sum](https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Index_Digit_Sum_Equal_to_Index.py): `Smallest_Index_Digit_Sum_Equal_to_Index.py`
- [Smallest Missing Multiple](https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Missing_Multiple.py): `Smallest_Missing_Multiple.py`
- [Stable Index I](https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Stable_Index-1.py): `Smallest_Stable_Index-1.py`
- [Stable Index II](https://github.com/harshildhawan21/daily-leetcode/blob/main/Smallest_Stable_Index-2.py): `Smallest_Stable_Index-2.py`
- [Two Sum](https://github.com/harshildhawan21/daily-leetcode/blob/main/TwoSum.py): `TwoSum.py`
- [Two Target Subarrays](https://github.com/harshildhawan21/daily-leetcode/blob/main/Two_Non_Overlapping_Sub_Arrays_each_Target_Sum.py): `Two_Non_Overlapping_Sub_Arrays_each_Target_Sum.py`
- [Unique Even Numbers](https://github.com/harshildhawan21/daily-leetcode/blob/main/Unique_3_digit_even_Number.py): `Unique_3_digit_even_Number.py`

### String Algorithms

- [Brace Expansion](https://github.com/harshildhawan21/daily-leetcode/blob/main/Brace_Expansion-2.py): `Brace_Expansion-2.py`
- [Distinct Subsequences](https://github.com/harshildhawan21/daily-leetcode/blob/main/Distinct_Subsequences.py): `Distinct_Subsequences.py`
- [Evaluate Bracket Pairs](https://github.com/harshildhawan21/daily-leetcode/blob/main/Evaluating_bracket_Pairs_Of_String.py): `Evaluating_bracket_Pairs_Of_String.py`

### Intervals & Trees

- [Array X Value Queries](https://github.com/harshildhawan21/daily-leetcode/blob/main/X_Value_Of_Array-2.java): `X_Value_Of_Array-2.java`
