# aryann004/dsa-with-java architecture

> Architecture diagram of the GitHub repository aryann004/dsa-with-java, 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/aryann004/dsa-with-java
- Repository: https://github.com/aryann004/dsa-with-java

## Overview

This repository is a collection of independent Java solutions to coding problems, rather than a single application. The principal workflow is that a judge or caller supplies a problem’s inputs to a solution method and receives its result; the sampled files define algorithms directly and show no shared runtime or calls between solutions. The graph groups representative solutions by problem domain. Many other standalone solutions are present in the tree; no README or sampled source establishes a central dispatcher or broader execution workflow.

Main entry points: [`0001-set-mismatch/0001-set-mismatch.java`](https://github.com/aryann004/dsa-with-java/blob/main/0001-set-mismatch/0001-set-mismatch.java) (Array solutions), [`0704-binary-search/0704-binary-search.java`](https://github.com/aryann004/dsa-with-java/blob/main/0704-binary-search/0704-binary-search.java) (Search solutions), [`0807-max-increase-to-keep-city-skyline/0807-max-increase-to-keep-city-skyline.java`](https://github.com/aryann004/dsa-with-java/blob/main/0807-max-increase-to-keep-city-skyline/0807-max-increase-to-keep-city-skyline.java) (Matrix solutions), [`0006-zigzag-conversion/0006-zigzag-conversion.java`](https://github.com/aryann004/dsa-with-java/blob/main/0006-zigzag-conversion/0006-zigzag-conversion.java) (String solutions)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays and search"]
  node_array_solutions["Array solutions"]
  node_search_solutions["Search solutions"]
  node_matrix_solutions["Matrix solutions"]
end

subgraph group_strings["Strings and parsing"]
  node_string_solutions["String solutions"]
  node_parsing_solutions["Parsing solutions"]
  node_window_solutions["Window solutions"]
  node_parentheses_solutions["Parentheses solutions"]
end

subgraph group_structures["Structures and paths"]
  node_list_solutions["List solutions"]
  node_tree_solutions["Tree solutions"]
  node_grid_path_solutions["Grid path solutions"]
end

subgraph group_math["Math and sequences"]
  node_arithmetic_solutions["Arithmetic solutions"]
  node_sequence_solutions["Sequence solutions"]
  node_optimization_solutions["Optimization solutions"]
end

node_judge(("Judge / caller"))

node_judge -.->|"invokes solution"| node_array_solutions
node_judge -.->|"invokes solution"| node_search_solutions
node_judge -.->|"invokes solution"| node_matrix_solutions
node_judge -.->|"invokes solution"| node_string_solutions
node_judge -.->|"invokes solution"| node_parsing_solutions
node_judge -.->|"invokes solution"| node_window_solutions
node_judge -.->|"invokes solution"| node_parentheses_solutions
node_judge -.->|"invokes solution"| node_list_solutions
node_judge -.->|"invokes solution"| node_tree_solutions
node_judge -.->|"invokes solution"| node_grid_path_solutions
node_judge -.->|"invokes solution"| node_arithmetic_solutions
node_judge -.->|"invokes solution"| node_sequence_solutions
node_judge -.->|"invokes solution"| node_optimization_solutions

click node_array_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0001-set-mismatch/0001-set-mismatch.java"
click node_search_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0704-binary-search/0704-binary-search.java"
click node_matrix_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0807-max-increase-to-keep-city-skyline/0807-max-increase-to-keep-city-skyline.java"
click node_string_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0006-zigzag-conversion/0006-zigzag-conversion.java"
click node_parsing_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0065-valid-number/0065-valid-number.java"
click node_window_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0076-minimum-window-substring/0076-minimum-window-substring.java"
click node_parentheses_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0301-remove-invalid-parentheses/0301-remove-invalid-parentheses.java"
click node_list_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0021-merge-two-sorted-lists/0021-merge-two-sorted-lists.java"
click node_tree_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0144-binary-tree-preorder-traversal/0144-binary-tree-preorder-traversal.java"
click node_grid_path_solutions "https://github.com/aryann004/dsa-with-java/blob/main/2267-check-if-there-is-a-valid-parentheses-string-path/2267-check-if-there-is-a-valid-parentheses-string-path.java"
click node_arithmetic_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0029-divide-two-integers/0029-divide-two-integers.java"
click node_sequence_solutions "https://github.com/aryann004/dsa-with-java/blob/main/0053-maximum-subarray/0053-maximum-subarray.java"
click node_optimization_solutions "https://github.com/aryann004/dsa-with-java/blob/main/1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.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_array_solutions,node_search_solutions,node_matrix_solutions toneBlue
class node_string_solutions,node_parsing_solutions,node_window_solutions,node_parentheses_solutions toneAmber
class node_list_solutions,node_tree_solutions,node_grid_path_solutions toneMint
class node_arithmetic_solutions,node_sequence_solutions,node_optimization_solutions toneRose
class node_judge toneIndigo
```

## Components

### Arrays and search

- [Array solutions](https://github.com/aryann004/dsa-with-java/blob/main/0001-set-mismatch/0001-set-mismatch.java): `0001-set-mismatch/0001-set-mismatch.java`
- [Search solutions](https://github.com/aryann004/dsa-with-java/blob/main/0704-binary-search/0704-binary-search.java): `0704-binary-search/0704-binary-search.java`
- [Matrix solutions](https://github.com/aryann004/dsa-with-java/blob/main/0807-max-increase-to-keep-city-skyline/0807-max-increase-to-keep-city-skyline.java): `0807-max-increase-to-keep-city-skyline/0807-max-increase-to-keep-city-skyline.java`

### Strings and parsing

- [String solutions](https://github.com/aryann004/dsa-with-java/blob/main/0006-zigzag-conversion/0006-zigzag-conversion.java): `0006-zigzag-conversion/0006-zigzag-conversion.java`
- [Parsing solutions](https://github.com/aryann004/dsa-with-java/blob/main/0065-valid-number/0065-valid-number.java): `0065-valid-number/0065-valid-number.java`
- [Window solutions](https://github.com/aryann004/dsa-with-java/blob/main/0076-minimum-window-substring/0076-minimum-window-substring.java): `0076-minimum-window-substring/0076-minimum-window-substring.java`
- [Parentheses solutions](https://github.com/aryann004/dsa-with-java/blob/main/0301-remove-invalid-parentheses/0301-remove-invalid-parentheses.java): `0301-remove-invalid-parentheses/0301-remove-invalid-parentheses.java`

### Structures and paths

- [List solutions](https://github.com/aryann004/dsa-with-java/blob/main/0021-merge-two-sorted-lists/0021-merge-two-sorted-lists.java): `0021-merge-two-sorted-lists/0021-merge-two-sorted-lists.java`
- [Tree solutions](https://github.com/aryann004/dsa-with-java/blob/main/0144-binary-tree-preorder-traversal/0144-binary-tree-preorder-traversal.java): `0144-binary-tree-preorder-traversal/0144-binary-tree-preorder-traversal.java`
- [Grid path solutions](https://github.com/aryann004/dsa-with-java/blob/main/2267-check-if-there-is-a-valid-parentheses-string-path/2267-check-if-there-is-a-valid-parentheses-string-path.java): `2267-check-if-there-is-a-valid-parentheses-string-path/2267-check-if-there-is-a-valid-parentheses-string-path.java`

### Math and sequences

- [Arithmetic solutions](https://github.com/aryann004/dsa-with-java/blob/main/0029-divide-two-integers/0029-divide-two-integers.java): `0029-divide-two-integers/0029-divide-two-integers.java`
- [Sequence solutions](https://github.com/aryann004/dsa-with-java/blob/main/0053-maximum-subarray/0053-maximum-subarray.java): `0053-maximum-subarray/0053-maximum-subarray.java`
- [Optimization solutions](https://github.com/aryann004/dsa-with-java/blob/main/1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.java): `1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.java`

### Other components

- **Judge / caller**

## Connections

- Judge / caller → Array solutions: invokes solution
- Judge / caller → Search solutions: invokes solution
- Judge / caller → Matrix solutions: invokes solution
- Judge / caller → String solutions: invokes solution
- Judge / caller → Parsing solutions: invokes solution
- Judge / caller → Window solutions: invokes solution
- Judge / caller → Parentheses solutions: invokes solution
- Judge / caller → List solutions: invokes solution
- Judge / caller → Tree solutions: invokes solution
- Judge / caller → Grid path solutions: invokes solution
- Judge / caller → Arithmetic solutions: invokes solution
- Judge / caller → Sequence solutions: invokes solution
- Judge / caller → Optimization solutions: invokes solution
