Welcome to my personal Data Structures and Algorithms workspace. This repository serves as a daily log of my journey learning DSA concepts from "APNA COLLEGE" youtube channel playlist, mastering algorithmic problem-solving, structural memory architecture, and optimization techniques using C++.
Every folder represents a dedicated milestone of topics, transitioning from basic programming syntax to advanced algorithmic optimizations.
- 01_Basics: This folders contains the basics of C++ syntax. As the lecture progress i commit the source code here, this ranges from Hello World Program to topics like Functions , Patterns(using nested loops) ,Binary Number System and Bitwise Operator.
- 02_Arrays: This is where the actual DSA starts. Vector Library, Array and Algorithms including Kaden's , Moore's and some of the Leetcode Problems applied more than 1 approaches every time some are optimal some are not.
- 03_Pointers_&_BinarySearch: The heart of C++ Pointers(multi Pointers , derefernce operator). Then there is Binary Searching techniques that comes with O(logn) Complexity at last some challenging questions.
- 04_Sorting: Here we basically aim at sorting the given array in minimum time possible either asending or desending. At last some challenging questions from Leetcode and Lectures.
- 05_Strings: Deep dive into character arrays and the standard C++ String class. Focuses on string manipulation algorithms and optimization techniques, tracking progress.
- 06_Maths: Bridging pure mathematical theories with computational logic. Focuses on algorithms built for fast calculations and overflow handling, including prime determinations, and inverse integer tracking.
- 07_2D-Array: Moving into multi-dimensional memory structures and matrix manipulations. Covers row/column-wise matrix traversals, dynamic memory allocation, and algorithmic grid navigation problems.
-
08_Sum-Prblm: Dedicated section tracking target-sum and subarray problems. Focuses on building optimization transitions directly from basic Brute Force approaches (
$O(n^2)$ or $O(n^3)$) to optimal linear time complexities, featuring deep-dives into Subarray Sum mechanics. - 09_Recursion:Covers functional recursion, tracking execution flows within the Call Stack.
- 10_Backtracing_Q: Core pillar of functional backtracking with some important leetcode problems.
“First, solve the problem. Then, write the code.” Built inside the library, line-by-line, commit-by-commit.