A collection of Data Structures and Algorithms implemented in C++ with clean, modular code. Covers problems on arrays, strings, recursion, sorting, searching, and more for practice and learning.
This repository contains a comprehensive collection of Data Structures and Algorithms (DSA) implemented in C++.
It is designed for practice, learning, and building a strong foundation in programming and algorithmic problem-solving.
The code is clean, modular, and beginner-friendly, making it suitable for interview preparation, competitive programming, and academic practice.
- Organized Structure → Code is grouped into topics such as Arrays, Strings, Sorting, Searching, and Recursion.
- Efficiency Focused → Each program is implemented with time and space complexity in mind.
- Clean & Readable Code → Functions are clearly separated and easy to understand.
- Multiple Approaches → Many problems include both brute-force and optimized solutions.
- Core DSA Concepts Covered:
- Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort
- Searching Algorithms: Linear Search, Binary Search, variations of Binary Search
- Array Operations: Rotation, Rearrangement, Prefix/Suffix Sums, Maximum/Minimum computations
- String Problems: Palindromes, Substring search, Frequency counting, Anagrams
- Recursion & Backtracking: Factorial, Fibonacci, N-Queens, Tic Tac Toe (Minimax AI)
- Practice-Ready → Ideal for coding interviews, competitive programming contests, and academic exercises.