A collection of my C++ solutions for CodeSprint 3.0, a 45-day data structure and algorithms challenge organized by USC KIIT.
This repository documents my journey through the challenge, containing 90 solutions (2 problems per day) that cover a broad range of Data Structures and Algorithms (DSA) concepts.
Disclaimer
This repository contains my personal solutions to the challenge problems. The original problem statements and challenge content belong to their respective authors and organizers.
Day_XX/
├── Q1.cpp # C++17 solution for Problem 1
├── Q1.md # Problem 1 statement
├── Q2.cpp # C++17 solution for Problem 2
├── Q1.md # Problem 2 statement
└── README.md # Day XX Overview
| Challenge | Problems | Language |
|---|---|---|
| 45 Days | 90 Solutions | C++17 |
- Arrays
- Strings
- Two Pointers
- Sorting
- Prefix Sums
- Recursion
- Backtracking
- Dynamic Programming
- Stacks
- Queues
- Linked Lists
- Trees
- Binary Search
- Graphs (BFS & DFS)
- Shortest Path Algorithms
- Dijkstra
- Floyd–Warshall
- And many more...
Each solution is a standalone C++17 program.
g++ -std=c++17 -O2 Day_01/Q1.cpp -o Q1Linux / macOS
./Q1Windows
Q1.exe- C++17-compatible compiler
- GCC 7+
- Clang 5+
- MSVC 2017+
This repository serves as:
- A record of my CodeSprint 3.0 journey.
- A structured archive of DSA solutions.
- A resource for revision and learning.
- A demonstration of my problem-solving practice in C++.
This project is licensed under the MIT License. See the LICENSE file for details.
Apoorva Chandra
- Challenge: CodeSprint 3.0
- Organized by: USC KIIT