Competitive Programming

Overview

A growing collection of competitive programming solutions covering a range of algorithmic topics. Solutions are written in various languages (C++, C, Python) with a focus on efficiency and clean implementation. This repo is continuously updated as I solve new problems.

Topics Covered

• Sorting & Searching: binary search, merge sort, quick sort
• Data Structures: stacks, queues, trees, hash maps
• Dynamic Programming: memoization, tabulation, optimization
• Graph Theory: BFS, DFS, shortest paths
• Math & Number Theory: GCD, primes, modular arithmetic
• Greedy Algorithms: interval scheduling, optimal substructure

Why

Competitive programming builds the algorithmic thinking that's essential for software engineering, from writing efficient code to recognizing patterns in real-world problems.