Data Structures and Algorithms (DSA) - Apna College

Overview

This repository documents the daily learning progress on Data Structures and Algorithms (DSA), based on the Apna College YouTube DSA course. It includes conceptual explanations, problem solutions, and structured code implementations.

Repository Structure

DSA-ApnaCollege  
 ├── Arrays  
 │   ├── README.md  (Concepts and important formulas)  
 │   ├── ReverseArray.cpp  
 │   ├── MaxSubarraySum.cpp  
 ├── LinkedList  
 ├── Recursion  
 ├── Sorting  
 ├── DynamicProgramming  
 ├── README.md  (Repository overview)  
 ├── .gitignore  
 ├── LICENSE  

Topics Covered

• Arrays (Basic to Advanced Problems)
• Linked Lists (Singly, Doubly, Circular)
• Recursion and Backtracking
• Sorting Algorithms (Bubble, Selection, Merge, Quick Sort, etc.)
• Stack and Queue
• Binary Trees and Binary Search Trees (BST)
• Dynamic Programming (DP)
• Graph Algorithms (DFS, BFS, Dijkstra’s Algorithm, etc.)
• Tries and Hashing

Usage Instructions

1. Clone the repository:

   git clone https://github.com/your-username/DSA-ApnaCollege.git

2. Navigate to the desired topic.
3. Compile and execute C++ files using a compiler such as g++:

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

Goals and Commit Frequency

• Regular updates with newly learned concepts and problem solutions.
• Well-documented code with explanations and best practices.
• Continuous improvement and practice to enhance proficiency in DSA.

Contribution

This repository serves as a personal learning resource. However, interested individuals are welcome to fork and utilize the content for their own learning purposes.

Contact Information

For any queries or discussions, please reach out via:

• LinkedIn: (https://www.linkedin.com/in/sagarsolanki3266)(#)
• GitHub: (https://github.com/GeorgianSagar)(#)
• Email: sagarsolanki3266@gmail.com

---

This repository is intended to facilitate structured learning and improve problem-solving skills in Data Structures and Algorithms.