# tamoziit/leetcode-solutions architecture

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

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

## Overview

This repository is a collection of independent Java solutions to LeetCode-style problems, not an integrated application. The user-to-result flow is to select a problem’s class, provide its inputs, and call its algorithm; there is no shared runtime or orchestration layer. The graph groups solutions by repository area and highlights representative algorithm implementations, including the sampled core modules. The README describes the collection only generally, so relationships among independent solutions are not inferred.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_easy["Easy solutions"]
  node_easy_solutions["Easy algorithms"]
  node_bin_to_int["List to integer<br/>[BinToIntLL.java]"]
  node_buying_candies["Buying candies<br/>[BuyingCandies.java]"]
  node_distribute_elements["Distribute elements"]
  node_earliest_finish["Earliest finish"]
  node_left_right_difference["Left-right difference"]
  node_lucky_integer["Lucky integer<br/>[LuckyInteger.java]"]
  node_pattern_substrings["Pattern substrings"]
  node_rank_transform["Rank transformation"]
  node_weighted_mapping["Weighted word mapping"]
end

subgraph group_medium["Medium solutions"]
  node_medium_solutions["Medium algorithms"]
  node_continuous_search["Continuous search"]
  node_subtree_average["Subtree averages"]
  node_partition_pivot["Partition by pivot"]
  node_gravity_box["Rotating gravity box"]
  node_safest_path["Safest grid path"]
  node_safest_path_alt["Safest path variant"]
  node_subarray_majority["Subarray majority"]
end

subgraph group_hard["Hard solutions"]
  node_hard_solutions["Hard algorithms"]
  node_assigning_weights["Assigning weights"]
  node_suffix_queries["Suffix queries"]
  node_active_sections["Active sections"]
  node_building_height["Building height"]
  node_max_score_paths["Maximum-score paths"]
  node_palindrome_rearrangement["Palindrome rearrangement"]
  node_special_operations["String operations"]
  node_zigzag_dp["Zigzag dynamic programming<br/>[ZigZagArrays1.java]"]
  node_zigzag_matrix["Zigzag matrix powers<br/>[ZigZagArrays2.java]"]
end

subgraph group_quest_arrays["Quest arrays"]
  node_quest_array_solutions["Array exercises"]
  node_smaller_array["Smaller elements<br/>[SmallerArray.java]"]
  node_disappeared_numbers["Missing numbers"]
  node_eval_rpn["Evaluate RPN<br/>[EvalRNP.java]"]
end

subgraph group_quest_queues["Quest queues"]
  node_quest_queue_solutions["Queue exercises"]
end

subgraph group_quest_sprint["Spring sprint"]
end

node_user(("Problem solver"))

click node_easy_solutions "https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Easy"
click node_bin_to_int "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/BinToIntLL.java"
click node_buying_candies "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/BuyingCandies.java"
click node_distribute_elements "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/DistributeElesInArray1.java"
click node_earliest_finish "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/EarliestFinishTime.java"
click node_left_right_difference "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/LeftRightDifference.java"
click node_lucky_integer "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/LuckyInteger.java"
click node_pattern_substrings "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/PatternSubstrings.java"
click node_rank_transform "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/RankTransformationOfArray.java"
click node_weighted_mapping "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/WeightedWordMapping.java"
click node_medium_solutions "https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Medium"
click node_continuous_search "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/ContinuousBinSearch.java"
click node_subtree_average "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/NodesEqualToAverageOfSubtree.java"
click node_partition_pivot "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/PartitionByPivot.java"
click node_gravity_box "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/RotatingGravityBox.java"
click node_safest_path "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SafestPathInGrid.java"
click node_safest_path_alt "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SafestPathInGrid2.java"
click node_subarray_majority "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SubArrayMajority1.java"
click node_hard_solutions "https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Hard"
click node_assigning_weights "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/AssigningWeightsLCA.java"
click node_suffix_queries "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/LongestCommonSuffixQueries.java"
click node_active_sections "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/MaxActiveSectionsWithTrade2.java"
click node_building_height "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/MaxBuildingHeight.java"
click node_max_score_paths "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/PathsWithMaxScore.java"
click node_palindrome_rearrangement "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/SmallestPalindromicRearrangement2.java"
click node_special_operations "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/StringSpecialOps2.java"
click node_zigzag_dp "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/ZigZagArrays1.java"
click node_zigzag_matrix "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/ZigZagArrays2.java"
click node_quest_array_solutions "https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode_Quest/Arrays"
click node_smaller_array "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/SmallerArray.java"
click node_disappeared_numbers "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/DisappearedNumbers.java"
click node_eval_rpn "https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/EvalRNP.java"
click node_quest_queue_solutions "https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode_Quest/Queues"

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_easy_solutions,node_bin_to_int,node_buying_candies,node_distribute_elements,node_earliest_finish,node_left_right_difference,node_lucky_integer,node_pattern_substrings,node_rank_transform,node_weighted_mapping toneBlue
class node_medium_solutions,node_continuous_search,node_subtree_average,node_partition_pivot,node_gravity_box,node_safest_path,node_safest_path_alt,node_subarray_majority toneAmber
class node_hard_solutions,node_assigning_weights,node_suffix_queries,node_active_sections,node_building_height,node_max_score_paths,node_palindrome_rearrangement,node_special_operations,node_zigzag_dp,node_zigzag_matrix toneMint
class node_quest_array_solutions,node_smaller_array,node_disappeared_numbers,node_eval_rpn toneRose
class node_quest_queue_solutions,node_user toneIndigo
```

## Components

### Easy solutions

- [Easy algorithms](https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Easy): `Leetcode-Easy`
- [List to integer](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/BinToIntLL.java): `Leetcode-Easy/BinToIntLL.java`
- [Buying candies](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/BuyingCandies.java): `Leetcode-Easy/BuyingCandies.java`
- [Distribute elements](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/DistributeElesInArray1.java): `Leetcode-Easy/DistributeElesInArray1.java`
- [Earliest finish](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/EarliestFinishTime.java): `Leetcode-Easy/EarliestFinishTime.java`
- [Left-right difference](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/LeftRightDifference.java): `Leetcode-Easy/LeftRightDifference.java`
- [Lucky integer](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/LuckyInteger.java): `Leetcode-Easy/LuckyInteger.java`
- [Pattern substrings](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/PatternSubstrings.java): `Leetcode-Easy/PatternSubstrings.java`
- [Rank transformation](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/RankTransformationOfArray.java): `Leetcode-Easy/RankTransformationOfArray.java`
- [Weighted word mapping](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Easy/WeightedWordMapping.java): `Leetcode-Easy/WeightedWordMapping.java`

### Medium solutions

- [Medium algorithms](https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Medium): `Leetcode-Medium`
- [Continuous search](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/ContinuousBinSearch.java): `Leetcode-Medium/ContinuousBinSearch.java`
- [Subtree averages](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/NodesEqualToAverageOfSubtree.java): `Leetcode-Medium/NodesEqualToAverageOfSubtree.java`
- [Partition by pivot](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/PartitionByPivot.java): `Leetcode-Medium/PartitionByPivot.java`
- [Rotating gravity box](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/RotatingGravityBox.java): `Leetcode-Medium/RotatingGravityBox.java`
- [Safest grid path](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SafestPathInGrid.java): `Leetcode-Medium/SafestPathInGrid.java`
- [Safest path variant](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SafestPathInGrid2.java): `Leetcode-Medium/SafestPathInGrid2.java`
- [Subarray majority](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Medium/SubArrayMajority1.java): `Leetcode-Medium/SubArrayMajority1.java`

### Hard solutions

- [Hard algorithms](https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode-Hard): `Leetcode-Hard`
- [Assigning weights](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/AssigningWeightsLCA.java): `Leetcode-Hard/AssigningWeightsLCA.java`
- [Suffix queries](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/LongestCommonSuffixQueries.java): `Leetcode-Hard/LongestCommonSuffixQueries.java`
- [Active sections](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/MaxActiveSectionsWithTrade2.java): `Leetcode-Hard/MaxActiveSectionsWithTrade2.java`
- [Building height](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/MaxBuildingHeight.java): `Leetcode-Hard/MaxBuildingHeight.java`
- [Maximum-score paths](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/PathsWithMaxScore.java): `Leetcode-Hard/PathsWithMaxScore.java`
- [Palindrome rearrangement](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/SmallestPalindromicRearrangement2.java): `Leetcode-Hard/SmallestPalindromicRearrangement2.java`
- [String operations](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/StringSpecialOps2.java): `Leetcode-Hard/StringSpecialOps2.java`
- [Zigzag dynamic programming](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/ZigZagArrays1.java): `Leetcode-Hard/ZigZagArrays1.java`
- [Zigzag matrix powers](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode-Hard/ZigZagArrays2.java): `Leetcode-Hard/ZigZagArrays2.java`

### Quest arrays

- [Array exercises](https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode_Quest/Arrays): `Leetcode_Quest/Arrays`
- [Smaller elements](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/SmallerArray.java): `Leetcode_Quest/Arrays/SmallerArray.java`
- [Missing numbers](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/DisappearedNumbers.java): `Leetcode_Quest/Arrays/DisappearedNumbers.java`
- [Evaluate RPN](https://github.com/tamoziit/leetcode-solutions/blob/main/Leetcode_Quest/Arrays/EvalRNP.java): `Leetcode_Quest/Arrays/EvalRNP.java`

### Quest queues

- [Queue exercises](https://github.com/tamoziit/leetcode-solutions/tree/main/Leetcode_Quest/Queues): `Leetcode_Quest/Queues`

### Other components

- **Problem solver**
