# vikukarthik/preparation architecture

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

- Interactive diagram: https://gitdiagram.com/vikukarthik/preparation
- Repository: https://github.com/vikukarthik/preparation

## Overview

This repository is a code-preparation collection of standalone LeetCode solutions, not a single application. The principal workflow is to select a problem topic, provide its input to a solution, and obtain an algorithmic result; the sampled files demonstrate individual solutions and examples, not a shared runtime or cross-module orchestration. Nodes therefore represent topic collections, with dedicated nodes for the two SOURCE INDEX core modules. The README is minimal, and unsampled solutions are represented only at their supported directory level.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays and Strings"]
  node_array_hash["Array Hash"]
  node_two_pointer["Two Pointers"]
  node_sliding_window["Sliding Window"]
  node_permutation_string["String Permutation"]
  node_math_geometry["Math Geometry"]
  node_bit_manipulation["Bit Manipulation"]
  node_standalone["Standalone Problems"]
end

subgraph group_structures["Data Structures"]
  node_stack["Stack"]
  node_linked_list["Linked Lists"]
  node_trees["Trees"]
  node_tries["Tries"]
  node_heap["Heaps"]
end

subgraph group_search["Search and Traversal"]
  node_binary_search["Binary Search"]
  node_word_search_ii["Word Search II<br/>[3_word_search.rb]"]
  node_backtracking["Backtracking"]
  node_graphs["Graph Algorithms"]
end

subgraph group_optimization["Optimization"]
  node_advanced_graph["Advanced Graphs"]
  node_greedy["Greedy Algorithms"]
  node_intervals["Intervals"]
end

click node_array_hash "https://github.com/vikukarthik/preparation/tree/main/leetcode/1_array_hash"
click node_two_pointer "https://github.com/vikukarthik/preparation/tree/main/leetcode/2_two_pointer"
click node_sliding_window "https://github.com/vikukarthik/preparation/tree/main/leetcode/3_sliding_window"
click node_permutation_string "https://github.com/vikukarthik/preparation/blob/main/leetcode/3_sliding_window/4_permutation_in_string.rb"
click node_stack "https://github.com/vikukarthik/preparation/tree/main/leetcode/4_stack"
click node_binary_search "https://github.com/vikukarthik/preparation/tree/main/leetcode/5_binary_Search"
click node_linked_list "https://github.com/vikukarthik/preparation/tree/main/leetcode/6_linked_list"
click node_trees "https://github.com/vikukarthik/preparation/tree/main/leetcode/7_trees"
click node_tries "https://github.com/vikukarthik/preparation/tree/main/leetcode/8_tries"
click node_word_search_ii "https://github.com/vikukarthik/preparation/blob/main/leetcode/8_tries/3_word_search.rb"
click node_heap "https://github.com/vikukarthik/preparation/tree/main/leetcode/9_heap"
click node_backtracking "https://github.com/vikukarthik/preparation/tree/main/leetcode/10_backtracking"
click node_graphs "https://github.com/vikukarthik/preparation/tree/main/leetcode/11_graph"
click node_advanced_graph "https://github.com/vikukarthik/preparation/tree/main/leetcode/12_advanced_graph"
click node_greedy "https://github.com/vikukarthik/preparation/tree/main/leetcode/13_greedy"
click node_intervals "https://github.com/vikukarthik/preparation/tree/main/leetcode/14_intervals"
click node_math_geometry "https://github.com/vikukarthik/preparation/tree/main/leetcode/15_math_geo"
click node_bit_manipulation "https://github.com/vikukarthik/preparation/tree/main/leetcode/16_bit_manipulation"
click node_standalone "https://github.com/vikukarthik/preparation/tree/main/leetcode"

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_hash,node_two_pointer,node_sliding_window,node_permutation_string,node_math_geometry,node_bit_manipulation,node_standalone toneBlue
class node_stack,node_linked_list,node_trees,node_tries,node_heap toneAmber
class node_binary_search,node_word_search_ii,node_backtracking,node_graphs toneMint
class node_advanced_graph,node_greedy,node_intervals toneRose
```

## Components

### Arrays and Strings

- [Array Hash](https://github.com/vikukarthik/preparation/tree/main/leetcode/1_array_hash): `leetcode/1_array_hash`
- [Two Pointers](https://github.com/vikukarthik/preparation/tree/main/leetcode/2_two_pointer): `leetcode/2_two_pointer`
- [Sliding Window](https://github.com/vikukarthik/preparation/tree/main/leetcode/3_sliding_window): `leetcode/3_sliding_window`
- [String Permutation](https://github.com/vikukarthik/preparation/blob/main/leetcode/3_sliding_window/4_permutation_in_string.rb): `leetcode/3_sliding_window/4_permutation_in_string.rb`
- [Math Geometry](https://github.com/vikukarthik/preparation/tree/main/leetcode/15_math_geo): `leetcode/15_math_geo`
- [Bit Manipulation](https://github.com/vikukarthik/preparation/tree/main/leetcode/16_bit_manipulation): `leetcode/16_bit_manipulation`
- [Standalone Problems](https://github.com/vikukarthik/preparation/tree/main/leetcode): `leetcode`

### Data Structures

- [Stack](https://github.com/vikukarthik/preparation/tree/main/leetcode/4_stack): `leetcode/4_stack`
- [Linked Lists](https://github.com/vikukarthik/preparation/tree/main/leetcode/6_linked_list): `leetcode/6_linked_list`
- [Trees](https://github.com/vikukarthik/preparation/tree/main/leetcode/7_trees): `leetcode/7_trees`
- [Tries](https://github.com/vikukarthik/preparation/tree/main/leetcode/8_tries): `leetcode/8_tries`
- [Heaps](https://github.com/vikukarthik/preparation/tree/main/leetcode/9_heap): `leetcode/9_heap`

### Search and Traversal

- [Binary Search](https://github.com/vikukarthik/preparation/tree/main/leetcode/5_binary_Search): `leetcode/5_binary_Search`
- [Word Search II](https://github.com/vikukarthik/preparation/blob/main/leetcode/8_tries/3_word_search.rb): `leetcode/8_tries/3_word_search.rb`
- [Backtracking](https://github.com/vikukarthik/preparation/tree/main/leetcode/10_backtracking): `leetcode/10_backtracking`
- [Graph Algorithms](https://github.com/vikukarthik/preparation/tree/main/leetcode/11_graph): `leetcode/11_graph`

### Optimization

- [Advanced Graphs](https://github.com/vikukarthik/preparation/tree/main/leetcode/12_advanced_graph): `leetcode/12_advanced_graph`
- [Greedy Algorithms](https://github.com/vikukarthik/preparation/tree/main/leetcode/13_greedy): `leetcode/13_greedy`
- [Intervals](https://github.com/vikukarthik/preparation/tree/main/leetcode/14_intervals): `leetcode/14_intervals`
