Strivers-A2Z-DSA
Learn Strivers A2Z-DSA Course | DSA Playlist | Placements by take U forward with comprehensive video tutorials and hands-on projects.
Meet Your Instructor: Take-U-Forward
Take U Forward, led by Striver (Raj Vikramaditya), is a premier platform dedicated to mastering data structures, algorithms, and interview preparation. With a proven track record of helping hundreds of thousands of students land dream jobs at top tech companies, Take U Forward provides comprehensive, well-structured courses that cover everything from basic problem-solving to advanced algorithmic techniques. The platform's signature A2Z DSA Course offers a complete roadmap from fundamentals to expert-level problem solving, making it one of the most trusted resources in the Indian tech community.
Data Structures and AlgorithmsCompetitive ProgrammingTechnical Interview Preparation
Experience: 7+ years
Students Helped: 300,000+
Specialization: DSA & Interview Prep for Tech Careers
Course Overview
This comprehensive course is designed to take you from foundational concepts to advanced implementation in dsa & interview prep for tech careers. You'll learn through comprehensive roadmap-based learning with step-by-step problem-solving, curated playlists, and structured progression from basics to advanced concepts, building real-world projects that demonstrate your skills and enhance your portfolio.
Whether you're looking to start a new career in technology or advance your current skills, this course provides the structured learning path and practical experience you need to succeed in today's competitive tech industry.
Course Curriculum
Master A-Z data structures and algorithms for placements
Solve 450+ coding problems from basic to advanced level
Learn optimal approaches and time-space complexity analysis
Master competitive programming and interview preparation
Understand problem-solving patterns and techniques
Build strong foundation for technical interviews
Course Content
1
Don't watch my A2Z DSA Course
2
How to setup VS code for DSA and CP | Input / Output split format
3
C++ Basics in One Shot - Strivers A2Z DSA Course - L1
4
Time and Space Complexity - Strivers A2Z DSA Course
5
Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course
6
Complete C++ STL in 1 Video | Time Complexity and Notes
7
Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course
8
Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course
9
Re 2. Problems on Recursion | Strivers A2Z DSA Course
10
Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course
11
Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course
12
Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course
13
Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course
14
Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course
15
Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course
16
Quick Sort For Beginners | Strivers A2Z DSA Course
17
Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video
18
Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2
19
Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
20
Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays
21
2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal
22
Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal
23
Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal
24
Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing
25
DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥
26
Rearrange Array Elements by Sign | 2 Varieties of same Problem
27
Next Permutation - Intuition in Detail 🔥 | Brute to Optimal
28
Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course
29
Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal
30
Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal
31
Rotate Matrix/Image by 90 Degrees | Brute - Optimal
32
Spiral Traversal of a Matrix | Spiral Matrix
33
Count Subarray sum Equals K | Brute - Better -Optimal
34
Pascal Triangle | Finding nCr in minimal time
35
Majority Element II | Brute-Better-Optimal
36
3 Sum | Brute - Better - Optimal with Codes
37
4 Sum | Brute - Better - Optimal with Codes
38
Number of Subarrays with xor K | Brute - Better - Optimal
39
Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis
40
Merge Sorted Arrays Without Extra Space | 2 Optimal Solution
41
Find the Missing and Repeating Number | 4 Approaches 🔥
42
Count Inversions in an Array | Brute and Optimal
43
Reverse Pairs | Hard Interview Question
44
Maximum Product Subarray - Best Intuitive Approach Discussed
45
BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases
46
BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil
47
BS-3. First and Last Occurrences in Array | Count occurrences in Array
48
BS-4. Search Element in Rotated Sorted Array - I
49
BS-5. Search Element in Rotated Sorted Array II
50
BS-6. Minimum in Rotated Sorted Array
51
BS-7. Find out how many times array has been rotated
52
BS-8. Single Element in Sorted Array
53
BS-9. Find Peak Element
54
BS-10. Finding Sqrt of a number using Binary Search
55
BS-11. Find the Nth root of an Integer
56
BS-12. Koko Eating Bananas
57
BS-13. Minimum days to make M bouquets | Binary Search
58
BS-14. Find the Smallest Divisor Given a Threshold | Binary Search
59
BS-15. Capacity to Ship Packages within D Days
60
BS-16. Kth Missing Positive Number | Maths + Binary Search
61
BS-17. Aggressive Cows | Binary Search Hard
62
BS-18. Allocate Books or Book Allocation | Hard Binary Search
63
BS 19. Painter's Partition and Split Array - Largest Sum
64
BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search
65
BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach
66
BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition
67
Bs-22. K-th element of two sorted arrays | Binary Search Approach
68
BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays
69
BS-24. Search in a 2D Matrix - I | Binary Search of 2D
70
BS-25. Search in a 2D Matrix - II | Binary Search on 2D
71
BS-26. Find Peak Element-II | Binary Search
72
BS-27. Median in a Row Wise Sorted Matrix
73
L1. Introduction to Trees | Types of Trees
74
L2. Binary Tree Representation in C++
75
L3. Binary Tree Representation in Java
76
L4. Binary Tree Traversals in Binary Tree | BFS | DFS
77
L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation
78
L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation
79
L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation
80
L8. Level Order Traversal of Binary Tree | BFS | C++ | Java
81
L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack
82
L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack
83
L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree
84
L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees
85
L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees
86
L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java
87
L15. Check for Balanced Binary Tree | C++ | Java
88
L16. Diameter of Binary Tree | C++ | Java
89
L17. Maximum Path Sum in Binary Tree | C++ | Java
90
L18. Check it two trees are Identical or Not | C++ | Java
91
L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java
92
L20. Boundary Traversal in Binary Tree | C++ | Java
93
L21. Vertical Order Traversal of Binary Tree | C++ | Java
94
L22. Top View of Binary Tree | C++ | Java
95
L23. Bottom View of Binary Tree | C++ | Java
96
L24. Right/Left View of Binary Tree | C++ | Java
97
L25. Check for Symmetrical Binary Trees | C++ | Java
98
L26. Print Root to Node Path in Binary Tree | C++ | Java
99
L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java
100
L28. Maximum Width of Binary Tree | C++ | Java
101
L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java
102
L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java
103
L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java
104
L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java
105
L33. Requirements needed to construct a Unique Binary Tree | Theory
106
L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java
107
L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java
108
L36. Serialize and De-serialize Binary Tree | C++ | Java
109
L37. Morris Traversal | Preorder | Inorder | C++ | Java
110
L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java
111
L39. Introduction to Binary Search Tree | BST
112
L40. Search in a Binary Search Tree | BST | C++ | Java
113
L41. Ceil in a Binary Search Tree | BST | C++ | Java
114
L42. Floor in a Binary Search Tree | BST | C++ | Java
115
L43. Insert a given Node in Binary Search Tree | BST | C++ | Java
116
L44. Delete a Node in Binary Search Tree | BST | C++ | Java
117
L45. K-th Smallest/Largest Element in BST
118
L46. Check if a tree is a BST or BT | Validate a BST
119
L47. LCA in Binary Search Tree
120
L48. Construct a BST from a preorder traversal | 3 Methods
121
L49. Inorder Successor/Predecessor in BST | 3 Methods
122
L50. Binary Search Tree Iterator | BST | O(H) Space
123
L51. Two Sum In BST | Check if there exists a pair with Sum K
124
L52. Recover BST | Correct BST with two nodes swapped
125
L53. Largest BST in Binary Tree
126
G-1. Introduction to Graph | Types | Different Conventions Used
127
G-2. Graph Representation in C++ | Two Ways to Represent
128
G-3. Graph Representation in Java | Two Ways to Represent
129
G-4. What are Connected Components ?
130
G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs
131
G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs
132
G-7. Number of Provinces | C++ | Java | Connected Components
133
G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java
134
G-9. Flood Fill Algorithm | C++ | Java
135
G-10. Rotten Oranges | C++ | Java
136
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
137
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
138
G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java
139
G-14. Surrounded Regions | Replace O's with X's | C++ | Java
140
G-15. Number of Enclaves | Multi-source BFS | C++ | Java
141
G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
142
G-17. Bipartite Graph | BFS | C++ | Java
143
G-18. Bipartite Graph | DFS | C++ | Java
144
G-19. Detect cycle in a directed graph using DFS | Java | C++
145
G-20. Find Eventual Safe States - DFS
146
G-21. Topological Sort Algorithm | DFS
147
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
148
G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS
149
G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort
150
G-25. Find Eventual Safe States - BFS - Topological Sort
151
G-26. Alien Dictionary - Topological Sort
152
G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
153
G-28. Shortest Path in Undirected Graph with Unit Weights
154
G-29. Word Ladder - I | Shortest Paths
155
G-30. Word Ladder - 2 | Shortest Paths
156
G-31. Word Ladder - 2 | Optimised Approach for Leetcode
157
G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1
158
G-33. Dijkstra's Algorithm - Using Set - Part 2
159
G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3
160
G-35. Print Shortest Path - Dijkstra's Algorithm
161
G-36. Shortest Distance in a Binary Maze
162
G-37. Path With Minimum Effort
163
G-38. Cheapest Flights Within K Stops
164
G-39. Minimum Multiplications to Reach End
165
G-40. Number of Ways to Arrive at Destination
166
G-41. Bellman Ford Algorithm
167
G-42. Floyd Warshall Algorithm
168
G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance
169
G-44. Minimum Spanning Tree - Theory
170
G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java
171
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
172
G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java
173
G-48. Number of Provinces - Disjoint Set
174
G-49. Number of Operations to Make Network Connected - DSU
175
G-50. Accounts Merge - DSU
176
G-51. Number of Islands - II - Online Queries - DSU
177
G-52. Making a Large Island - DSU
178
G-53. Most Stones Removed with Same Row or Column - DSU
179
G-54. Strongly Connected Components - Kosaraju's Algorithm
180
G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time
181
G-56. Articulation Point in Graph
182
DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques
183
DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations
184
DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP
185
DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question
186
DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences
187
DP 6. House Robber 2 | 1D DP | DP on Subsequences
188
DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |
189
DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥
190
DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles
191
DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS
192
DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS
193
DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids
194
DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids
195
DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them
196
DP 15. Partition Equal Subset Sum | DP on Subsequences
197
Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences
198
DP 17. Counts Subsets with Sum K | Dp on Subsequences
199
DP 18. Count Partitions With Given Difference | Dp on Subsequences
200
DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences
201
DP 20. Minimum Coins | DP on Subsequences | Infinite Supplies Pattern
202
DP 21. Target Sum | DP on Subsequences
203
DP 22. Coin Change 2 | Infinite Supply Problems | DP on Subsequences
204
DP 23. Unbounded Knapsack | 1-D Array Space Optimised Approach
205
DP 24. Rod Cutting Problem | 1D Array Space Optimised Approach
206
Dp 25. Longest Common Subsequence | Top Down | Bottom-Up | Space Optimised | DP on Strings
207
DP 26. Print Longest Common Subsequence | Dp on Strings
208
DP 27. Longest Common Substring | DP on Strings 🔥
209
DP 28. Longest Palindromic Subsequence
210
DP 29. Minimum Insertions to Make String Palindrome
211
DP 30. Minimum Insertions/Deletions to Convert String A to String B
212
DP 31. Shortest Common Supersequence | DP on Strings
213
DP 32. Distinct Subsequences | 1D Array Optimisation Technique 🔥
214
DP 33. Edit Distance | Recursive to 1D Array Optimised Solution 🔥
215
DP 34. Wildcard Matching | Recursive to 1D Array Optimisation 🔥
216
DP 36. Buy and Sell Stock - II | Recursion to Space Optimisation
217
DP 37. Buy and Sell Stocks III | Recursion to Space Optimisation
218
DP 38. Buy and Stock Sell IV | Recursion to Space Optimisation
219
DP 39. Buy and Sell Stocks With Cooldown | Recursion to Space Optimisation
220
DP 40. Buy and Sell Stocks With Transaction Fee | Recursion to Space Optimisation
221
DP 41. Longest Increasing Subsequence | Memoization
222
DP 42. Printing Longest Increasing Subsequence | Tabulation | Algorithm
223
DP 43. Longest Increasing Subsequence | Binary Search | Intuition
224
DP 44. Largest Divisible Subset | Longest Increasing Subsequence
225
DP 45. Longest String Chain | Longest Increasing Subsequence | LIS
226
DP 46. Longest Bitonic Subsequence | LIS
227
DP 47. Number of Longest Increasing Subsequences
228
DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥
229
DP 49. Matrix Chain Multiplication | Bottom-Up | Tabulation
230
DP 50. Minimum Cost to Cut the Stick
231
DP 51. Burst Balloons | Partition DP | Interactive G-Meet Session Update
232
DP 52. Evaluate Boolean Expression to True | Partition DP
233
DP 53. Palindrome Partitioning - II | Front Partition 🔥
234
DP 54. Partition Array for Maximum Sum | Front Partition 🔥
235
DP 55. Maximum Rectangle Area with all 1's | DP on Rectangles
236
DP 56. Count Square Submatrices with All Ones | DP on Rectangles 🔥
237
L1. Introduction to LinkedList | Traversal | Length | Search an Element
238
L2. Deletion and Insertion in LL | 8 Problems
239
L3. Introduction to Doubly LinkedList | Insertions and Deletions
240
L4. Reverse a DLL | Multiple Approaches
241
L5. Add 2 numbers in LinkedList | Dummy Node Approach
242
L6. Odd Even Linked List | Multiple Approaches
243
L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches
244
L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches
245
L9. Reverse a LinkedList | Iterative and Recursive
246
L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches
247
L11. Add 1 to a number represented by LinkedList
248
L12. Find the intersection point of Y LinkedList
249
L13. Find the middle element of the LinkedList | Multiple Approaches
250
L14. Detect a loop or cycle in LinkedList | With proof and Intuition
251
L15. Find the length of the Loop in LinkedList
252
L16. Delete the middle node of the LinkedList
253
L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches
254
L18. Delete all occurrences of a Key in DLL
255
L19. Find all Pairs with given Sum in DLL
256
L20. Remove duplicates from sorted DLL
257
L21. Reverse Nodes in K Group Size of LinkedList
258
L22. Rotate a LinkedList
259
L23. Merge two sorted Linked Lists
260
L24. Flattening a LinkedList | Multiple Approaches with Dry Run
261
L25. Merge K Sorted Lists | Multiple Approaches
262
L26. Sort a Linked List | Merge Sort and Brute Force
263
L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers
264
L28. Design a Browser History | LinkedList Implementation
265
L2. Print all Divisors of a Number | Maths Playlist
266
L3. Check if a Number if Prime or not | Maths Playlist
267
L4. Print all prime factors of a Number | Maths Playlist
268
L5. Power Exponentiation | Maths Playlist
269
L6. Sieve of Eratosthenes | Maths Playlist
270
L7. Count Prime in a range L-R | Maths Playlist
271
L8. Smallest Prime Factor (SPF) | Prime Factorisation | Query Based Problem | Maths Playlist
272
L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns
273
L2. Maximum Points You Can Obtain from Cards | 2 Pointers and Sliding Window Playlist
274
L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist
275
L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist
276
L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist
277
L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist
278
L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist
279
L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist
280
L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist
281
L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist
282
L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist
283
L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist
284
L1. Assign Cookies | Greedy Algorithm Playlist
285
L3. Shortest Job First (or SJF) CPU Scheduling
286
L2. Lemonade Change | Greedy Algorithm Playlist
287
L4. Jump Game - I | Greedy Algorithm Playlist
288
L5. Jump Game - II | Greedy Algorithm Playlist
289
L6. Job Sequencing Problem | Greedy Algorithm Playlist
290
L7. N Meeting in One Room | Greedy Algorithms Playlist
291
L8. Non Overlapping Intervals | Greedy Algorithms Playlist
292
L9. Insert Intervals | Greedy Algorithms Playlist
293
L10. Minimum number of platforms required in a railway station
294
L11. Valid Parenthesis String | Multiple Approaches
295
L13. Fractional Knapsack Algorithm
296
L12. Candy | Slope Approach Intuition Based
297
L1. Introduction to Stack and Queue | Implementation using Data Structures
298
L2. Check for Balanced Parentheses | Stack and Queue
299
L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist
300
L4. Implement Min Stack | Stack and Queue Playlist
301
L5. Next Greater Element | Stack and Queue Playlist
302
L6. Next Greater Element - II | Stack and Queue Playlist
303
L7. Previous Smaller Element | Stack and Queue Playlist
304
L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist
305
L9. Sum of Subarray Minimum | Stack and Queue Playlist
306
L10. Sum of subarray ranges | Stack and Queue Playlist
307
L11. Aestroid Collisions | Stack and Queue Playlist
308
L12. Largest Rectangle in Histogram | Stack and Queue Playlist
309
L13. Maximal Rectangle | Stack and Queue Playlist
310
L14. Remove K Digits | Stack and Queue Playlist
311
L15. Stock Span Problem | Stack and Queue Playlist
312
L16. Sliding Window Maximum | Stack and Queue Playlist
313
L17. The Celebrity Problem | Stack and Queue Playlist
314
L18. Implement LRU Cache
315
Implement LFU cache in C++/Java | Leetcode(Hard)
316
Major Announcement | TUF+ V2 and System Design Playlist 🔥
Requirements
- Basic programming knowledge in C++/Java/Python
- Understanding of basic data structures (arrays, strings)
- Internet connection for video streaming
- Code editor (VS Code recommended) for practice
- Commitment to solve 450+ coding problems systematically
Course Features
Lifetime Access
Certificate of Completion
Mobile and Desktop Access
Downloadable Resources
Community Support
₹0
View Course4.9 (413 reviews)
Course Details
Duration13h 1m
LevelIntermediate
LanguageHindi
Students863
Updated2025-10-20
Similar Courses in this Category
Namaste DSA
From zero to hero in Data Structures & Algorithms. Structured, hands-on, problem-solving heavy course which aims at giving you huge conceptual clarity and interview-readiness. :contentReference[oaicite:2]{index=2}
Akshay Saini4.9
Rohit-Negi-DSA
Learn Rohit Negi DSA Course with comprehensive video tutorials and hands-on projects.
Rohit Negi5.0
SIGMA-9-CPP
SIGMA-9 CPP DSA by Apna college video tutorials and hands-on projects.
Apna College4.9
SIGMA-9-JAVA
Learn SIGMA - 9 JAVA DSA by Apna college with comprehensive video tutorials and hands-on projects.
Apna College4.5
Ready to Start Learning?
Join thousands of students who have already enrolled in this course.
Start Learning Now