Data Structures & Algorithms in C++

This repository documents my journey of learning cpp and Data Structures and Algorihtms

🌟 Practice Resources

Beginner Level 🏆 Key Achievements

100+ C++ Programs implemented
Complete DSA Coverage from basics to advanced
Graph Algorithms including Articulation Points
Operating System Concepts with practical implementations
STL Mastery with real-world applications
Pattern Programming for logical skill development
Competitive Programming Solutions from LeetCode and CodeStudio
Dynamic Programming implementations with multiple approaches
Real Problem-Solving experience with popular coding platforms Start with Basic/ folder - Master C++ fundamentals 2. Practice patterns/ - Develop logical thinking 3. Learn OOPS/ concepts - Object-oriented programming

Intermediate Level

4. Explore Arrays/ operations
5. Master Search/ algorithms
6. Understand Standard Template Library/
7. Try problems in CODESTUDIO/Vector/ for practical application

Advanced Level

8. Implement Tree/ data structures
9. Study CPU scheduling/ algorithms
10. Master Graph algorithms (Lecture 85, Lecture 99)
11. Solve Dynamic Programming problems (CODESTUDIO/Dynamic Programming/, LeetCode/)
12. Practice complex problems in Exam/ folder

Expert Level

13. Explore competitive programming solutions in LeetCode/ and CODESTUDIO/
14. Apply learned concepts to solve real-world problemsem solutions from:**

LeetCode: Sainava's Profile - Solutions available in LeetCode/ folder
CodeStudio/Coding Ninjas: Sainava's Profile - Solutions available in CODESTUDIO/ folder

Note: Missing lecture numbers correspond to practice sessions on these platforms. The actual solutions from these sessions are now included in the respective folders.U Scheduling Algorithms

• First Come First Serve (FCFS)
• Shortest Job First (SJF) - Preemptive & Non-Preemptive
• Priority Scheduling - Preemptive & Non-Preemptive
• Round Robin with Time Quantum
• Round Robin Dispatcher

Deadlock Prevention

• Banker's Algorithm Implementation
• Resource Allocation & Safety Algorithms

💻 Competitive Programming Solutions

CodeStudio/Coding Ninjas Problems (CODESTUDIO/)

• Dynamic Programming:
  • Fibonacci Number Implementation
  • Ways to Reach Nth Stairs
• Vector Operations:
  • Sort 0, 1, 2 (Dutch National Flag Problem)

LeetCode Problems (LeetCode/)

• Problem #746: Min Cost Climbing Stairs
• Dynamic Programming: Various DP solutions and approaches

These sections contain real problem solutions from popular coding platforms, demonstrating practical application of DSA concepts.es and Algorithms implementations in C++. It covers everything from basic C++ fundamentals to advanced graph algorithms, with lecture-wise organized content and practical implementations.

---

📂 Repository Structure

Learning-DSA-in-CPP/
│
├── Basic/                      # C++ Fundamentals & Programming Basics
├── OOPS/                       # Object-Oriented Programming Concepts
├── patterns/                   # Pattern Programming (7 different patterns)
├── Arrays/                     # Array Operations & Algorithms
├── Search/                     # Searching Algorithms (Linear, Binary, etc.)
├── Standard Template Library/  # STL Containers & Algorithms
├── Tree/                       # Tree Data Structure Implementation
├── CPU scheduling/             # Operating System Scheduling Algorithms
├── Bankers_Algo/              # Banker's Algorithm for Deadlock Avoidance
├── Exam/                      # Practice Problems & Exam Questions
│
├── CODESTUDIO/                # CodeStudio/Coding Ninjas Problems
│   ├── Dynamic Programming/   # DP Problems (Fibonacci, Stairs)
│   └── Vector/               # Vector-based Problems (Sort 0,1,2)
│
├── LeetCode/                  # LeetCode Problem Solutions
│   ├── Dynamic Programming/   # DP Problems from LeetCode
│  
│
├── Lecture 20-26/             # Foundation Lectures
├── Lecture 33-36/             # Intermediate Concepts
├── Lecture 44-48/             # Advanced Data Structures
├── Lecture 54-62/             # Trees, Queues & Advanced Topics
├── Lecture 69-99/             # Graphs, Heaps & Complex Algorithms
│
└── README.md                  # This file

---

Topics Covered

🏗️ C++ Fundamentals (Basic/)

Data Types, Variables, and Operators
Loops and Conditional Statements
Functions (Pass by Value & Reference)
Bitwise Operations & Number Systems Prime Numbers & Mathematical Functions Fibonacci Series & Power Functions

Pattern Programming (patterns/)

7 Different Pattern Types Star Patterns, Number Patterns Pyramid and Diamond Patterns

Object-Oriented Programming (OOPS/)

Classes & Objects
4 Pillars of OOP Inheritance & Polymorphism
Encapsulation & Abstraction

Standard Template Library (STL/)

• Containers: Vectors, Sets, Maps, Stacks, Queues
• Algorithms: Sorting, Searching, STL Functions
• Iterators & Custom Comparators

Searching Algorithms (Search/)

• Linear Search Implementation
• Binary Search & Variations
• Square Root using Binary Search
• Aggressive Cows Problem
• Book Allocation Problem

Arrays (Arrays/)

• Array Operations & Manipulations
• Array Reversal & Rotation
• Sum Calculations & Updates
• Pivot Finding Algorithms

Trees (Tree/)

• Tree Creation & Traversal
• Binary Trees Implementation
• Tree Algorithms & Operations

Advanced Topics (Lecture Series)

Lecture 60-62: Queue Implementation

• Queue using STL
• Queue using Linked Lists
• Custom Queue Implementations

Lecture 75: Heap Data Structure

• Heap Implementation
• Priority Queue Operations
• Heap Sort Algorithm

Lecture 85: Graph Algorithms

• BFS (Breadth-First Search)
• DFS (Depth-First Search)
• Graph Representation & Traversal

Lecture 99: Advanced Graph Algorithms

• Articulation Points Detection
• Tarjan's Algorithm Implementation
• Graph Theory Applications

Operating System Concepts

CPU Scheduling Algorithms

• First Come First Serve (FCFS)
• Shortest Job First (SJF) - Preemptive & Non-Preemptive
• Priority Scheduling - Preemptive & Non-Preemptive
• Round Robin with Time Quantum
• Round Robin Dispatcher

Deadlock Prevention

• Banker's Algorithm Implementation
• Resource Allocation & Safety Algorithms

---

Practice Resources

For additional practice problems and coding challenges, check out:

LeetCode: Sainava's Profile
CodeStudio/Coding Ninjas: Sainava's Profile

Note: Missing lecture numbers correspond to practice sessions on these platforms.

---

🛠 Installation & Setup

Prerequisites

Make sure you have a C++ compiler installed:

• GCC (Linux/MacOS)
• Clang (MacOS/Linux)
• MSVC (Windows)
• MinGW (Windows)

Compilation

To compile any C++ file, use:

# Basic compilation
g++ filename.cpp -o output_name

# With debugging symbols
g++ -g filename.cpp -o output_name

# With C++11/14/17 standard
g++ -std=c++17 filename.cpp -o output_name

# Run the compiled program
./output_name

Running Examples

# Navigate to any lecture folder
cd "Lecture 99"

# Compile and run
g++ Articulation_points.cpp -o articulation
./articulation

---

Learning Path

Beginner Level

1. Start with Basic/ folder - Master C++ fundamentals
2. Practice patterns/ - Develop logical thinking
3. Learn OOPS/ concepts - Object-oriented programming

Intermediate Level

4. Explore Arrays/ operations
5. Master Search/ algorithms
6. Understand Standard Template Library/

Advanced Level

7. Implement Tree/ data structures
8. Study CPU scheduling/ algorithms
9. Master Graph algorithms (Lecture 85, Lecture 99)
10. Practice complex problems in Exam/ folder

---

🏆 Key Achievements

100+ C++ Programs implemented
Complete DSA Coverage from basics to advanced
Graph Algorithms including Articulation Points
Operating System Concepts with practical implementations
STL Mastery with real-world applications
Pattern Programming for logical skill development

---

Contributing

Feel free to:

• Suggest improvements
• Add more algorithms or optimizations
• Submit pull requests

---

Connect With Me

GitHub: @Sainava
Repository: Learning-DSA-in-CPP

---

If this repository helped you learn DSA, please give it a star!