3117. Minimum Sum of Values by Dividing Array | Weekly Leetcode 393

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

*************************************************
Contest Link - https://leetcode.com/contest/weekly-c...

Problem Link - https://leetcode.com/contest/weekly-c...
Solution - https://leetcode.com/problems/minimum...

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

00:00 - Agenda
00:47 - Problem Description
03:15 - Intuition of recursion - O(N*N*M)
10:29 - Pseudo code & Time Complexity
13:45 - Dry run of initial Algorithm - O(N*N*M)
23:20 - [Optimisation 1] Skip the un-used indexes
32:00 - Possible choices to optimise further
33:00 - [Approach 1] Intuition of Algorithm
40:10 - [Approach 1] Pseudo code & Time Complexity
43:10 - How to perform binary-search for finding "andValues[i]"
49:47 - [Approach 1] Code Walkthrough
53:15 - [Approach 2] Intuition of Algorithm

*************************************************
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.