How gantyadarohith/competitive-programming works
This repository is a portfolio of independent competitive-programming solutions, not a single application. The user-facing workflow is to select a problem’s file, provide the expected input, and receive that solution’s output; the README identifies Codeforces and LeetCode as the two collections. The sampled files demonstrate standalone input-processing and algorithm implementations, with no shared runtime or demonstrated calls between solutions. Categories below summarize the portfolio rather than imply a pipeline. Unsampled files are grouped by collection because their individual behavior was not inspected.
Components 11
Codeforces solutions
- Basic problem solutions
Codeforces - Array and number problems
Codeforces - Grid scoring
Codeforces/1873/C.py - Constructive answers
Codeforces/1845/A.py
LeetCode solutions
- Search solutions
LeetCode/binary-search.cpp - Array solutions
LeetCode - String solutions
LeetCode - Tree solutions
LeetCode - Graph solutions
LeetCode - Dynamic programming
LeetCode
Other components
- Problem solver