# mustahidhasan/python-basics-to-advance architecture

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

- Interactive diagram: https://gitdiagram.com/mustahidhasan/python-basics-to-advance
- Repository: https://github.com/mustahidhasan/python-basics-to-advance

## Overview

This repository is a small collection of standalone Python algorithm exercises, not a single application. Its principal use is to run an individual script and inspect its result; there is no shared runtime or data flow between exercises. The files cover sorting, Fibonacci sequence generation, and interview-style problems. Several sampled files contain unfinished functions, and there is no README to document additional capabilities.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_sorting["Sorting"]
  node_bubble["Bubble Sort<br/>[bubble_sort.py]"]
  node_insertion["Insertion Sort<br/>[insertion_sort.py]"]
  node_selection["Selection Sort<br/>[selection_sort.py]"]
  node_quick["Quick Sort<br/>[quick_sort.py]"]
  node_lowest["Lowest Value"]
end

subgraph group_sequences["Sequences"]
  node_fibonacci["Fibonacci Iteration<br/>[fibonacci.py]"]
  node_fibo_recursive["Fibonacci Recursion<br/>[fibo_recursive.py]"]
end

subgraph group_problems["Interview Problems"]
  node_last_word["Last Word Length"]
  node_prefix["Common Prefix"]
  node_palindrome["Palindrome Check<br/>[plaindrome.py]"]
  node_roman["Roman Conversion<br/>[roman_to_int.py]"]
  node_two_sum["Two Sum<br/>[two_sum.py]"]
  node_parenthesis["Valid Parentheses"]
end

click node_bubble "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/bubble_sort.py"
click node_insertion "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/insertion_sort.py"
click node_selection "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/selection_sort.py"
click node_quick "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/quick_sort.py"
click node_lowest "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/lowest_value_in_array.py"
click node_fibonacci "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/fibonacci.py"
click node_fibo_recursive "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/fibo_recursive.py"
click node_last_word "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/length_of_last_string.py"
click node_prefix "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/longest_common_prefix.py"
click node_palindrome "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/plaindrome.py"
click node_roman "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/roman_to_int.py"
click node_two_sum "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/two_sum.py"
click node_parenthesis "https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/valid_parenthesis.py"

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_bubble,node_insertion,node_selection,node_quick,node_lowest toneBlue
class node_fibonacci,node_fibo_recursive toneAmber
class node_last_word,node_prefix,node_palindrome,node_roman,node_two_sum,node_parenthesis toneMint
```

## Components

### Sorting

- [Bubble Sort](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/bubble_sort.py): `bubble_sort.py`
- [Insertion Sort](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/insertion_sort.py): `insertion_sort.py`
- [Selection Sort](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/selection_sort.py): `selection_sort.py`
- [Quick Sort](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/quick_sort.py): `quick_sort.py`
- [Lowest Value](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/lowest_value_in_array.py): `lowest_value_in_array.py`

### Sequences

- [Fibonacci Iteration](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/fibonacci.py): `fibonacci.py`
- [Fibonacci Recursion](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/fibo_recursive.py): `fibo_recursive.py`

### Interview Problems

- [Last Word Length](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/length_of_last_string.py): `pblm/length_of_last_string.py`
- [Common Prefix](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/longest_common_prefix.py): `pblm/longest_common_prefix.py`
- [Palindrome Check](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/plaindrome.py): `pblm/plaindrome.py`
- [Roman Conversion](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/roman_to_int.py): `pblm/roman_to_int.py`
- [Two Sum](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/two_sum.py): `pblm/two_sum.py`
- [Valid Parentheses](https://github.com/mustahidhasan/python-basics-to-advance/blob/DSA/pblm/valid_parenthesis.py): `pblm/valid_parenthesis.py`