# duddlfkd02/algorithm architecture

> Architecture diagram of the GitHub repository duddlfkd02/algorithm, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2025-04-05). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/duddlfkd02/algorithm
- Repository: https://github.com/duddlfkd02/algorithm

## Overview

##### Project Type and Purpose
- The README file states that this is a “프로그래머스 알고리즘 문제풀이 기록” – in other words, a record of algorithm problems solved for the “프로그래머스” platform.
- The project is essentially an archive or learning resource of standalone algorithm solutions, not a live application or full-stack system.

##### Analyzing the File Structure
- There are two higher-level directories: one named “복습문제” (which suggests “review problems”) and one named “프로그래머스” (which hosts almost all the problem solutions).
- Inside each of these directories, the repository is further organized into subdirectories. For “복습문제”, the problems are organized by level (e.g., “Level.1”) and then by problem ID (e.g., “250402”, “250403” etc) containing individual .js files (along with a README for some problem sets).
- Similarly, the “프로그래머스” folder has subdirectories organized by what appears to be problem difficulty or grouping (e.g., “0”, “1”, “2” and even additional numbered directories) and then further organizes multiple algorithm problem directories within each group.
- Each individual problem folder typically has a README.md and a JavaScript file that contains the solution.
- There is no build or deployment configuration – every file is self-contained, representing a single problem solution.

## Diagram (Mermaid)

```mermaid
flowchart TD
    R["Repository Root\n(Algorithm Problem Archive)"]:::directory
    B["복습문제\n(Category)"]:::directory
    P["프로그래머스\n(Category)"]:::directory

    R -->|"contains"| B
    R -->|"contains"| P

    subgraph "복습문제 Category"
        L1["Level.1"]:::directory
        B -->|"has group"| L1
        P250402["250402\n(README + JS)"]:::file
        P250403["250403\n(README + JS)"]:::file
        L1 -->|"contains"| P250402
        L1 -->|"contains"| P250403
    end

    subgraph "프로그래머스 Category"
        G0["0"]:::directory
        G1["1"]:::directory
        G2["2"]:::directory
        P -->|"has group"| G0
        P -->|"has group"| G1
        P -->|"has group"| G2

        P_120878["120878. 유한소수 판별하기\n(README + JS)"]:::file
        G0 -->|"contains"| P_120878
    end

    click R "https://github.com/duddlfkd02/algorithm/blob/main/README.md"
    click B "https://github.com/duddlfkd02/algorithm/tree/main/복습문제"
    click L1 "https://github.com/duddlfkd02/algorithm/blob/main/복습문제/Level.1"
    click P250402 "https://github.com/duddlfkd02/algorithm/tree/main/복습문제/Level.1/250402"
    click P250403 "https://github.com/duddlfkd02/algorithm/tree/main/복습문제/Level.1/250403"
    click P "https://github.com/duddlfkd02/algorithm/tree/main/프로그래머스"
    click G0 "https://github.com/duddlfkd02/algorithm/tree/main/프로그래머스/0"
    click G1 "https://github.com/duddlfkd02/algorithm/tree/main/프로그래머스/1"
    click G2 "https://github.com/duddlfkd02/algorithm/tree/main/프로그래머스/2"
    click P_120878 "https://github.com/duddlfkd02/algorithm/blob/main/프로그래머스/0/120878. 유한소수 판별하기"

    classDef directory fill:#AED6F1,stroke:#1B4F72,stroke-width:2px;
    classDef file fill:#F9E79F,stroke:#B9770E,stroke-width:2px;
```
