Companies
Skip to content
    
All playlists

Rohit Negi

Rohit Negi DSA Interview Preparation Playlist

The Complete C++ Placement DSA Course by Rohit Negi 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.

148 videos16 sectionsWatch on YouTube

0%

0/148

Overall progress

0 / 148

What this playlist covers

Rohit Negi DSA Interview Preparation Playlist by Rohit Negi runs to 148 videos across 16 sections: Fundamentals & Programming Basics, Pattern Printing, Arrays & Vectors, Sorting & Binary Search, Strings & Advanced STL, Recursion & Backtracking, Object Oriented Programming (OOPs) & More and Linked List, plus 8 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 well-paced, current C++ placement course that runs out of steam at exactly the topics interviews care most about.

Who it is for

Someone who wants a single recent course in Hindi-English with a working knowledge of C++ assumed but not required. Good first course; needs a second one for the hard topics.

How to work through it

  1. 01Fundamentals & Programming Basics (9) and Pattern Printing (4) — skippable if you can already code, and worth skipping.
  2. 02Arrays & Vectors (11), Sorting & Binary Search (10), Strings & Advanced STL (9). The STL coverage here is more practical than most.
  3. 03Recursion & Backtracking (17) — the strongest section in the course, and the one to slow down on.
  4. 04OOPs & More (15) is unusually thorough for a DSA course and doubles as interview prep in its own right.
  5. 05Linked List (11), Stacks (8), Queues (4), Binary Trees (15), BST (10), Heaps (7), Hashing & Tries (3).
  6. 06Graphs (10) and Dynamic Programming (5) come last and are thin — plan to cover both elsewhere.

What it does well

  • 17 videos on recursion and backtracking, which is where most beginners actually get stuck, and it is taught patiently.
  • The 15-video OOP section covers ground you would otherwise need a separate playlist for.
  • Recent, consistently produced, and paced for people watching around college.

Where it falls short

  • Dynamic Programming gets 5 videos out of 148. That is not a DP section. Every serious interview loop tests DP and you will not be ready from this alone.
  • Graphs gets 10, which is similarly light — Striver spends 56 on the same material.
  • 40 of 148 lectures link a practice problem, so most of your practice has to come from somewhere else.

What to pair it with

Other playlists worth comparing

Striver's A2Z DSA Coursetake U forward · 314 videosThe most structured free DSA course available — pattern-first, with a problem after every concept.NeetCode 150NeetCode · 150 videosConcise 10–15 minute solutions for every problem in the NeetCode 150, grouped by pattern.Aditya Verma DSA PatternsAditya Verma · 223 videosEvery major DSA topic taught as a set of recognisable patterns rather than isolated problems — the definitive treatment of DP and recursion.