Minimum Reverse Operations | Weekly Contest 339

BFS / DFS Playlist - https://www.youtube.com/playlist?list=PL9TOCZErLZcNioqF_RGe4aC04G9apRDfP Dynamic Programming Playlist - https://www.youtube.com/playlist?list=PL9TOCZErLZcNxIHWVRcJbVTvgRgLFcgHC ************************************************* Contest Link - https://leetcode.com/contest/weekly-contest-339 Problem Link - https://leetcode.com/contest/weekly-contest-339/problems/minimum-reverse-operations/ Solution - https://leetcode.com/problems/minimum-reverse-operations/solutions/3370104/video-explanation-with-intuitive-proof-of-every-step/ ************************************************* Timestamps 00:00 - Problem Statement 04:25 - Solving a simpler version of problem 05:20 - Minimum reversal required to propagate 1 without "banned indexes" 10:28 - Finding all the neighbors of a particular index "i" 14:45 - Values of 'l' & 'r' (when all "k" subarrays are possible) 16:15 - Values of 'l' & 'r' (when there are less than K subarrays) 21:15 - Pseudo code 24:35 - Recap of the solution (without 'banned indexes') 26:37 - Time Complexity 27:47 - Solving the original problem (includes "banned indexes") 30:05 - Code Walkthrough - O(N*K) solution 32:10 - Optimizing O(N*K) solution to O(N*logN) 35:02 - Code Walkthrough - O(N*logN) solution ************************************************* 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.