Bottom Up DP | 2750. Ways to Split Array Into Good Subarrays | Leetcode Weekly Contest 351
Segment Trees Series - https://bit.ly/segment-trees
Part 1 - • Segment Trees Series | Basics of Segment T...
Part 2 - • Segment Trees Series | Queries on prefix o...
Part 3 - • Segment Trees Series | Part 3 | Solving Co...
Part 4 - • Segment Trees Series | Part 4 | Solving Co...
Part 5 - • Segment Trees Series | Part 5 | Longest In...
Part 6 - • Segment Trees Series | Part 6 | Solving Sp...
Part 7 - • Segment Trees Series | Part 7 | Binary Sea...
Segment Trees Problems Playlist - • Segment Trees
*************************************************
Contest Link - https://leetcode.com/contest/weekly-c...
Problem Link - https://leetcode.com/contest/weekly-c...
Solution - https://leetcode.com/problems/ways-to...
*************************************************
Timestamps -
00:00 - Agenda
00:40 - Problem Description
01:56 - Number of sub-arrays in single array
04:50 - [Approach 1] Counting good splits (Mathematics)
07:25 - [Approach 1] Code Walkthrough
08:15 - [Approach 2] Counting good splits (Recursion + DP)
11:00 - Time Complexity of the current recursion
11:40 - Optimizing the recursive solution [O(N*N) to O(N)]
14:07 - Why we can't do better using Top Down solution?
14:43 - Converting the Top-Down recursion to Bottom-Up
17:00 - Optimizing the bottom up solution
19:58 - 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.