# 77anuj77/leetcode_python architecture

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

- Interactive diagram: https://gitdiagram.com/77anuj77/leetcode_python
- Repository: https://github.com/77anuj77/leetcode_python

## Overview

This repository is a collection of independent LeetCode Python solutions, not a single application. The user-to-result workflow is to choose a problem, submit its solution method to the LeetCode judge, and receive an answer; solutions do not form a shared runtime pipeline. The README documents algorithm-topic coverage and a separate set of DataFrame exercises. Group nodes represent those problem families, with directory paths because individual implementations are not linked together. Judge interactions are dashed: the repository describes the collection, but the excerpts do not show judge integration.

Main entry points: [`0001-two-sum`](https://github.com/77anuj77/leetcode_python/tree/main/0001-two-sum) (Array Tasks), [`0035-search-insert-position`](https://github.com/77anuj77/leetcode_python/tree/main/0035-search-insert-position) (Search Tasks), [`0013-roman-to-integer`](https://github.com/77anuj77/leetcode_python/tree/main/0013-roman-to-integer) (String Tasks), [`0066-plus-one`](https://github.com/77anuj77/leetcode_python/tree/main/0066-plus-one) (Math and DP)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays and Search"]
  node_array_tasks["Array Tasks"]
  node_search_tasks["Search Tasks"]
end

subgraph group_strings["Strings and Math"]
  node_string_tasks["String Tasks"]
  node_math_dp["Math and DP"]
end

subgraph group_structures["Data Structures"]
  node_list_tasks["Linked Lists"]
  node_stack_tasks["Stack and Queue"]
  node_tree_tasks["Tree Tasks"]
end

subgraph group_dataframes["DataFrame Exercises"]
  node_dataframe_create["Create DataFrames"]
  node_dataframe_inspect["Inspect and Select"]
  node_dataframe_transform["Transform Data"]
  node_dataframe_reshape["Reshape Data"]
end

node_judge(("LeetCode Judge"))

node_judge -.->|"submits solution"| node_array_tasks
node_judge -.->|"submits solution"| node_search_tasks
node_judge -.->|"submits solution"| node_string_tasks
node_judge -.->|"submits solution"| node_math_dp
node_judge -.->|"submits solution"| node_list_tasks
node_judge -.->|"submits solution"| node_stack_tasks
node_judge -.->|"submits solution"| node_tree_tasks
node_judge -.->|"submits solution"| node_dataframe_create
node_judge -.->|"submits solution"| node_dataframe_inspect
node_judge -.->|"submits solution"| node_dataframe_transform
node_judge -.->|"submits solution"| node_dataframe_reshape

click node_array_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0001-two-sum"
click node_search_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0035-search-insert-position"
click node_string_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0013-roman-to-integer"
click node_math_dp "https://github.com/77anuj77/leetcode_python/tree/main/0066-plus-one"
click node_list_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0021-merge-two-sorted-lists"
click node_stack_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0020-valid-parentheses"
click node_tree_tasks "https://github.com/77anuj77/leetcode_python/tree/main/0257-binary-tree-paths"
click node_dataframe_create "https://github.com/77anuj77/leetcode_python/blob/main/2877-create-a-dataframe-from-list/2877-create-a-dataframe-from-list.py"
click node_dataframe_inspect "https://github.com/77anuj77/leetcode_python/tree/main/2878-get-the-size-of-a-dataframe"
click node_dataframe_transform "https://github.com/77anuj77/leetcode_python/tree/main/2881-create-a-new-column"
click node_dataframe_reshape "https://github.com/77anuj77/leetcode_python/tree/main/2888-reshape-data-concatenate"

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_tasks,node_search_tasks toneBlue
class node_string_tasks,node_math_dp toneAmber
class node_list_tasks,node_stack_tasks,node_tree_tasks toneMint
class node_dataframe_create,node_dataframe_inspect,node_dataframe_transform,node_dataframe_reshape toneRose
class node_judge toneIndigo
```

## Components

### Arrays and Search

- [Array Tasks](https://github.com/77anuj77/leetcode_python/tree/main/0001-two-sum): `0001-two-sum`
- [Search Tasks](https://github.com/77anuj77/leetcode_python/tree/main/0035-search-insert-position): `0035-search-insert-position`

### Strings and Math

- [String Tasks](https://github.com/77anuj77/leetcode_python/tree/main/0013-roman-to-integer): `0013-roman-to-integer`
- [Math and DP](https://github.com/77anuj77/leetcode_python/tree/main/0066-plus-one): `0066-plus-one`

### Data Structures

- [Linked Lists](https://github.com/77anuj77/leetcode_python/tree/main/0021-merge-two-sorted-lists): `0021-merge-two-sorted-lists`
- [Stack and Queue](https://github.com/77anuj77/leetcode_python/tree/main/0020-valid-parentheses): `0020-valid-parentheses`
- [Tree Tasks](https://github.com/77anuj77/leetcode_python/tree/main/0257-binary-tree-paths): `0257-binary-tree-paths`

### DataFrame Exercises

- [Create DataFrames](https://github.com/77anuj77/leetcode_python/blob/main/2877-create-a-dataframe-from-list/2877-create-a-dataframe-from-list.py): `2877-create-a-dataframe-from-list/2877-create-a-dataframe-from-list.py`
- [Inspect and Select](https://github.com/77anuj77/leetcode_python/tree/main/2878-get-the-size-of-a-dataframe): `2878-get-the-size-of-a-dataframe`
- [Transform Data](https://github.com/77anuj77/leetcode_python/tree/main/2881-create-a-new-column): `2881-create-a-new-column`
- [Reshape Data](https://github.com/77anuj77/leetcode_python/tree/main/2888-reshape-data-concatenate): `2888-reshape-data-concatenate`

### Other components

- **LeetCode Judge**

## Connections

- LeetCode Judge → Array Tasks: submits solution
- LeetCode Judge → Search Tasks: submits solution
- LeetCode Judge → String Tasks: submits solution
- LeetCode Judge → Math and DP: submits solution
- LeetCode Judge → Linked Lists: submits solution
- LeetCode Judge → Stack and Queue: submits solution
- LeetCode Judge → Tree Tasks: submits solution
- LeetCode Judge → Create DataFrames: submits solution
- LeetCode Judge → Inspect and Select: submits solution
- LeetCode Judge → Transform Data: submits solution
- LeetCode Judge → Reshape Data: submits solution