# smhaider-zaidi/neetcode-150 architecture

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

- Interactive diagram: https://gitdiagram.com/smhaider-zaidi/neetcode-150
- Repository: https://github.com/smhaider-zaidi/neetcode-150

## Overview

This repository is a collection of independent Python interview-problem solutions, not the NeetCode platform or its GitHub Sync implementation. Its useful architecture is organized by problem folder and algorithm family; the solutions do not call one another. The README documents submission syncing, but no sync code appears in the provided tree, so the only workflow edges shown are documented external transfers. The remaining nodes represent the listed solution folders; source excerpts show algorithm behavior, not inter-solution relationships.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_hash["Hashing and sets"]
  node_anagram_groups["Anagram groups"]
  node_duplicate_integer["Duplicate integer"]
  node_disappeared["Disappeared numbers"]
  node_is_anagram["Anagram check"]
  node_consecutive["Consecutive sequence"]
  node_majority["Majority element"]
  node_top_k["Top frequent elements"]
end

subgraph group_windows["Sliding windows"]
  node_binary_subarrays["Binary subarrays"]
  node_duplicate_ii["Nearby duplicates"]
  node_replacement["Substring replacement"]
  node_unique_substring["Unique substring"]
  node_min_subarray["Minimum-size subarray"]
  node_min_window["Minimum character window"]
  node_permutation["Permutation string"]
  node_sliding_max["Sliding maximum"]
end

subgraph group_pointers["Pointers and arrays"]
  node_boats["Boats to save people"]
  node_water_container["Water container"]
  node_merge_sorted["Merge sorted array"]
  node_move_zeroes["Move zeroes"]
  node_products["Products except self"]
  node_remove_duplicates["Remove duplicates"]
  node_remove_element["Remove element"]
  node_squares["Sorted squares"]
  node_three_sum["Three-integer sum"]
end

subgraph group_strings["String algorithms"]
  node_is_palindrome["Palindrome check"]
  node_subsequence["Subsequence check"]
  node_last_word["Last word length"]
  node_merge_strings["Merge strings"]
  node_reverse_string["Reverse string"]
  node_score_string["String score"]
  node_encode_decode["String encoding"]
end

subgraph group_other["Other algorithms"]
  node_buy_crypto["Buy and sell crypto"]
  node_max_subarray["Maximum subarray"]
  node_non_cyclical["Non-cyclical number"]
end

click node_anagram_groups "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/anagram-groups"
click node_binary_subarrays "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/binary-subarrays-with-sum"
click node_boats "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/boats-to-save-people"
click node_buy_crypto "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/buy-and-sell-crypto"
click node_duplicate_ii "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/contains-duplicate-ii"
click node_duplicate_integer "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/duplicate-integer"
click node_disappeared "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/find-all-numbers-disappeared-in-an-array"
click node_is_anagram "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-anagram"
click node_is_palindrome "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-palindrome"
click node_subsequence "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-subsequence"
click node_last_word "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/length-of-last-word"
click node_consecutive "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-consecutive-sequence"
click node_replacement "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-repeating-substring-with-replacement"
click node_unique_substring "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-substring-without-duplicates"
click node_majority "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/majority-element"
click node_water_container "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/max-water-container"
click node_max_subarray "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/maximum-subarray"
click node_merge_sorted "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/merge-sorted-array"
click node_merge_strings "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/merge-strings-alternately"
click node_min_subarray "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/minimum-size-subarray-sum"
click node_min_window "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/minimum-window-with-characters"
click node_move_zeroes "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/move-zeroes"
click node_non_cyclical "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/non-cyclical-number"
click node_permutation "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/permutation-string"
click node_products "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/products-of-array-discluding-self"
click node_remove_duplicates "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/remove-duplicates-from-sorted-array"
click node_remove_element "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/remove-element"
click node_reverse_string "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/reverse-string"
click node_score_string "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/score-of-a-string"
click node_sliding_max "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/sliding-window-maximum"
click node_squares "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/squares-of-a-sorted-array"
click node_encode_decode "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/string-encode-and-decode"
click node_three_sum "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/three-integer-sum"
click node_top_k "https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/top-k-elements-in-list"

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_anagram_groups,node_duplicate_integer,node_disappeared,node_is_anagram,node_consecutive,node_majority,node_top_k toneBlue
class node_binary_subarrays,node_duplicate_ii,node_replacement,node_unique_substring,node_min_subarray,node_min_window,node_permutation,node_sliding_max toneAmber
class node_boats,node_water_container,node_merge_sorted,node_move_zeroes,node_products,node_remove_duplicates,node_remove_element,node_squares,node_three_sum toneMint
class node_is_palindrome,node_subsequence,node_last_word,node_merge_strings,node_reverse_string,node_score_string,node_encode_decode toneRose
class node_buy_crypto,node_max_subarray,node_non_cyclical toneIndigo
```

## Components

### Hashing and sets

- [Anagram groups](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/anagram-groups): `Data Structures & Algorithms/anagram-groups`
- [Duplicate integer](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/duplicate-integer): `Data Structures & Algorithms/duplicate-integer`
- [Disappeared numbers](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/find-all-numbers-disappeared-in-an-array): `Data Structures & Algorithms/find-all-numbers-disappeared-in-an-array`
- [Anagram check](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-anagram): `Data Structures & Algorithms/is-anagram`
- [Consecutive sequence](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-consecutive-sequence): `Data Structures & Algorithms/longest-consecutive-sequence`
- [Majority element](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/majority-element): `Data Structures & Algorithms/majority-element`
- [Top frequent elements](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/top-k-elements-in-list): `Data Structures & Algorithms/top-k-elements-in-list`

### Sliding windows

- [Binary subarrays](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/binary-subarrays-with-sum): `Data Structures & Algorithms/binary-subarrays-with-sum`
- [Nearby duplicates](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/contains-duplicate-ii): `Data Structures & Algorithms/contains-duplicate-ii`
- [Substring replacement](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-repeating-substring-with-replacement): `Data Structures & Algorithms/longest-repeating-substring-with-replacement`
- [Unique substring](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/longest-substring-without-duplicates): `Data Structures & Algorithms/longest-substring-without-duplicates`
- [Minimum-size subarray](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/minimum-size-subarray-sum): `Data Structures & Algorithms/minimum-size-subarray-sum`
- [Minimum character window](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/minimum-window-with-characters): `Data Structures & Algorithms/minimum-window-with-characters`
- [Permutation string](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/permutation-string): `Data Structures & Algorithms/permutation-string`
- [Sliding maximum](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/sliding-window-maximum): `Data Structures & Algorithms/sliding-window-maximum`

### Pointers and arrays

- [Boats to save people](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/boats-to-save-people): `Data Structures & Algorithms/boats-to-save-people`
- [Water container](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/max-water-container): `Data Structures & Algorithms/max-water-container`
- [Merge sorted array](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/merge-sorted-array): `Data Structures & Algorithms/merge-sorted-array`
- [Move zeroes](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/move-zeroes): `Data Structures & Algorithms/move-zeroes`
- [Products except self](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/products-of-array-discluding-self): `Data Structures & Algorithms/products-of-array-discluding-self`
- [Remove duplicates](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/remove-duplicates-from-sorted-array): `Data Structures & Algorithms/remove-duplicates-from-sorted-array`
- [Remove element](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/remove-element): `Data Structures & Algorithms/remove-element`
- [Sorted squares](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/squares-of-a-sorted-array): `Data Structures & Algorithms/squares-of-a-sorted-array`
- [Three-integer sum](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/three-integer-sum): `Data Structures & Algorithms/three-integer-sum`

### String algorithms

- [Palindrome check](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-palindrome): `Data Structures & Algorithms/is-palindrome`
- [Subsequence check](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/is-subsequence): `Data Structures & Algorithms/is-subsequence`
- [Last word length](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/length-of-last-word): `Data Structures & Algorithms/length-of-last-word`
- [Merge strings](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/merge-strings-alternately): `Data Structures & Algorithms/merge-strings-alternately`
- [Reverse string](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/reverse-string): `Data Structures & Algorithms/reverse-string`
- [String score](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/score-of-a-string): `Data Structures & Algorithms/score-of-a-string`
- [String encoding](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/string-encode-and-decode): `Data Structures & Algorithms/string-encode-and-decode`

### Other algorithms

- [Buy and sell crypto](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/buy-and-sell-crypto): `Data Structures & Algorithms/buy-and-sell-crypto`
- [Maximum subarray](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/maximum-subarray): `Data Structures & Algorithms/maximum-subarray`
- [Non-cyclical number](https://github.com/smhaider-zaidi/neetcode-150/tree/main/Data%20Structures%20%26%20Algorithms/non-cyclical-number): `Data Structures & Algorithms/non-cyclical-number`
