https://github.com/sahil-4/dsa-learning
https://github.com/sahil-4/dsa-learning
Last synced: 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/sahil-4/dsa-learning
- Owner: Sahil-4
- Created: 2022-11-18T05:50:28.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-09-25T15:18:15.000Z (over 1 year ago)
- Last Synced: 2025-02-14T16:59:58.570Z (4 months ago)
- Language: C++
- Size: 166 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# C++ Placement Course by Love Babbar
#### Course Structure
| Topic | Completed |
| ------------------------- | --------- |
| Programming Introduction | ✓ |
| Arrays | ✓ |
| Time and Space Complexity | ✓ |
| Binary Search | ✓ |
| Sorting | ✓ |
| C++ STL | ✓ |
| Arrays II | ✓ |
| Maths for Programming | ✓ |
| Pointers and Memory | ✓ |
| Recursion | ✓ |
| OOPS | ✓ |
| Linked List | ✓ |
| Stacks | |
| Queues | |
| Binary Tree | |
| Binary Search Tree | |
| Heaps | |
| Hashmaps | |
| Tries | |
| Backtracking | |
| Graphs | |
| Dynamic Programming | |#### Detailed Content
- **Programming Introduction**
1. [Lecture 1: Intro to Programming & Flowcharts](/Programming%20Introduction/lecture001.md)
2. [Lecture 2: First Program in C++](/Programming%20Introduction/lecture002.md)
3. [Lecture 3: If-Else, While loop & Lots of Patterns](/Programming%20Introduction/lecture003.c)
4. [Lecture 4: Pattern Questions](/Programming%20Introduction/lecture004.c)
5. [Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping](/Programming%20Introduction/lecture005.c)
6. [Lecture 6: Binary & Decimal Number System](/Programming%20Introduction/lecture006.cpp)
7. [Lecture 7: LeetCode Problem Solving](/Programming%20Introduction/lecture007.c)
8. [Lecture 8: Switch Statement & Functions](/Programming%20Introduction/lecture008.cpp)- **Arrays**
1. [Lecture 9: Introduction to Arrays](/Arrays/lecture009.cpp)
2. [Lecture 10: LeetCode/CodeStudio Questions](/Arrays/lecture010.c)- **Time and Space Complexity**
1. [Lecture 11:Time & Space Complexity](/Time%20and%20Space%20Complexity/lecture011.md)
- **Binary Search**
1. [Lecture 12: Binary Search](/Binary%20Search/lecture012.c)
2. [Lecture 13: Binary Search Interview Questions](/Binary%20Search/lecture013.c)
3. [Lecture 14: Binary Search Interview Questions ](/Binary%20Search/lecture014.c)
4. [Lecture 15: Binary Search Advanced Problems](/Binary%20Search/lecture015.cpp)- **Sorting**
1. [Lecture 16: Selection Sort](/Sorting/Lecture016.java)
2. [Lecture 17: BUBBLE SORT](/Sorting/Lecture017.java)
3. [Lecture 17: BUBBLE SORT](/Sorting/Lecture017.js)
4. [Lecture 18: INSERTION SORT](/Sorting/Lecture018.java)- **C++ STL**
1. [Lecture19: C++ STL](/C++%20STL/lecture019.cpp)
- **Arrays II**
1. [Lecture 20: LeetCode/CodeStudio Questions](/Arrays%20II/lecture020.c)
2. [Lecture 21: LeetCode/CodeStudio Questions](/Arrays%20II/lecture021.cpp)
3. [Lecture 22: Char Arrays, Strings & LeetCode Questions](/Arrays%20II/lecture022.cpp)
4. [Lecture 23: Introduction to 2D Arrays || LeetCode Questions](/Arrays%20II/lecture023.cpp)- **Maths for Programming**
1. [Lecture 24: Basic Maths for DSA](/Mathematics%20for%20Programming/lecture024.cpp)
- **Pointers and Memory**
1. [Lecture 25: Pointers in C++ || Part-1](/Pointers%20and%20Memory/lecture025.cpp)
2. [Lecture 26: Pointers in C++ || Part-2](/Pointers%20and%20Memory/lecture026.cpp)
3. [Lecture 27: Double Pointers in C++ || Pointers Practice MCQs](/Pointers%20and%20Memory/lecture027.cpp)
4. [Lecture 28: Reference Variable | Static vs Dynamic Memory](/Pointers%20and%20Memory/lecture028.cpp)
5. [Lecture 29: Dynamic Memory Allocation of 2D Arrays](/Pointers%20and%20Memory/lecture029.cpp)
6. [Lecture 30: Macros, Global Variables, Inline Functions & Default Args](/Pointers%20and%20Memory/lecture030.cpp)- **Recursion**
1. [Lecture 31: Learning Recursion the Best Way || Recursion Day 1](/Recursion/lecture031.py)
2. [Lecture 32: Understanding Recursion the easiest way || Recursion Day 12](/Recursion/lecture032.py)
3. [Lecture 33: Recursion and Binary Search || Recursion Day 3](/Recursion/lecture033.py)
4. [Lecture 34: Recursion with Strings || Recursion Day 4](/Recursion/lecture034.py)
5. [Lecture 35: Merge Sort using Recursion || Recursion Day 5](/Recursion/lecture035.cpp)
6. [Lecture 36: Quick Sort using Recursion || Recursion Day 6](/Recursion/lecture036.cpp)
7. [Lecture 37: Recursion - Subsets/Subsequences of String || Recursion Day 7](/Recursion/lecture037.cpp)
8. [Lecture 38: Phone Keypad Problem || Recursion Day 8](/Recursion/lecture038.cpp)
9. [Lecture 39: Permutations of a String || Recursion Day 9](/Recursion/lecture039.cpp)
10. [Lecture 40: Rat in a Maze Problem || Recursion Day 10](/Recursion/lecture040.cpp)
11. [Lecture 41: Time & Space Complexity of Recursive Algorithms](/Recursion/lecture041.cpp)- **OOPS**
1. [Lecture 42: OOPs Concepts Part 1](/OOPS/lecture042.cpp)
2. [Lecture 43: 4 Pillars of OOPs Concept -Inheritance, Polymorphism, Encapsulation & Abstraction OOPs Part 2](/OOPS/lecture043.cpp)- **Linked List**
1. [Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.](/Linked%20List/lecture044.cpp)
2. [Lecture 45: Linked List Questions: Reverse LL and find Middle of LL](/Linked%20List/lecture045.cpp)
3. [Lecture 46: Linked List Questions: Reverse LL in K group && Check LL is Circular or not](/Linked%20List/lecture046.cpp)
4. [Lecture 47: Detect & Remove Loop in Linked List](/Linked%20List/lecture047.cpp)
5. [Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List](/Linked%20List/lecture048.cpp)
6. [Lecture 49: Merge 2 Sorted Linked Lists Questions: Sort 0s, 1s and 2s in Linked List](/Linked%20List/lecture049.cpp)
7. [Lecture 50: Check Palindrome in Linked List](/Linked%20List/lecture050.cpp)
8. [Lecture 51: Add 2 Numbers represented by Linked Lists](/Linked%20List/lecture051.cpp)
9. [Lecture 52: Clone a Linked List with Random Pointers](/Linked%20List/lecture052.cpp)
10. [Lecture 53: Merge Sort in Linked List ](/Linked%20List/lecture053.cpp)- **Stacks**
- **Queues**
- **Binary Tree**
- **Binary Search Tree**
- **Heaps**
- **Hashmaps**
- **Tries**
- **Backtracking**
- **Graphs**
- **Dynamic Programming**