2835. Minimum Operations to Form Subsequence With Target Sum | Weekly Leetcode 360

Segment Trees Series - https://bit.ly/segment-trees Part 1 - https://youtu.be/U5cedpBSSHg Part 2 - https://youtu.be/tcsPJFKoNNY Part 3 - https://youtu.be/fmqNWp17eS0 Part 4 - https://youtu.be/Tqwq-LJUZ9w Part 5 - https://youtu.be/sttlq6EnwZo Part 6 - https://youtu.be/QbwvIY0ri28 Part 7 - https://youtu.be/7WRp1UMVtzM Part 8 - https://youtu.be/L2R2Ujxuou8 Part 9 - https://youtu.be/GozeRglQJuc Segment Trees Problems Playlist - https://www.youtube.com/playlist?list=PL9TOCZErLZcN4eFIBvFNJ3SirAeMFzTfz ************************************************* Contest Link - https://leetcode.com/contest/weekly-contest-360 Problem Link - https://leetcode.com/contest/weekly-contest-360/problems/minimum-operations-to-form-subsequence-with-target-sum/ Solution - https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum/solutions/3965427/video-explanation-intutitive-step-by-step-solution/ ************************************************* Timestamps - 00:00 - Agenda 00:30 - Problem Description 03:25 - Removing the ordering requirements 04:25 - Whether the given array contains a sub-sequence or not 08:00 - [Sample 1] What if the required bit is not set in target? 11:30 - [Sample 2] What if remaining elements are not sufficient? 16:10 - Recap of the solution 17:10 - [Sample 3] Another edge case 20:30 - Is it always possible to make 2^X from smaller elements if "sum is greater than 2^X"? 22:55 - Code Walkthrough ************************************************* Interview Experiences Playlists - Microsoft - https://www.youtube.com/playlist?list=PL9TOCZErLZcOsCBZPQ3uIMzak6gQWG_Kp Amazon - https://youtube.com/playlist?list=PL9TOCZErLZcMFSmxoEpNBxvQfWOgRmsfX D.E.Shaw - https://youtube.com/playlist?list=PL9TOCZErLZcM8nwVeW4d7JyxcpH175IZ1 Linkedin - https://www.youtube.com/playlist?list=PL9TOCZErLZcMN56ITB1IkNUs10QnaEyAe Facebook - https://youtube.com/playlist?list=PL9TOCZErLZcNIcaPV8WeHdXHPgAstBf2E ********************************************************************* Please show support and subscribe if you find the content useful.