DSA Practice in C++ 🚀

This repository contains my Data Structures and Algorithms (DSA) practice solutions implemented in C++.

Actively building this as preparation for technical interviews and campus placements (MCA 2026 batch). Focus on clean, efficient, and well-commented code with optimal time/space complexity.

Problems sourced from GeeksforGeeks, LeetCode, and standard DSA textbooks. Currently covering fundamentals + expanding into Recursion, Strings, and more advanced topics!

📂 Repository Structure

Root Files (Core Problems)

File	Description	Key Concepts
aggressivecowprob.cpp	Aggressive Cows: Maximize minimum distance between cows in stalls	Binary Search, Greedy, Arrays
armstrongnumber.cpp	Check if a number is an Armstrong number	Math, Digit Manipulation
array.cpp	Basic array operations (traversal, insertion, deletion, etc.)	Arrays Fundamentals
binsearch.cpp	Standard binary search on sorted array	Binary Search, Divide & Conquer
bookallocation.cpp	Book Allocation: Minimize maximum pages assigned to students	Binary Search on Answer, Arrays
bubblesort.cpp	Bubble sort implementation with optimizations	Sorting Algorithms
buyandsellstock.cpp	Best Time to Buy/Sell Stock (single transaction)	Arrays, Kadane's Algorithm
checkarraysorted.cpp	Check if an array is sorted	Arrays, Traversal

Topic Folders (Expanding!)

• Array/ → Advanced array manipulations and problems.
• Maths/ → Mathematical and number theory problems (primes, GCD, etc.).
• Recursion/ → Recursion-based solutions (backtracking, divide & conquer).
• String/ → String manipulation, patterns, and algorithms.

(Adding code + detailed READMEs inside folders soon!)

🔧 How to Compile & Run

Standard C++ files — compile with g++:

g++ -o output filename.cpp
./output