UnlockedCoding
Home
Categories
All Courses
← Back to dsa Courses
Your browser does not support the video tag.
Rohit-Negi-DSA
Learn Rohit Negi DSA Course with comprehensive video tutorials and hands-on projects.
Course Videos (81)
Lecture 01 : Introduction To Programming
Lecture 02: Introduction to C++ and Write First Code
Lecture 03:If-Else Condition, Operators and Basic of Loops
Lecture 04:For Loop + While Loop + Pattern Printing
Lecture 05:Pattern Printing+WhileLoop+Basic Maths
Lecture 06:Decimal to Binary + Functions
Lecture 07:Function + Array
Lecture 08:Basic Questions on Array
Lecture 09:Print array Element + Sorting Algorithm
Lecture 10:Sorting Algorithm( Selection, Bubble, Insertion)
Lecture 11:Time and Space Complexity
Lecture 12:Time And Space Complexity Part2
Lecture 13:Binary Search
Lecture 14:Binary Search in Detail
Lecture 15:Data Structure And Algorithm
Lecture 16:Two Pointer
Lecture 17:2-D Array in detail
Lecture 18:2D Array+ Vector
Lecture 19:Data Structure And Algorithm
Lecture 20:String (Hard Questions)
Lecture 21:String (KMP Algorithm)
Lecture 22:Pointer in C++
Lecture 23:Pointer in Advance
Lecture 24 :2D array + Recursion
Lecture 25:Recursion
Lecture 26:Merge Sort+ Quick Sort
Lecture 27:Quick sort + Recursion
Lecture 28:Recursion + Robber House
Lecture 29:Recursion + Pallindrome+Permutation
Lecture 30:Object Oriented Programming
Lecture 31:Linked List
Lecture 32:Linked List
Lecture 33:Linked List Advance
Lecture 34:Linked List Advance
Lecture 35:Stack and its implementation
Lecture 36:Stack Medium level
Lecture 37:Stack Hard Question
Lecture 38:Queue
Lecture 39:Queue Advance
Lecture 40:Trees
Lecture 41: Tree Traversal + View
Lecture 42: Tree traversal
Lecture 43: Tree More question
Lecture 44: Tree Hard
Lecture 45: Binary Search Tree
Lecture 46: Binary search Tree
Lecture 47: BST Hard
Lecture 48: Balance Binary Search Tree
Lecture 49: AVL and Heap
Lecture 50: Heap
Lecture 51: Heap
Lecture 52: Heap Hard
Lecture 53: Heap hard Question
Lecture 54: Hashing
Lecture 55: Hashing and maps
Lecture 56: Hashing and Maps
Lecture 57: Graphs
Lecture 58: Graphs
Lecture 59: Detect Cycle in Graphs
Lecture 60: BFS in Advance
Lecture 61: Directed Graph Cycle + Topological sort
Lecture 62: Shortest Distance + Spanning Tree
Lecture 63: Graphs Advanced
Lecture 64: Prims and Kruskal Algorithm
Lecture 65: Strongly Connected component + Bellmonford
Lecture 66: Bellman Ford + floyd WaRSHAL
Lecture 67: Graph Advance Euler
Lecture 68: Articulation Point
Lecture 69: Dynamic Programming
Lecture 70: House Robber Coin change
Lecture 71: Knapsack problem
Lecture 72: Knapsack full
Lecture 73: LCS + Pallindrome
Lecture 74: DP Longest Increasing Subsequence || LCS || LAP
Lecture 75: Grid + Stock
Lecture 76: Stock+How to define row and column in dp
Lecture 77: Stock and player game
Lecture 78: DP Advance Question
Lecture 79: Trie and it's Implementation
Lecture 80: Segment Tree
Special Message for Students