Two Pointers | Advanced Problem Solving in Arrays | Lecture 18 | Java and DSA Foundation

We are almost towards the end of the arrays-based practice problems and kudos to the efforts you are putting into this learning journey! Let us move ahead with the same zeal and keep practicing all the concepts and problems taught till now. In this class, Manvi mam will cover a bit of advanced implementation of arrays i.e. problems based on two pointers approach. If you are aiming for a good internship or placement, this is surely going to help you. See you in the class! Are you finding the classes helpful? Stay tuned for more! Access the notes and assignments for this class for free at : http://bit.ly/3Xm4EKD If you are joining us late, to know more about PWSkills & plans : Watch the Orientation Video:    • C++ DSA and Java DSA - Orientation Session   Watch the Launch Video:    • @CollegeWallahbyPWSkills THIS REVOLUTION W...   TIME STAMPS: 00:00 Introduction 00:33 Recap of the last lecture 02:39 Problems based on two pointers 03:02 Sort an array consisting of only 0s and 1s 06:13 Code 10:34 Alternate approach 21:06 Code 23:28 Dry run 27:02 In an array 'a' move all even integers at the beginning followed by all odd integers 32:03 Code 35:10 For an array 'a' sorted in non-decreasing order, return an array of squares of each number sorted in non-decreasing order 46:20 Code 51:20 Dry run 1:00:12 Summary of lecture ▶️ PW Skills Website - https://pwskills.com ▶️ PW Skills Instagram -   / pwcollegewallah   ▶️ PW Skills LinkedIn Channel - ▶️ PW Skills Telegram Channel- https://t.me/SkillsPW