Companies
Skip to content
    
All playlists

Love Babbar

Love Babbar DSA Interview Preparation Playlist

The Complete C++ Placement DSA Course by Love Babbar is your comprehensive guide to cracking coding interviews. It covers fundamental C++ concepts, including arrays, searching, and sorting, before diving deep into advanced Data Structures like Linked Lists, Stacks, Queues, Binary Trees, Binary Search Trees, Heaps, Hashmaps, and Tries. The course culminates with essential algorithms in Recursion, Backtracking, Graphs, and Dynamic Programming, ensuring you're fully prepared for technical roles.

141 videos14 sectionsWatch on YouTube

0%

0/141

Overall progress

0 / 141

What this playlist covers

Love Babbar DSA Interview Preparation Playlist by Love Babbar runs to 141 videos across 14 sections: C++ Basics, Flowcharts & Core Concepts, Arrays & Searching/Sorting, Pointers & Dynamic Memory Allocation, Recursion & Backtracking, Object-Oriented Programming (OOPs), Linked Lists, Stacks & Queues and Binary Trees, BST & Heaps, plus 6 more. Tick each video off as you finish it — progress is saved in this browser, and syncs across devices once you sign in. Nothing here is gated and there is no signup to start.

A genuine beginner's C++ and DSA course — starts further back than anything else here, and leaves you to find your own practice.

Who it is for

Someone in their second or third year who has not written much code yet. It opens with flowcharts and C++ syntax, which sounds slow and is exactly right if that is where you are. Anyone already comfortable in C++ should start elsewhere.

How to work through it

  1. 01C++ Basics, Flowcharts & Core Concepts (10) and Arrays & Searching/Sorting (15) — the strongest stretch of the course and the reason to pick it.
  2. 02Pointers & Dynamic Memory Allocation (5) before linked lists. Skipping this is why linked lists confuse people.
  3. 03Recursion & Backtracking (11), then Linked Lists (10), Stacks & Queues (8).
  4. 04Binary Trees, BST & Heaps (16), Hashmaps & Tries (4), Graphs (17).
  5. 05Dynamic Programming (14) near the end. Treat Advanced Topics (24) as optional — it is a grab bag rather than a planned section.

What it does well

  • Starts from actual zero. Flowcharts, syntax, memory — the parts most DSA courses assume and most beginners are missing.
  • Pointers and dynamic memory get their own section before linked lists, which is the correct ordering and rarer than it should be.
  • Explanations are slow and repetitive in the way that helps when a concept is genuinely new.

Where it falls short

  • Only 5 of 141 lectures link to a practice problem — by far the weakest practice linkage of any playlist here. Pair it with a sheet from day one or you will finish having watched a course and solved nothing.
  • Greedy gets 3 videos. That is not coverage, it is a mention.
  • The 24-video Advanced Topics section is unstructured leftovers, not a curriculum. Do not treat finishing it as a milestone.
  • The pacing that makes it good for beginners makes it slow if you are not one. 141 videos is a lot of runway to cover ground you already have.

What to pair it with

  • Blind 75 — The practice this course does not link. Start it alongside, not after.
  • Striver's A2Z DSA Course — The natural next course once the fundamentals are in — better structured and problem-linked throughout.
  • Core subjects — OOP gets 2 videos here; the dedicated OOP playlists cover what interviews actually ask.

Other playlists worth comparing

Shradha Khapra DSA Interview Preparation PlaylistShradha Khapra · 122 videosComprehensive C++ DSA series by Shradha Khapra covering basics through advanced data structures and algorithms.Rohit Negi DSA Interview Preparation PlaylistRohit Negi · 148 videosCoder Army's full C++ DSA playlist — interview-focused walkthroughs from language basics through graphs and dynamic programming.Striver's A2Z DSA Coursetake U forward · 314 videosThe most structured free DSA course available — pattern-first, with a problem after every concept.