Indian Polity for All Competitive Exams (Hindi) (Part 1)

Humanities Series

Indian Polity for All Competitive Exams (Hindi) (Part 1)

   Wednesday, August 05, 2026   

Starting a new Lecture Notes Series on Indian Polity for All Competitive Exams

Youtube Lecture Playlist Credits 

Channel Name: Harsh IAS

So Let Us Start to This Journey of Learning 

Indian Polity for All Competitive Exams By Lecture Notes together!

Lecture 1: L1 - Historical Background | UPSC CSE | State PSC | Indian Polity for UPSC

Lecture 2: L2 - Historical Background | UPSC CSE | State PSC | Indian Polity for UPSC

Lecture 3: L3 - Making of the Constitution | UPSC | State PSC | Indian Polity for UPSC

Lecture 4: L4 - Making of the Constitution | UPSC | State PSC | Indian Polity for UPSC

Lecture 5: L5 - Salient Features of the Constitution | UPSC | Indian Polity for UPSC

Lecture 6: L6 - Salient Features of the Constitution | UPSC | State PSC | Indian Polity for UPSC

Lecture 7: L7 - Criticism of the Constitution | UPSC | State PSC | Indian Polity for UPSC

Lecture 8: L8 - Sources & Schedules of the Constitution | UPSC | State PSC | Indian Polity for UPSC

Lecture 9: L9 - Preamble of the Constitution | Indian Polity for UPSC

Lecture 10: L10 - Preamble of the Constitution (Part-2) | Indian Polity for UPSC

Lecture 11: L11 - Preamble as part of the Constitution | Indian Polity by M. Laxmikanth | Indian Polity for UPSC

Lecture 12: L12 - Article 1-4 of Indian Constitution | Union and its Territory | Indian Polity for UPSC

Lecture 13: L13- Evolution of States & Union Territories| Dhar/JVP/Fazl ali committee | Indian Polity for UPSC

Lecture 14: L14- New States and Union Territories created after 1956 | Indian Polity for UPSC

Lecture 15: L15- Constitutional Provisions | Citizenship | Article 5 to 11 | Indian Polity for UPSC

Lecture 16: L16- Citizenship Act 1955 | Acquisition & Loss of Citizenship | Indian Polity for UPSC

Lecture 17: L17- Overseas Citizenship of India | Indian Polity for UPSC

Lecture 18: L17- Overseas Citizenship of India | Indian Polity for UPSC

Lecture 19: L19: Article 13 of Constitution and Basic Structure of Constitution | Indian Polity for UPSC

Lecture 20: L20: Article 14 - Equality before Law and Equal Protection of laws | Indian Polity for UPSC

Lecture 21: L21: Article 15 - Prohibition of Discrimination on Certain grounds | Indian Polity for UPSC

Lecture 22: L22: Article 16 - Equality of Opportunity in Public Employment | Indian Polity for UPSC

Lecture 23: L23: Article 17,18 & 19 - Freedom of Speech & Expression, Assembly | Indian Polity for UPSC

Lecture 24: L24: Article 20 - Protection in Respect of Conviction for Offences | Indian Polity for UPSC

Lecture 25: L25: Article 21 - Protection of Life and Personal Liberty | Indian Polity for UPSC

Lecture 26: L26: Article 22 - Protection against Arrest and Detention | Indian Polity for UPSC

Lecture 27: L27: Article 23-24 : Right against Exploitation | Begar/Child Labour | Indian Polity for UPSC

Lecture 28: L28: Article 25 to 28 - Right to Freedom of Religion | Indian Polity for UPSC

Lecture 29: L29: Article 29-30 : Cultural and Educational Rights of Minorities | Indian Polity for UPSC

Lecture 30: L30: Article 32- Right to Constitutional Remedies | Right to Property | Indian Polity for UPSC

Lecture 31: L31: Writs- Habeas Corpus/Mandamus/Prohibition/Certiorari/QuoWarranto | Indian Polity for UPSC

Lecture 32: L32: Article 33, 34 & 35- Armed Forces Fundamental Rights/Martial Law | Indian Polity for UPSC

Lecture 33: L33: Article 31A, 31B & 31C- Exceptions to Fundamental Rights | Indian Polity for UPSC

Lecture 34: L34- Criticism & Significance of FRs / Rights outside Part III | Indian Polity for UPSC

Lecture 35: L35- Directive Principles of State Policy/Socialistic & Gandhian DPSP| Indian Polity for UPSC

Lecture 36: L36: Liberal-Intellectual DPSP / Sanction behind & Criticism of DPSP | Indian Polity for UPSC

Lecture 37: L37: Conflict between FR's & DPSP's /Utility of Directive Principles | Indian Polity for UPSC

Lecture 38: L38: Implementation of DPSP's / Directives Outside Part IV | Indian Polity for UPSC

Lecture 39: L39: Fundamental Duties Full Chapter / Swaran Singh Committee | Indian Polity for UPSC

Lecture 40: L40: Article 368 Amendment of Constitution/ Simple & Special Majority| Indian Polity for UPSC

Lecture 41: L41: Doctrine of Basic Structure and Various Supreme Court Judgements| Indian Polity for UPSC

Lecture 42: L42: Features of Parliamentary Government & Presidential Government | Indian Polity for UPSC

Lecture 43: L43: Merits & Demerits of Parliamentary System / Indian vs British Model | Indian Polity for UPSC

Lecture 44: L44: Federal Features of Indian Constitution / Unitary vs Federal Government |Indian Polity for UPSC

Lecture 45: L45: Unitary Features of the Constitution/ Federal Systems Critical Evaluation | Indian Polity UPSC

Lecture 46: L46: Centre-State Relations / Legislative Relations of Centre-State | Indian Polity for UPSC

Lecture 47: L47: Administrative Relations of Centre-State/Distribution of Executive Power | Indian Polity UPSC

Lecture 48: L48: Financial Relations /Taxing Power/Tax Revenue Distribution /Grant-in-Aids| Indian Polity UPSC

Lecture 49: L49: GST Council / Finance Commission / Inter-Governmental Tax Immunities | Indian Polity for UPSC

Lecture 50: L50: Tension Areas between Centre & State / ARC / Rajamannar Committee | Indian Polity for UPSC

Lecture 51: L51: Sarkaria Commission & Punchhi Commission Report of Centre-States Relation | Indian Polity UPSC

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 3)

CSE/IT SERIES

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 3)

   Friday, July 24, 2026   

Starting a new Lecture Notes Series on Complete C++ DSA Course | Data Structures & Algorithms Playlist

Youtube Lecture Playlist Credits 

Channel Name: Apna College

So Let Us Start to This Journey of Learning 

Complete C++ DSA Course | Data Structures & Algorithms Playlist By Lecture Notes together!

Lecture 97: Flatten Binary Tree to Linked List | DSA Series : L.95

Lecture 98: Binary Search Trees (BSTs) | DSA Series : L.96

Lecture 99: Sorted Array to Balanced BST | DSA Series : L.97

Lecture 100: Validate Binary Search Tree | DSA Series : L.98

Lecture 101: Min Distance between BST Nodes | DSA Series : L.99

Lecture 102: Kth Smallest in BST | DSA Series : L.100

Lecture 103: Lowest Common Ancestor in BST | DSA Series : L.101

Lecture 104: Construct BST from Preorder | DSA Series : L.102

Lecture 105: Merge Two Binary Search Trees | DSA Series : L.103

Lecture 106: Recover BST | DSA Series : L.104

Lecture 107: Largest BST in Binary Tree | DSA Series : L.105

Lecture 108: Populate Next Right Pointers in Each Node | DSA Series : L.106

Lecture 109: BST Iterator | DSA Series : L.107

Lecture 110: Inorder Predecessor & Successor in BST | DSA Series : L.108

Lecture 111: Introduction to Graphs | Data Structure & Algorithms

Lecture 112: BFS Traversal in Graphs | Data Structure & Algorithms

Lecture 113: DFS Traversal in Graphs | Data Structure & Algorithms

Lecture 114: Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms

Lecture 115: Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms

Lecture 116: Number of Islands | Connected Components in Matrix | Leetcode 200

Lecture 117: Rotting Oranges | Multi-source BFS | Leetcode 994

Lecture 118: Detect a Cycle in Directed Graph using DFS | Lecture 116

Lecture 119: Topological Sorting in Graph | using DFS | Lecture 117

Lecture 120: Course Schedule Problem | using Graph & Topological Sort

Lecture 121: Course Schedule II Problem | using Graph & Topological Sort

Lecture 122: Flood Fill Algorithm | Graph Problem

Lecture 123: Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 121

Lecture 124: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

Lecture 125: Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

Lecture 126: DSA Series Quick Update - 125 lectures | New DSA Sheet | DP, Heaps, Tries etc

Lecture 127: Prim's Algorithm - Minimum Spanning Tree in Graph

Lecture 128: Disjoint Set Union | With Rank/Size & Path Compression | Union Find

Lecture 129: Kruskal's Algorithm - Minimum Spanning Tree in Graph

Lecture 130: Number of Provinces | Graph Problem

Lecture 131: Min Cost to Connect All Points | Graph Problem

Lecture 132: Cheapest Flights Within K Stops | Graph Problem

Lecture 133: Bridge in Graph using Tarjan's Algorithm | Critical Connections

Lecture 134: Articulation Point in Graph using Tarjan's Algorithm | Critical Points

Lecture 135: Strongly Connected Components - Kosaraju's Algorithm | Graphs

Lecture 136: Floyd Warshall Algorithm | All Pairs Shortest Path in Graph

Lecture 137: Complete Dynamic Programming | DP Series - Lecture 1

Lecture 138: DP 2. Climbing Stairs | 1D Dynamic Programming

Lecture 139: DP 3. House Robber | 1D Dynamic Programming

Lecture 140: DP 4. House Robber II | 1D Dynamic Programming

Lecture 141: DP 5. Frog Jump | 1D Dynamic Programming

Lecture 142: DP 6. Min Cost Climbing Stairs | 1D Dynamic Programming

Lecture 143: Fractional Knapsack Algorithm | Greedy Method

Lecture 144: DP 8. 0/1 Knapsack | Recursion to DP Solution | Space Optimized

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 2)

CSE/IT SERIES

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 2)

   Thursday, July 23, 2026   

Starting a new Lecture Notes Series on Complete C++ DSA Course | Data Structures & Algorithms Playlist

Youtube Lecture Playlist Credits 

Channel Name: Apna College

So Let Us Start to This Journey of Learning 

Complete C++ DSA Course | Data Structures & Algorithms Playlist By Lecture Notes together!

Lecture 49: Combination Sum Problem | Recursion & Backtracking

Lecture 50: Palindrome Partitioning Problem | Recursion & Backtracking

Lecture 51: Merge Sort Algorithm | Recursion & Backtracking

Lecture 52: One Major update & reaching 1000M views

Lecture 53: Quick Sort Algorithm - Lecture 51 of Complete DSA Placement Series

Lecture 54: Count Inversions Problem | Brute and Optimal

Lecture 55: KNIGHTS TOUR Problem - Backtracking | Leetcode 2596

Lecture 56: OOPs Tutorial in One Shot | Object Oriented Programming | in C++ Language | for Placement Interviews

Lecture 57: Introduction to Linked List | Data Structures & Algorithms

Lecture 58: Reverse a Linked List | DSA Series by ‪@shradhaKD‬

Lecture 59: Middle of a Linked List | DSA Series by ‪@shradhaKD‬

Lecture 60: Detect & Remove Cycle in Linked List | DSA Series by ‪@shradhaKD‬

Lecture 61: Merge Two Sorted Lists | DSA Series by ‪@shradhaKD‬

Lecture 62: Copy List with Random Pointer | DSA Series by ‪@shradhaKD‬

Lecture 63: Doubly Linked List Tutorial

Lecture 64: Circular Linked List in Data Structures

Lecture 65: Flatten a Doubly Linked List | Leetcode 430 | DSA Series by ‪@shradhaKD‬

Lecture 66: Reverse Nodes in K-Group | Linked List

Lecture 67: Swap Nodes in Pairs | Linked List

Lecture 68: Introduction to STACKS | Data Structures & Algorithms | Lecture 66

Lecture 69: Valid Parentheses | Stack | Lecture 67

Lecture 70: Stock Span Problem | Optimal Solution

Lecture 71: Next Greater Element | Optimal Solution & Code

Lecture 72: Previous Smaller Element | Optimal Solution & Code

Lecture 73: Design a Min Stack | Optimal Solution & Code

Lecture 74: Largest Rectangle in Histogram | Best Solution & Code

Lecture 75: L73. Next Greater Element - II | Stack & Queue

Lecture 76: L74. Trapping Rainwater Problem | Optimal Solution & Code

Lecture 77: L75. The Celebrity Problem | Stack & Queue

Lecture 78: L76. Implement LRU Cache | Linked List

Lecture 79: New Chapter : Queue Data Structure

Lecture 80: L78. Circular Queue in Data Strucuture

Lecture 81: L79. Implement Queue using Stack & Stack using Queue

Lecture 82: L80. First Unique Character in String | Easy - Leetcode387

Lecture 83: L81. Sliding Window Maximum | Queue

Lecture 84: L82. Gas Station | Greedy Approach | Leetcode 134

Lecture 85: Binary Trees in Data Structures | Tree Traversal | DSA Placement Series

Lecture 86: L.84 Height of a Binary Tree | Count of Nodes in a Binary Tree

Lecture 87: L.85 Identical Tree (same tree) | Subtree of another Tree

Lecture 88: L.86 Diameter of Binary Tree

Lecture 89: Top View of a Binary Tree | DSA Series : L.87

Lecture 90: Kth Level of a Binary Tree | DSA Series : L.88

Lecture 91: Lowest Common Ancestor in Binary Tree | DSA Series : L.89

Lecture 92: Build Tree from Preorder & Inorder | DSA Series : L.90

Lecture 93: Transform to Sum Tree | DSA Series : L.91

Lecture 94: Binary Tree Paths | DSA Series : L.92

Lecture 95: Maximum Width of Binary Tree | DSA Series : L.93

Lecture 96: Morris Inorder Traversal | DSA Series : L.94

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 1)

CSE/IT SERIES

Complete C++ DSA Course | Data Structures & Algorithms Playlist (Hindi) (Part 1)

   Tuesday, July 21, 2026   

Starting a new Lecture Notes Series on Complete C++ DSA Course | Data Structures & Algorithms Playlist

Youtube Lecture Playlist Credits 

Channel Name: Apna College

So Let Us Start to This Journey of Learning 

Complete C++ DSA Course | Data Structures & Algorithms Playlist By Lecture Notes together!

Lecture 1: Lecture 1 : Flowchart & Pseudocode + Installation | DSA Series by Shradha Khapra Ma'am | C++

Lecture 2: Lecture 2 : Variable, Data Types & Operators | DSA Series by Shradha Ma'am | C++

Lecture 3: Lecture 3: Conditional Statements & Loops | DSA Series by Shradha Ma'am | C++

Lecture 4: Lecture 4: Patterns | DSA Series by Shradha Khapra Ma'am | C++

Lecture 5: Lecture 5: Functions | DSA Series by Shradha Khapra Ma'am | C++

Lecture 6: Binary Number System | DSA Series by Shradha Khapra Ma'am | C++

Lecture 7: Bitwise Operators, Data Type Modifiers & more | DSA Series by Shradha Khapra Ma'am | C++

Lecture 8: Array Data Structure - Part1 | DSA Series by Shradha Khapra Ma'am | C++

Lecture 9: Vectors in C++ | Arrays Part 2 | DSA Series by Shradha Ma'am | Lecture 9

Lecture 10: Kadane's Algorithm | Maximum Subarray Sum | DSA Series by Shradha Ma'am

Lecture 11: Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum

Lecture 12: Time & Space Complexity - DSA Series by Shradha Ma'am

Lecture 13: Buy and Sell Stock Problem and Pow(X,N) Power exponential Problem - Leetcode | DSA Series

Lecture 14: Container with Most Water Problem | Brute & Optimal Solution | Two Pointer Approach - Leetcode 11

Lecture 15: Product of Array Except Self | Brute to Optimal Solution | Leetcode 238

Lecture 16: Pointers in C++ | In Detail | DSA Series by Shradha Ma'am

Lecture 17: Binary Search Algorithm - Iterative and Recursive Method | [Theory + Code] with Example

Lecture 18: Search in Rotated Sorted Array | Binary Search | Leetcode 33

Lecture 19: Peak Index in Mountain Array | Binary Search | Leetcode 852

Lecture 20: Single Element in Sorted Array | Binary Search | DSA Series Lecture 20

Lecture 21: Book Allocation or Allocate Books Problem | DSA Series - Binary Search

Lecture 22: Painter's Partition Problem | DSA Placement Series - Binary Search | Lecture 22

Lecture 23: Aggressive Cows Problem | DSA Placement Series - Binary Search | Lecture 23

Lecture 24: Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am

Lecture 25: Sort an Array of 0s, 1s & 2s | DNF Sorting Algorithm | Leetcode 75

Lecture 26: Merge Sorted Arrays Problem and Next Permutation Problem | DSA Series

Lecture 27: C++ STL Complete Tutorial | Standard Template Library - One Shot

Lecture 28: How to setup C++ compiler on Mac ? | Software Installation for Mac users

Lecture 29: Strings & Character Arrays in C++ - Part 1 | DSA Placement Series

Lecture 30: Valid Palindrome & Remove all Occurrences | Strings Part 2 | DSA Placement Series

Lecture 31: Strings - Part 3 | Permutation in String | DSA Placement Series

Lecture 32: Strings - Part 4 | Reverse Words in String | DSA Placement Series

Lecture 33: String Compression problem - Lecture 32 | Leetcode 443

Lecture 34: Maths for DSA - One Shot | Euclid's Algorithm | Sieve of Eratosthenes | Modular Arithmetics

Lecture 35: 2D Arrays in C++ | Part 1 | DSA Series by Shradha Ma'am

Lecture 36: Search a 2D Matrix - Variation I & II | 2D Arrays - Part 2 | DSA Series by Shradha Ma'am

Lecture 37: Spiral Matrix | 2D Arrays - Part 3 | Leetcode 54 | DSA Series by Shradha Ma'am

Lecture 38: Two Sum | Find Duplicate | Find Repeating & Missing Values | Hashing Problems

Lecture 39: 3 Sum | Brute, Better & Optimized Approach with Codes | Leetcode 15

Lecture 40: 4 Sum Problem | Optimal Approach | DSA Series by Shradha Ma'am

Lecture 41: Subarray Sum Equals K | Brute-Better-Optimal approach

Lecture 42: Recursion Tutorial - Basics to Advanced | Part 1

Lecture 43: Recursion Part 2 : Fibonacci numbers problem, Binary search problem, Find if array sorted problem

Lecture 44: Recursion Part 3 : Backtracking in Detail | Print all Subsets | Subsets II

Lecture 45: Permutations of an Array/String | Recursion & Backtracking

Lecture 46: N-Queens Problem | using Backtracking | Leetcode Hard

Lecture 47: Sudoku Solver Problem | using Backtracking | Leetcode Hard

Lecture 48: Rat in a Maze Problem | Backtracking

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

CSE/IT SERIES

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

   Friday, July 17, 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 199: Optimal Game Strategy - Dynamic Programming | C++ Placement Course | Lecture 35.12

Lecture 200: Number of Subsequences - Dynamic Programming | C++ Placement Course | Lecture 35.13

Lecture 201: Count Number of Binary Strings - Dynamic Programming | C++ Placement Course | Lecture 35.14

Lecture 202: 0-N Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.15

Lecture 203: Kadane Algorithm - Dynamic Programming | C++ Placement Course | Lecture 35.5

Lecture 204: Maximum Length of Bitonic Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.19

Lecture 205: Friends Paring Problem - Dynamic Programming | C++ Placement Course | Lecture 35.20

Lecture 206: Ugly Numbers - Dynamic Programming | C++ Placement Course | Lecture 35.18

Lecture 207: LCS with 3 Strings - Dynamic Programming | C++ Placement Course | Lecture 35.16

Lecture 208: K-Ordered LCS - Dynamic Programming | C++ Placement Course | Lecture 35.17

Lecture 209: Tries - Introduction | C++ Placement Course | Lecture 36.1

Lecture 210: XOR SubArray - Tries Challenges | C++ Placement Course | Lecture36.2

Lecture 211: Trie bash - Challenge | C++ Placement Course | Lecture 36.3

Lecture 212: Digital Dictionary - Tries Challenges | C++ Placement Course | Lecture 36.4

Lecture 213: Extended Euclid Algorithm - Number Theory Advanced | C++ Placement Course | Lecture 37.1

Lecture 214: Multiplicative Modulo Inverse - Number Theory Advanced | Lecture 37.2

Lecture 215: Euler Totient Function - Number Theory Advanced | C++ Placement Course | Lecture 37.3

Lecture 216: Binary Exponentiation - Number Theory Advanced | C++ Placement Course | Lecture 37.4

Lecture 217: Fermat Little and Wilson Theorem - Number Theory Advanced | C++ Placement Course | Lecture 37.5

Lecture 218: Boring Factorials SPOJ - Number Theory Advanced | C++ Placement Course | Lecture 37.6

Lecture 219: Introduction, Fibonacci in Log(n) - Matrix Exponentiation | C++ Placement Course | Lecture 38.1

Lecture 220: String Hashing - String Algorithms | C++ Placement Course | Lecture 39.1

Lecture 221: SubStr() Function - String Algorithm | C++ Placement Course | Lecture 39.2

Lecture 222: KMP Algorithms - String Algorithm | C++ Placement Course | Lecture 39.3

Lecture 223: Rabin Karp - String Algorithms | C++ Placement Course | Lecture 39.4

Lecture 224: Guide to Interactive Problems | C++ Placement Course | Lecture 43

Lecture 225: Segment Tree - Introduction and Build | C++ Placement Course | Lecture 40.1

Lecture 226: Query in Segment Tree | C++ Placement Course | Lecture 40.2

Lecture 227: Maximum and Minimum Queries/Update | C++ Placement Course | Lecture 40.4

Lecture 228: Number of minimums on a segment | C++ Placement Course | Lecture 40.5

Lecture 229: User Snippets in VSCode | C++ Placement Course | Lecture 40.6

Lecture 230: Segment with Max Sum | C++ Placement Course | Lecture 40.7

Lecture 231: Kth One - Segment Tree | C++ Placement Course | Lecture 40.8

Lecture 232: First Element at Least X - Segment Tree | C++ Placement Course | Lecture 40.9

Lecture 233: Nested Segments - Segment Tree | C++ Placement Course | Lecture 40.12

Lecture 234: Intersecting Segments - Segment Tree | C++ Placement Course | Lecture 40.13

Lecture 235: Fenwick Tree - Introduction | C++ Placement Course | Lecture 41.1

Lecture 236: Point & Range Updates - Fenwick Tree | C++ Placement Course | Lecture 41.2

Lecture 237: Count Inversion - Fenwick Tree | C++ Placement Course | Lecture 41.3

Lecture 238: Square Root Decomposition - Introduction | C++ Placement Course | Lecture 42.1

Lecture 239: RMQSQ - Spoj | C++ Placement Course | Lecture 42.2

Lecture 240: Mo's Algorithm - Square Root Decomposition | Lecture 42.3

Lecture 241: DQueary - SPOJ | C++ Placement Course | Lecture 42.4

Lecture 242: Policy Based Data Structures | C++ Placement Course | Lecture 44

Lecture 243: Book Allocation or Allocate Books Problem | DSA Series - Binary Search

Lecture 244: Painter's Partition Problem | DSA Placement Series - Binary Search | Lecture 22

Lecture 245: Aggressive Cows Problem | DSA Placement Series - Binary Search | Lecture 23

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

CSE/IT SERIES

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

   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 3)

CSE/IT SERIES

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

   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 103: Stacking using Queues (Method 2) | C++ Placement Course | Lecture 24.4.2

Lecture 104: Sliding Window Maximum using Deque | C++ Placement Course | Lecture 25.1

Lecture 105: Largest Rectangle Code | C++ Placement Course | Lecture 25.2

Lecture 106: Trapping Rainwater | C++ Placement Course | Lecture 25.3

Lecture 107: Redundant Parenthesis | C++ Placement Course | Lecture 25.4

Lecture 108: The Stock Span Problem | C++ Placement Course | Lecture 25.5

Lecture 109: Two Pointers | Three Sum Problem | C++ Placement Course | Lecture 26.1

Lecture 110: Max Consecutive Ones | C++ Placement Course | Lecture 26.2

Lecture 111: Longest substring without repeating characters | C++ Placement Course | Lecture 26.3

Lecture 112: Binary Tree Introduction | C++ Placement Course | Lecture 27.1

Lecture 113: Binary Tree Traversals| Preorder, Inorder, Postorder Traversal | C++ Placement Course | Lecture 27.2

Lecture 114: Build Tree from Preorder and Inorder | C++ Placement Course | Lecture 27.3

Lecture 115: Build Tree Postorder and Inorder | C++ Placement Course | Lecture 27.4

Lecture 116: Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.5

Lecture 117: Count and Sum of Nodes | C++ Placement Course | Lecture 27.6

Lecture 118: Height and Diameter in Binary Tree | C++ Placement Course | Lecture 27.7

Lecture 119: Sum Replacement in Binary Tree | C++ Placement Course | Lecture 27.8

Lecture 120: Height Balanced Binary Tree | C++ Placement Course | Lecture 27.9

Lecture 121: Right View of Binary Tree | C++ Placement Course | Lecture 27.10

Lecture 122: Left View of Binary Trees | C++ Placement Course | Lecture 27.11

Lecture 123: Shortest Distance between 2 Nodes | C++ Placement Course | Lecture 27.12

Lecture 124: Flatten a Binary Tree | C++ Placement Course | Lecture 27.13

Lecture 125: Nodes at Distance K in Binary Tree | C++ Placement Course | Lecture 27.14

Lecture 126: Lowest Common Ancestor in Binary Tree | C++ Placement Course | Lecture 27.15

Lecture 127: Max Sum Path from One Node to Another in Binary Tree | C++ Placement Course | Lecture 27.16

Lecture 128: Binary Search Trees | Introduction & Build | C++ Placement Course | Lecture 28.1

Lecture 129: Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.2

Lecture 130: Construct Binary Search Tree from Preorder | C++ Placement Course | Lecture 28.3

Lecture 131: Check for Binary Search Tree | C++ Placement Course | Lecture 28.4

Lecture 132: Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

Lecture 133: Catalan Numbers Application | C++ Placement Course | Lecture 28.6

Lecture 134: Zig Zag Traversal Binary Search Tree | C++ Placement Course | Lecture 28.7

Lecture 135: Identical Binary Search Tree | C++ Placement Course | Lecture 28.8

Lecture 136: Largest Binary Search Tree in BT | C++ Placement Course | Lecture 28.10

Lecture 137: Recover Binary Search Tree | C++ Placement Course | Lecture 28.11

Lecture 138: Set & Multiset | Standard Template Library | C++ Placement Course | Lecture 28.12

Lecture 139: Place Elements to Maximise Minimum Distance | C++ Placement Course | Lecture 29.1

Lecture 140: Page Allocation Problem | C++ Placement Course | Lecture 29.2

Lecture 141: Painters Partition Problem | C++ Placement Course | Lecture 29.3

Lecture 142: Search in Sorted & Rotated Array | C++ Placement Course | Lecture 29.4

Lecture 143: Find the Peak Element | C++ Placement Course | Lecture 29.5

Lecture 144: Max Sum Subarray | Sliding Window Challenge | C++ Placement Course | Lecture 30.1

Lecture 145: Minimum Subarray Size | Sliding Window Challenge | C++ Placement Course | Lecture 30.2

Lecture 146: Form Number Divisible by 3 | Sliding Window Challenge | C++ Placement Course | Lecture 30.3

Lecture 147: Subarray with Palindromic Concatenation | C++ Placement Course | Lecture 30.4

Lecture 148: Perfect Numbers in Subarrays | C++ Placement Course | Lecture 30.5

Lecture 149: Heap Intro Final Export for Upload

Lecture 150: HeapsSort | C++ Placement Course | Lecture 31.2

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

CSE/IT SERIES

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

   Wednesday, July 15, 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 52: 13. Strings in C++ | Guaranteed Placement Course | Lecture 13

Lecture 53: 13.2 Strings Challenges | C++ Placement Course

Lecture 54: 14.1 BIT Manipulation in 11 minutes | C++ Placement Course

Lecture 55: 14.2 BIT Manipulation Challenges | C++ Placement Course

Lecture 56: 14.3 BIT Manipulation | Challenges - Part 2 | Questions asked by Top MNC's

Lecture 57: 15.1 Sieve of Eratosthenes | Challenge | C++ Placement Course

Lecture 58: 15.2 Inclusion- Exclusion Principle | GCD | C++ Placement Course

Lecture 59: 16.1 Recursion - Introduction | C++ Placement Course

Lecture 60: 16.2 Recursion - Challenges | C++ Placement Course

Lecture 61: 7 Best Problems on Recursion | Recursion in C++ | Placement Course | Lec 16.3

Lecture 62: Advanced Recursion Problems | C++ Placement Course | Lecture 16.4

Lecture 63: Recursion | Last Lecture on Advanced Problems | Lecture 16.4

Lecture 64: Backtracking - Rat in a Maze | C++ Placement Course | Lecture 18.1

Lecture 65: Permutation - Return all possible permutations | C++ Placement Course | Lecture 17

Lecture 66: N-Queen Problem - Backtracking | C++ Placement Course - 18.2

Lecture 67: Merge Sort | Code and Explanation | C++ Course - 19.1

Lecture 68: Quick Sort | Code and Explanation | C++ Course - 19.2

Lecture 69: Vectors and Pair | C++ Course - 19

Lecture 70: Count Sort | C++ Placement Course | Lecture 20.1

Lecture 71: DNF Sort | C++ Placement Course | Lecture 20.2

Lecture 72: Wave Sort | C++ Placement Course - 20.3

Lecture 73: Count Inversion - Merge Sort | C++ Placement Course - 19.3

Lecture 74: Object Oriented Programming in C++ | Important Concept | Lecture 21.1

Lecture 75: Inheritance in OOP's | C++ Placement Course | Lecture 21.3

Lecture 76: Polymorphism in Object Oriented Programming | C++ Placement Course Lecture 21.4

Lecture 77: Introduction to Linked List | C++ Placement Course | Lecture 22

Lecture 78: Deletion in Linked List | C++ Placement Course | Lecture 22.2

Lecture 79: Reverse a Linked List | C++ Placement Course | Lecture 22.3

Lecture 80: Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.4

Lecture 81: Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.4

Lecture 82: Doubly Linked List | Data Structures & Algorithms | C++ Placement Course | Lecture 22.6

Lecture 83: Append Last K Nodes of a Linked List | C++ Placement Course | Lecture 22.7

Lecture 84: Find Intersection point of 2 Linked List | Lecture 22.8

Lecture 85: Merge 2 Sorted Linked List | C++ Placement Course | Lecture 22.9

Lecture 86: Circular Linked List - C++ Placement Course | Lecture 22.10

Lecture 87: Put Even Position Nodes after Odd Position Nodes | C++ Placement Course | Lecture 22.11

Lecture 88: 2021 - Top 5 Programming Language for College Students 2021

Lecture 89: Time Complexity using Masters Theorem | C++ Placement Course | Lecture 16.5

Lecture 90: Stack Data Structure - Introduction | C++ Placement Course | Lecture 23.1

Lecture 91: Reverse a Sentence using Stacks | Stack Challenge | C++ Placement Course | Lecture 23.2

Lecture 92: Reverse a Stack | C++ Placement Course | Lecture 23.3

Lecture 93: Introduction to Prefix, Infix and Postfix | C++ Placement Course | Lecture 23.4

Lecture 94: Prefix Expression Evaluation | C++ Placement Course | Lecture 23.5

Lecture 95: Postfix Expression Evaluation | C++ Placement Course | Lecture 23.6

Lecture 96: Infix to Postfix - Stack Challenges | C++ Placement Course | Lecture 23.7

Lecture 97: Infix to Prefix | C++ Placement Course | Lecture 23.8

Lecture 98: Balanced Parenthesis | C++ Placement Course | Lecture 23.9

Lecture 99: Introduction to Queue Data Structure | C++ Placement Course | Lecture 24.1

Lecture 100: Linked List Implementation of Queues | C++ Placement Course | Lecture 24.2

Lecture 101: Queue using Stack | C++ Placement Course | Lecture 24.3

Lecture 102: Stack using Queue | C++ Placement Course | Lecture 24.4