# srishtikapoor22/leetcode architecture

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

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

## Overview

This repository is a collection of independent LeetCode array and search-algorithm submissions, not a shared application. The principal workflow is per problem: a judge supplies an input to a solution method, which computes and returns a result (or mutates the input array). The solutions do not call one another, and no shared runtime layer is visible. Groups reflect algorithmic responsibilities; the root README lists problem topics, while source excerpts show individual implementations. No cross-component edges are included because no shared dispatch or call flow is evidenced.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_search["Search and Bounds"]
  node_range["Search Range"]
  node_insert["Insert Position"]
  node_sqrt["Integer Square Root<br/>[0069-sqrtx.java]"]
  node_rotated["Rotated Search"]
  node_minimum["Rotated Minimum"]
  node_split["Array Split"]
  node_singleton["Single Element"]
  node_bananas["Banana Speed"]
  node_shipping["Shipping Capacity"]
  node_divisor["Threshold Divisor"]
  node_bouquets["Bouquet Days"]
  node_missing["Missing Positive"]
  node_binary["Binary Search<br/>[binary-search.java]"]
end

subgraph group_transform["Array Transformations"]
  node_spiral["Spiral Traversal"]
  node_pascal["Pascal Triangle"]
  node_rotate["Rotate Array"]
  node_zeroes["Move Zeroes"]
  node_concat["Array Concatenation"]
  node_rearrange["Sign Rearrangement"]
  node_matrixzero["Matrix Zeroing"]
  node_merge["Merge Sorted Arrays"]
end

subgraph group_sums["Sum Algorithms"]
  node_twosum["Two Sum<br/>[two-sum.java]"]
  node_threesum["Three Sum<br/>[3sum.java]"]
  node_foursum["Four Sum<br/>[4sum.java]"]
  node_maximum["Maximum Subarray"]
  node_subarrays["Subarray Sum"]
end

subgraph group_counts["Counting Algorithms"]
  node_ones["Consecutive Ones"]
  node_majority["Majority Element"]
  node_majoritytwo["Majority Elements II"]
end

node_actor(("Problem Judge"))

click node_range "https://github.com/srishtikapoor22/leetcode/blob/main/0034-find-first-and-last-position-of-element-in-sorted-array/0034-find-first-and-last-position-of-element-in-sorted-array.java"
click node_insert "https://github.com/srishtikapoor22/leetcode/blob/main/0035-search-insert-position/0035-search-insert-position.java"
click node_sqrt "https://github.com/srishtikapoor22/leetcode/blob/main/0069-sqrtx/0069-sqrtx.java"
click node_rotated "https://github.com/srishtikapoor22/leetcode/blob/main/0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.java"
click node_minimum "https://github.com/srishtikapoor22/leetcode/blob/main/0153-find-minimum-in-rotated-sorted-array/0153-find-minimum-in-rotated-sorted-array.java"
click node_split "https://github.com/srishtikapoor22/leetcode/blob/main/0410-split-array-largest-sum/0410-split-array-largest-sum.py"
click node_singleton "https://github.com/srishtikapoor22/leetcode/blob/main/0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.java"
click node_bananas "https://github.com/srishtikapoor22/leetcode/blob/main/0875-koko-eating-bananas/0875-koko-eating-bananas.java"
click node_shipping "https://github.com/srishtikapoor22/leetcode/blob/main/1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.py"
click node_divisor "https://github.com/srishtikapoor22/leetcode/blob/main/1283-find-the-smallest-divisor-given-a-threshold/1283-find-the-smallest-divisor-given-a-threshold.java"
click node_bouquets "https://github.com/srishtikapoor22/leetcode/blob/main/1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.py"
click node_missing "https://github.com/srishtikapoor22/leetcode/blob/main/1539-kth-missing-positive-number/1539-kth-missing-positive-number.py"
click node_binary "https://github.com/srishtikapoor22/leetcode/blob/main/792-binary-search/binary-search.java"
click node_spiral "https://github.com/srishtikapoor22/leetcode/blob/main/0054-spiral-matrix/0054-spiral-matrix.java"
click node_pascal "https://github.com/srishtikapoor22/leetcode/blob/main/0118-pascals-triangle/0118-pascals-triangle.java"
click node_rotate "https://github.com/srishtikapoor22/leetcode/blob/main/0189-rotate-array/0189-rotate-array.java"
click node_zeroes "https://github.com/srishtikapoor22/leetcode/blob/main/0283-move-zeroes/0283-move-zeroes.java"
click node_concat "https://github.com/srishtikapoor22/leetcode/blob/main/2058-concatenation-of-array/concatenation-of-array.java"
click node_rearrange "https://github.com/srishtikapoor22/leetcode/blob/main/2149-rearrange-array-elements-by-sign/2149-rearrange-array-elements-by-sign.java"
click node_matrixzero "https://github.com/srishtikapoor22/leetcode/blob/main/73-set-matrix-zeroes/set-matrix-zeroes.java"
click node_merge "https://github.com/srishtikapoor22/leetcode/blob/main/88-merge-sorted-array/merge-sorted-array.java"
click node_twosum "https://github.com/srishtikapoor22/leetcode/blob/main/1-two-sum/two-sum.java"
click node_threesum "https://github.com/srishtikapoor22/leetcode/blob/main/15-3sum/3sum.java"
click node_foursum "https://github.com/srishtikapoor22/leetcode/blob/main/18-4sum/4sum.java"
click node_maximum "https://github.com/srishtikapoor22/leetcode/blob/main/53-maximum-subarray/maximum-subarray.java"
click node_subarrays "https://github.com/srishtikapoor22/leetcode/blob/main/0560-subarray-sum-equals-k/0560-subarray-sum-equals-k.java"
click node_ones "https://github.com/srishtikapoor22/leetcode/blob/main/0485-max-consecutive-ones/0485-max-consecutive-ones.java"
click node_majority "https://github.com/srishtikapoor22/leetcode/blob/main/169-majority-element/majority-element.java"
click node_majoritytwo "https://github.com/srishtikapoor22/leetcode/blob/main/229-majority-element-ii/majority-element-ii.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_range,node_insert,node_sqrt,node_rotated,node_minimum,node_split,node_singleton,node_bananas,node_shipping,node_divisor,node_bouquets,node_missing,node_binary toneBlue
class node_spiral,node_pascal,node_rotate,node_zeroes,node_concat,node_rearrange,node_matrixzero,node_merge toneAmber
class node_twosum,node_threesum,node_foursum,node_maximum,node_subarrays toneMint
class node_ones,node_majority,node_majoritytwo toneRose
class node_actor toneIndigo
```

## Components

### Search and Bounds

- [Search Range](https://github.com/srishtikapoor22/leetcode/blob/main/0034-find-first-and-last-position-of-element-in-sorted-array/0034-find-first-and-last-position-of-element-in-sorted-array.java): `0034-find-first-and-last-position-of-element-in-sorted-array/0034-find-first-and-last-position-of-element-in-sorted-array.java`
- [Insert Position](https://github.com/srishtikapoor22/leetcode/blob/main/0035-search-insert-position/0035-search-insert-position.java): `0035-search-insert-position/0035-search-insert-position.java`
- [Integer Square Root](https://github.com/srishtikapoor22/leetcode/blob/main/0069-sqrtx/0069-sqrtx.java): `0069-sqrtx/0069-sqrtx.java`
- [Rotated Search](https://github.com/srishtikapoor22/leetcode/blob/main/0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.java): `0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.java`
- [Rotated Minimum](https://github.com/srishtikapoor22/leetcode/blob/main/0153-find-minimum-in-rotated-sorted-array/0153-find-minimum-in-rotated-sorted-array.java): `0153-find-minimum-in-rotated-sorted-array/0153-find-minimum-in-rotated-sorted-array.java`
- [Array Split](https://github.com/srishtikapoor22/leetcode/blob/main/0410-split-array-largest-sum/0410-split-array-largest-sum.py): `0410-split-array-largest-sum/0410-split-array-largest-sum.py`
- [Single Element](https://github.com/srishtikapoor22/leetcode/blob/main/0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.java): `0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.java`
- [Banana Speed](https://github.com/srishtikapoor22/leetcode/blob/main/0875-koko-eating-bananas/0875-koko-eating-bananas.java): `0875-koko-eating-bananas/0875-koko-eating-bananas.java`
- [Shipping Capacity](https://github.com/srishtikapoor22/leetcode/blob/main/1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.py): `1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.py`
- [Threshold Divisor](https://github.com/srishtikapoor22/leetcode/blob/main/1283-find-the-smallest-divisor-given-a-threshold/1283-find-the-smallest-divisor-given-a-threshold.java): `1283-find-the-smallest-divisor-given-a-threshold/1283-find-the-smallest-divisor-given-a-threshold.java`
- [Bouquet Days](https://github.com/srishtikapoor22/leetcode/blob/main/1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.py): `1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.py`
- [Missing Positive](https://github.com/srishtikapoor22/leetcode/blob/main/1539-kth-missing-positive-number/1539-kth-missing-positive-number.py): `1539-kth-missing-positive-number/1539-kth-missing-positive-number.py`
- [Binary Search](https://github.com/srishtikapoor22/leetcode/blob/main/792-binary-search/binary-search.java): `792-binary-search/binary-search.java`

### Array Transformations

- [Spiral Traversal](https://github.com/srishtikapoor22/leetcode/blob/main/0054-spiral-matrix/0054-spiral-matrix.java): `0054-spiral-matrix/0054-spiral-matrix.java`
- [Pascal Triangle](https://github.com/srishtikapoor22/leetcode/blob/main/0118-pascals-triangle/0118-pascals-triangle.java): `0118-pascals-triangle/0118-pascals-triangle.java`
- [Rotate Array](https://github.com/srishtikapoor22/leetcode/blob/main/0189-rotate-array/0189-rotate-array.java): `0189-rotate-array/0189-rotate-array.java`
- [Move Zeroes](https://github.com/srishtikapoor22/leetcode/blob/main/0283-move-zeroes/0283-move-zeroes.java): `0283-move-zeroes/0283-move-zeroes.java`
- [Array Concatenation](https://github.com/srishtikapoor22/leetcode/blob/main/2058-concatenation-of-array/concatenation-of-array.java): `2058-concatenation-of-array/concatenation-of-array.java`
- [Sign Rearrangement](https://github.com/srishtikapoor22/leetcode/blob/main/2149-rearrange-array-elements-by-sign/2149-rearrange-array-elements-by-sign.java): `2149-rearrange-array-elements-by-sign/2149-rearrange-array-elements-by-sign.java`
- [Matrix Zeroing](https://github.com/srishtikapoor22/leetcode/blob/main/73-set-matrix-zeroes/set-matrix-zeroes.java): `73-set-matrix-zeroes/set-matrix-zeroes.java`
- [Merge Sorted Arrays](https://github.com/srishtikapoor22/leetcode/blob/main/88-merge-sorted-array/merge-sorted-array.java): `88-merge-sorted-array/merge-sorted-array.java`

### Sum Algorithms

- [Two Sum](https://github.com/srishtikapoor22/leetcode/blob/main/1-two-sum/two-sum.java): `1-two-sum/two-sum.java`
- [Three Sum](https://github.com/srishtikapoor22/leetcode/blob/main/15-3sum/3sum.java): `15-3sum/3sum.java`
- [Four Sum](https://github.com/srishtikapoor22/leetcode/blob/main/18-4sum/4sum.java): `18-4sum/4sum.java`
- [Maximum Subarray](https://github.com/srishtikapoor22/leetcode/blob/main/53-maximum-subarray/maximum-subarray.java): `53-maximum-subarray/maximum-subarray.java`
- [Subarray Sum](https://github.com/srishtikapoor22/leetcode/blob/main/0560-subarray-sum-equals-k/0560-subarray-sum-equals-k.java): `0560-subarray-sum-equals-k/0560-subarray-sum-equals-k.java`

### Counting Algorithms

- [Consecutive Ones](https://github.com/srishtikapoor22/leetcode/blob/main/0485-max-consecutive-ones/0485-max-consecutive-ones.java): `0485-max-consecutive-ones/0485-max-consecutive-ones.java`
- [Majority Element](https://github.com/srishtikapoor22/leetcode/blob/main/169-majority-element/majority-element.java): `169-majority-element/majority-element.java`
- [Majority Elements II](https://github.com/srishtikapoor22/leetcode/blob/main/229-majority-element-ii/majority-element-ii.java): `229-majority-element-ii/majority-element-ii.java`

### Other components

- **Problem Judge**
