2945. Find Maximum Non-decreasing Array Length | Leetcode Biweekly 118

Segment Trees Series - https://bit.ly/segment-trees

*************************************************

Similar Problems -    • Collect Coins in a Tree | In Out DP E...  
   • In Out DFS | Difference Between Maxim...  
Dynamic Programming Playlist -    • Dynamic Programming (DP)  

*************************************************
Contest Link - https://leetcode.com/contest/biweekly...
Problem Link - https://leetcode.com/contest/biweekly...

Solution - https://leetcode.com/problems/find-ma...

*************************************************
Timestamps -

00:00 - Agenda
00:45 - Problem Description
02:23 - Why Greedy solution won't work?
06:15 - Recursive solution
09:30 - Dry run of Algorithm
12:39 - Pseudo code & Time Complexity
16:45 - [Most Imp. Observation] "last" doesn't matter
24:45 - Dry run "without last"
29:53 - Pseudo code & Time Complexity
32:29 - Converting top-down to bottom-up
35:05 - Intuition to optimise the solution
37:55 - Dry run of the optimisation
40:07 - Why "Pull DP" is hard?
41:05 - Introduction of "Push DP"
43:25 - Recap of complete journey
46:20 - Dry run of the Algorithm
53:16 - Code Walkthrough

*************************************************
Interview Experiences Playlists -

Microsoft -    • Microsoft Interview Questions  
Amazon -    • Amazon Interview Questions  
D.E.Shaw -    • D.E.Shaw Interview Questions  
Linkedin -    • Linkedin Interview Questions  
Facebook -    • Facebook (Meta) Interview Questions  
*********************************************************************

Please show support and subscribe if you find the content useful.