technifyedWeekly list

take U forward

Arrays Playlist | Basics to Advanced | C++/Java/Python | DSA | Placements

via YouTube Video playlist

Videos in this playlist 28

  1. Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video
  2. Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2
  3. Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
  4. Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays
  5. 2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal
  6. Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal
  7. Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal
  8. Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing
  9. Rearrange Array Elements by Sign | 2 Varieties of same Problem
  10. DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥
  11. Next Permutation - Intuition in Detail 🔥 | Brute to Optimal
  12. Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course
  13. Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal
  14. Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal
  15. Rotate Matrix/Image by 90 Degrees | Brute - Optimal
  16. Spiral Traversal of a Matrix | Spiral Matrix
  17. Count Subarray sum Equals K | Brute - Better -Optimal
  18. Pascal Triangle | Finding nCr in minimal time
  19. Majority Element II | Brute-Better-Optimal
  20. 3 Sum | Brute - Better - Optimal with Codes
  21. 4 Sum | Brute - Better - Optimal with Codes
  22. Number of Subarrays with xor K | Brute - Better - Optimal
  23. Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis
  24. Merge Sorted Arrays Without Extra Space | 2 Optimal Solution
  25. Find the Missing and Repeating Number | 4 Approaches 🔥
  26. Count Inversions in an Array | Brute and Optimal
  27. Reverse Pairs | Hard Interview Question
  28. Maximum Product Subarray - Best Intuitive Approach Discussed

Advantages and disadvantages

Advantages

  • Free and complete: every lecture is in the playlist, in order.
  • Watch at 1.5x, skip what you know, rewatch what you don't.
  • The DSA sheet and videos many students follow for placement interviews.
  • 3,839,306 views, so help and notes are easy to find.
  • Completely free.
  • Self-paced: start any time.
  • A clear syllabus (28 videos) you can see before you start.
  • Start watching right away, no sign-up.

Disadvantages

  • No certificate, deadlines or graded work.
  • Quality and depth vary: check that the playlist is finished before you start.
  • Assumes you already know one programming language well.
  • No certificate.
  • No graded assignments or feedback.

Some points apply to every course of this kind; see how we rank.

Free

  • Free: Watch on YouTube, no account needed.
  • Certificate: None. Code or take notes along to make it stick.

take U forward is in Tier 3: good universities, respected companies, nonprofits and well-known teachers of our institution ranking (82/100). The go-to DSA and placement series.

Similar courses

Compare these

Massachusetts Institute of Technology

MIT 6.006 Introduction to Algorithms, Fall 2011

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…

  • Free video
  • 47 videos, 42 hours

Massachusetts Institute of Technology

MIT 6.006 Introduction to Algorithms, Spring 2020

Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This course is an introduction to mathematical modeling of computational problems, as…

  • Free video
  • 32 videos, 35 hours

Massachusetts Institute of Technology

MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow;…

  • Free video
  • 23 videos, 30 hours

Massachusetts Institute of Technology

MIT 6.01SC Introduction to EECS I

Instructor: Dennis Freeman, Kendra Pugh This course provides an integrated introduction to electrical engineering and computer science, including modern software engineering, linear systems analysis, electronic circuits, and decision-making. The lecture videos provide an overview of each topic, whi…

  • Free video
  • 27 videos, 17 hours

Massachusetts Institute of Technology

MIT 6.046J Design and Analysis of Algorithms, Spring 2015

View the complete course: http://ocw.mit.edu/6-046JS15 Instructors: Erik Demaine, Srinivas Devadas, Nancy Ann Lynch 6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.…

  • Free video
  • 34 videos, 39 hours

Massachusetts Institute of Technology

MIT 6.851 Advanced Data Structures, Spring 2012

View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Videos of 6.851 Lectures Spring 2012 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

  • Free video
  • 22 videos, 30 hours