Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Striver's A2Z DSA Course

By take U forward · English · Beginner

Complete DSA from basics to advanced — pair with the A2Z sheet on takeuforward.org.

A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.

What this course covers (100 videos)

  1. Don't watch my A2Z DSA Course (8:24)
  2. How to setup VS code for DSA and CP | Input / Output split format (8:51)
  3. C++ Basics in One Shot - Strivers A2Z DSA Course - L1 (1:26:27)
  4. Time and Space Complexity - Strivers A2Z DSA Course (35:16)
  5. Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course (1:22:06)
  6. Complete C++ STL in 1 Video | Time Complexity and Notes (1:07:37)
  7. Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course (1:03:20)
  8. Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course (22:46)
  9. Re 2. Problems on Recursion | Strivers A2Z DSA Course (22:04)
  10. Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course (18:14)
  11. Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course (19:48)
  12. Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course (16:45)
  13. Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course (1:00:06)
  14. Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course (43:44)
  15. Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course (49:43)
  16. Quick Sort For Beginners | Strivers A2Z DSA Course (35:17)
  17. Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video (43:26)
  18. Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2 (1:13:17)
  19. Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3 (38:00)
  20. Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays (41:42)
  21. 2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal (18:20)
  22. Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal (25:07)
  23. Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal (18:13)
  24. Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing (20:09)
  25. DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥 (9:11)
  26. Rearrange Array Elements by Sign | 2 Varieties of same Problem (21:37)
  27. Next Permutation - Intuition in Detail 🔥 | Brute to Optimal (28:15)
  28. Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course (11:53)
  29. Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal (23:11)
  30. Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal (30:07)
  31. Rotate Matrix/Image by 90 Degrees | Brute - Optimal (17:47)
  32. Spiral Traversal of a Matrix | Spiral Matrix (16:33)
  33. Count Subarray sum Equals K | Brute - Better -Optimal (24:09)
  34. Pascal Triangle | Finding nCr in minimal time (26:45)
  35. Majority Element II | Brute-Better-Optimal (26:58)
  36. 3 Sum | Brute - Better - Optimal with Codes (38:25)
  37. 4 Sum | Brute - Better - Optimal with Codes (28:47)
  38. Number of Subarrays with xor K | Brute - Better - Optimal (24:55)
  39. Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis (22:35)
  40. Merge Sorted Arrays Without Extra Space | 2 Optimal Solution (32:47)
  41. Find the Missing and Repeating Number | 4 Approaches 🔥 (42:24)
  42. Count Inversions in an Array | Brute and Optimal (24:17)
  43. Reverse Pairs | Hard Interview Question (32:26)
  44. Maximum Product Subarray - Best Intuitive Approach Discussed (20:27)
  45. BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases (33:27)
  46. BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil (32:26)
  47. BS-3. First and Last Occurrences in Array | Count occurrences in Array (25:28)
  48. BS-4. Search Element in Rotated Sorted Array - I (16:38)
  49. BS-5. Search Element in Rotated Sorted Array II (12:44)
  50. BS-6. Minimum in Rotated Sorted Array (17:08)
  51. BS-7. Find out how many times array has been rotated (5:01)
  52. BS-8. Single Element in Sorted Array (22:16)
  53. BS-9. Find Peak Element (32:53)
  54. BS-10. Finding Sqrt of a number using Binary Search (17:11)
  55. BS-11. Find the Nth root of an Integer (20:44)
  56. BS-12. Koko Eating Bananas (21:04)
  57. BS-13. Minimum days to make M bouquets | Binary Search (26:01)
  58. BS-14. Find the Smallest Divisor Given a Threshold | Binary Search (16:00)
  59. BS-15. Capacity to Ship Packages within D Days (20:36)
  60. BS-16. Kth Missing Positive Number | Maths + Binary Search (22:52)
  61. BS-17. Aggressive Cows | Binary Search Hard (26:44)
  62. BS-18. Allocate Books or Book Allocation | Hard Binary Search (27:29)
  63. BS 19. Painter's Partition and Split Array - Largest Sum (11:20)
  64. BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search (59:12)
  65. BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach (15:59)
  66. BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition (35:00)
  67. Bs-22. K-th element of two sorted arrays | Binary Search Approach (11:53)
  68. BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays (10:18)
  69. BS-24. Search in a 2D Matrix - I | Binary Search of 2D (15:42)
  70. BS-25. Search in a 2D Matrix - II | Binary Search on 2D (15:29)
  71. BS-26. Find Peak Element-II | Binary Search (20:02)
  72. BS-27. Median in a Row Wise Sorted Matrix (23:13)
  73. L1. Introduction to Trees | Types of Trees (9:50)
  74. L2. Binary Tree Representation in C++ (4:43)
  75. L3. Binary Tree Representation in Java (4:12)
  76. L4. Binary Tree Traversals in Binary Tree | BFS | DFS (9:59)
  77. L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation (7:29)
  78. L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation (7:07)
  79. L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation (5:31)
  80. L8. Level Order Traversal of Binary Tree | BFS | C++ | Java (8:57)
  81. L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack (6:50)
  82. L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack (11:14)
  83. L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree (4:09)
  84. L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees (12:33)
  85. L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees (10:57)
  86. L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java (8:05)
  87. L15. Check for Balanced Binary Tree | C++ | Java (12:30)
  88. L16. Diameter of Binary Tree | C++ | Java (13:47)
  89. L17. Maximum Path Sum in Binary Tree | C++ | Java (17:50)
  90. L18. Check it two trees are Identical or Not | C++ | Java (4:18)
  91. L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java (8:21)
  92. L20. Boundary Traversal in Binary Tree | C++ | Java (9:47)
  93. L21. Vertical Order Traversal of Binary Tree | C++ | Java (18:53)
  94. L22. Top View of Binary Tree | C++ | Java (10:30)
  95. L23. Bottom View of Binary Tree | C++ | Java (13:13)
  96. L24. Right/Left View of Binary Tree | C++ | Java (13:28)
  97. L25. Check for Symmetrical Binary Trees | C++ | Java (9:20)
  98. L26. Print Root to Node Path in Binary Tree | C++ | Java (11:00)
  99. L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java (14:09)
  100. L28. Maximum Width of Binary Tree | C++ | Java (22:41)

More DSA courses