How adityakumarprasad33-cpu/ds-cap2012ca3 works
This repository is a collection of independent C++ LeetCode solution snippets, not a single application pipeline. A caller supplies each problem’s input to its corresponding solution and receives a result; the snippets do not call one another. The map groups solutions by broad data-structure and algorithm domain. The README is empty, and the excerpts show solution implementations rather than caller wiring, so invocation edges are dashed and unverified.
Main entry points: 01_LC001_TwoSum_Easy.cpp Two Sum · 02_LC066_PlusOne_Easy.cpp Plus One · 03_LC283_MoveZeroes_Easy.cpp Move Zeroes · 04_LC121_BestTimeToBuySellStock_Easy.cpp Stock Profit
Components 17
Array Algorithms
- Two Sum
Easy/01_LC001_TwoSum_Easy.cpp - Plus One
Easy/02_LC066_PlusOne_Easy.cpp - Move Zeroes
Easy/03_LC283_MoveZeroes_Easy.cpp - Stock Profit
Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp
Linked Lists
- Add Two Numbers
Medium/10_LC002_AddTwoNumbers_Medium.cpp - Rotate List
Medium/11_LC061_RotateList_Medium.cpp - Remove List Duplicates
Medium/12_LC082_RemoveDuplicatesSortedListII_Medium.cpp - Merge K Lists
Hard/15_LC023_MergeKSortedLists_Hard.cpp - Reverse K Groups
Hard/16_LC025_ReverseNodesInKGroup_Hard.cpp - Reverse List
Easy/06_LC206_ReverseLinkedList_Easy.cpp - Detect List Cycle
Easy/07_LC141_LinkedListCycle_Easy.cpp - Find List Middle
Easy/08_LC876_MiddleOfLinkedList_Easy.cpp
Stacks and Queues
- Valid Parentheses
Easy/05_LC020_ValidParentheses_Easy.cpp - Stack Using Queues
Easy/09_LC225_ImplementStackUsingQueues_Easy.cpp - Circular Queue
Medium/13_LC622_DesignCircularQueue_Medium.cpp - Asteroid Collision
Medium/14_LC735_AsteroidCollision_Medium.cpp
Other components
- Problem Caller
Connections 16
- Problem Caller → Two Sum: invokes
- Problem Caller → Plus One: invokes
- Problem Caller → Move Zeroes: invokes
- Problem Caller → Stock Profit: invokes
- Problem Caller → Add Two Numbers: invokes
- Problem Caller → Rotate List: invokes
- Problem Caller → Remove List Duplicates: invokes
- Problem Caller → Merge K Lists: invokes
- Problem Caller → Reverse K Groups: invokes
- Problem Caller → Reverse List: invokes
- Problem Caller → Detect List Cycle: invokes
- Problem Caller → Find List Middle: invokes
- Problem Caller → Valid Parentheses: invokes
- Problem Caller → Stack Using Queues: invokes
- Problem Caller → Circular Queue: invokes
- Problem Caller → Asteroid Collision: invokes