How sangilimurugan492/dsa-learning works
This repository is a collection of standalone Kotlin algorithm exercises, not a single application: a user selects and invokes an individual solution to get a computed result or modified data structure. Its capabilities span array/hash and traversal problems, two-pointer and sliding-window techniques, greedy and simulation problems, and linked-list structures and transformations. There is no shared runtime orchestrator or documented end-to-end workflow. Nodes group related exercises by their exact source directory; the available excerpts support only a few implementation-level links, so unverified connections are omitted.
Main entry points: linked_list List operations · ListNode.kt Singly list node · Node.kt Simple list node · LeastRecentlyUsedLRU.kt LRU cache
Components 14
Array algorithms
- Array hashing
array_hashing_technique - Array traversal
array_traversals
Window techniques
- Two pointers
two_pointer_technique - Sliding window
sliding_window_technique
Linked structures
- List operations
linked_list - Singly list node
linked_list/ListNode.kt - Simple list node
linked_list/Node.kt - LRU cache
double_linked_list/LeastRecentlyUsedLRU.kt - LFU cache
double_linked_list/LeastFrequentlyUsedLFU.kt - Multilevel flattening
double_linked_list/FlatternDoubleLLMultiLevel.kt
Greedy and simulation
- Greedy problems
GreedyAlgorithm - Phone combinations
LetterAndCombinationPhoneNumber.kt - Simulation problems
simulation
Other components
- Algorithm user
Connections 5
- List operations → Singly list node: uses nodes
linked_list/MyLinkedList.kt - LRU cache → Simple list node: imports node
double_linked_list/LeastRecentlyUsedLRU.kt - LFU cache → Simple list node: imports node
double_linked_list/LeastFrequentlyUsedLFU.kt - Multilevel flattening → Array traversal: imports node type
double_linked_list/FlatternDoubleLLMultiLevel.kt - List operations → Singly list node: transforms lists
linked_list/PatiotionList.kt