Open Projects - IEMDaily

Thursday, July 16, 2026

Starting a new Lecture Notes Series on C++ Full Course | C++ Tutorial | Data Structures & Algorithms

Youtube Lecture Playlist Credits
Channel Name: ScoreShala

So Let Us Start to This Journey of Learning

C++ Full Course | C++ Tutorial | Data Structures & Algorithms By Lecture Notes together!

Lecture 151: Heap STL | C++ Placement Course | Lecture 31.3

Lecture 152: Heaps - Median of Running Stream | C++ Placement Course | Lecture 31.4

Lecture 153: Heaps - Merge K sorted Arrays | C++ Placement Course

Lecture 154: Heap -Smallest Sequence with sum K | C++ Placement Course | Lecture 31.6

Lecture 155: Hashing - Introduction to Hasing | C++ Placement Coure | Lecture 32.1

Lecture 156: Hashing STL - C++ Placement Course | Lecture 32.2

Lecture 157: Hashing - Count frequency of elements | C++ Placement Course | Lecture 32.3

Lecture 158: Hashing - Vertical Order Print | C++ Placement Course | Lecture 32.4

Lecture 159: Hashing - Number of Subarrays with Sum Zero | C++ Placement Course | Lec 32.5

Lecture 160: Hashing - Sliding Window Technique | C++ Placement Course

Lecture 161: Hashing - TOP K MOST FREQUENT ELEMENTS | C++ Placement Course | Lecture 32.7

Lecture 162: Sudoku Solver - Hashing | C++ Placement Course | Lecture 32.8

Lecture 163: Greedy Algorithm - Introduction | C++ Placement Course Lecture 33.1

Lecture 164: Indian Coin Change - Greedy Algorithm | C++ Placement Course | Lecture 33.2

Lecture 165: Activity Selection Problem - Greedy Algorithm | C++ Placement Course | Lecture 33.3

Lecture 166: Fractional Knapsack - Greedy Algorithm | C++ Placement Course | Lecture 33.4

Lecture 167: Optimal Pattern Merge - Greedy Algorithm | C++ Placement Course | Lecture 33.5

Lecture 168: Expedi - Greedy Algorithm | C++ Placement Course | Lecture 33.6

Lecture 169: Expedi - Greedy Algorithm | C++ Placement Course | Lecture 33.6

Lecture 170: Graphs - Introduction | C++ Placement Course | Lecture 34.1

Lecture 171: Dynamic Programming - Introduction | C++ Placement Course | Lecture 35.1

Lecture 172: Graph Terminologies | C++ Placement Course | Lecture 34.2

Lecture 173: Graphs - Representation | C++ Placement Course | Lecture 34.3

Lecture 174: BFS - Breadth First Search | C++ Placement Course | Lecture 34.4

Lecture 175: DFS - Depth First Search | C++ Placement Course | Lecture 34.5

Lecture 176: Graphs - Topological Sort | C++ Placement Course | Lecture 34.6

Lecture 177: Cycle Detection in Undirected Graphs | C++ Placement Course | Lecture 34.7

Lecture 178: Cycle Detection in Directed Graph | C++ Placement Course | Lecture 34.8

Lecture 179: Connected Components | C++ Placement Course | Lecture 34.9

Lecture 180: Bipartite Graph - C++ Placement Course | Lecture 34.10

Lecture 181: Disjoint Set Union - Graphs | C++ Placement Course | Lecture 34.11

Lecture 182: Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12

Lecture 183: Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12

Lecture 184: Kruskal's Algorithm | C++ Placement Course | Lecture 34.13

Lecture 185: Kruskal's Algorithm | C++ Placement Course | Lecture 34.13

Lecture 186: Dijkstra's Algorithm | C++ Placement Course | Lecture 34.15

Lecture 187: Bellman Ford Algorithm | C++ Placement Course | Lecture 34.16

Lecture 188: Floyd Warshall Algorithm | C++ Placement Course | Lecture 34.17

Lecture 189: Snakes and Ladders - Graphs | C++ Placement Course | Lecture 34.18

Lecture 190: Graphs - Surrounded Region | C++ Placement Course | Lecture 34.19

Lecture 191: Fibonacci Sequence - Dynamic Programming | C++ Placement Course | Lecture 35.2

Lecture 192: Minimum Number of Squares - Dynamic Programming | C++ Placement Course | Lecture 35.3

Lecture 193: Coin Change Problem - Dynamic Programming | C++ Placement Course | Lecture 35.4

Lecture 194: 01 Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.7

Lecture 195: Longest Increasing Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.8

Lecture 196: Longest Common Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.9

Lecture 197: Matrix Chain Multiplication - Dynamic Programming | C++ Placement Course | Lecture 35.10

Lecture 198: Minimum Jumps to Reach End - Dynamic Programming | C++ Placement Course | Lecture 35.11

C++ Full Course | C++ Tutorial | Data Structures & Algorithms (Hindi) (Part 4)