This repository is my personal collection of Data Structures & Algorithms (DSA) problems solved in C++.
I use this space to practice and improve problem-solving skills, strengthen my understanding of core concepts, and prepare for coding interviews.
- The repo contains C++ implementations of DSA problems from basics to advanced.
- Problems are organized topic-wise (Arrays, Strings, Linked List, Trees, Graphs, etc.).
- Each file focuses on one problem/algorithm with clear and optimized solutions.
- Written in C++17 and compiled using
g++.
This repo reflects my daily coding practice and learning journey in mastering DSA.
- Basic Programs → Factorial, palindrome, Armstrong numbers, swapping, etc.
- Arrays & 2D Arrays → Searching, sorting, Kadane’s algorithm, subarrays, spiral traversal, transpose.
- Strings & Recursion → Palindrome, subsequences, anagrams, backtracking, N-Queens, Tower of Hanoi.
- Sorting & Searching → Merge Sort, Quick Sort, Binary Search, STL
lower_bound,upper_bound. - Bit Manipulation → Count set bits, power of 2, fast exponentiation.
- Linked List → Reverse, detect cycle, palindrome check, doubly/singly implementation.
- Stacks & Queues → Stack using arrays/vectors/linked list, parenthesis matching, stock span.
- Binary Trees & BST → Traversals, height, diameter, LCA, build BST, check balanced tree.
- Graphs → BFS, DFS, cycle detection, bipartite graph, topological sort, Dijkstra.
- Heaps & Greedy → Heap sort, min/max heap, activity selection, fractional knapsack.
- OOP in C++ → Classes, inheritance, polymorphism, constructors.