How kaiumuddin/dsa-codes works
This is a personal DSA reference collection, not a single application: users browse a topic, choose an independent implementation or problem solution, and run or study it. The folders cover the README’s algorithm and data-structure themes, with problem-solving examples alongside foundational implementations. The sampled programs generally contain their own input and output logic; no shared runtime or cross-module orchestration is evident. The graph groups representative topic areas rather than implying calls between their files; links to individual examples are omitted where wiring is not established.
Main entry points: Binary_Search_Leetcode_Template Binary search · Divide_and_Conquer_Phitron Divide and conquer · Dynamic_Programming_Phitron Dynamic programming · Graph_Phitron Graph algorithms
Components 15
Searching and sorting
- Binary search
Binary_Search_Leetcode_Template - Divide and conquer
Divide_and_Conquer_Phitron
Algorithm topics
- Dynamic programming
Dynamic_Programming_Phitron - Graph algorithms
Graph_Phitron - Bit manipulation
Bit_Manipulation_Linked_In_Kapil_Yadav
Data structures
- Array examples
Array_CS50x - Linked lists
Linked_List_Phitron - Trees
Tree_Binary_Search_Tree_Phitron - Heaps and maps
Hashmap_and_Heaps_Pepcoding_level_1 - Hash tables
Hashing_Implementation
Problem solutions
- Coding challenges
Binary_Search_Sabuj_vai/binary_search_in_ans - Graph challenges
Graph_Phitron/assignment-3 - DP challenges
Dynamic_Programming_Phitron/24.assignment_4
Other examples
- Singleton example
Design_Patterns__Durgesh/Creational/Singleton
Other components
- Learner
Connections 14
- Learner → Binary search: selects
- Learner → Divide and conquer: selects
- Learner → Dynamic programming: selects
- Learner → Graph algorithms: selects
- Learner → Bit manipulation: selects
- Learner → Array examples: selects
- Learner → Linked lists: selects
- Learner → Trees: selects
- Learner → Heaps and maps: selects
- Learner → Hash tables: selects
- Learner → Coding challenges: selects
- Learner → Graph challenges: selects
- Learner → DP challenges: selects
- Learner → Singleton example: selects