How ramkrishnatrey/leet-code works
This repository is a small collection of independent C solutions to linked-list and array problems. Each source file implements a callable algorithm that accepts problem inputs and returns a result; no shared runtime, application entry point, or relationships between solutions are shown. The graph therefore lists the four implementations without inventing callers or data-flow links.
Components 4
Other components
- Two Sum
0001-two-sum/0001-two-sum.c - Add Numbers
0002-add-two-numbers/0002-add-two-numbers.c - Detect Cycle
0141-linked-list-cycle/0141-linked-list-cycle.c - Find Middle
0876-middle-of-the-linked-list/0876-middle-of-the-linked-list.c