Strivers A2Z-DSA Course | DSA Playlist | Placements

This playlist is not in C++ or Java or Python, it covers DSA and we write pseudocode, only one video is in C++, for the basics, but apart from that we cover everything in depth. Follow the website takeuforward.org for a structured learning, and not the playlist.

Curated by: take U forward (316 videos)

---

Tracks in this Playlist

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