Segment Tree Series - https://bit.ly/segment-trees
*************************************************
Contest Link - https://leetcode.com/contest/biweekly...
Problem Link - https://leetcode.com/contest/biweekly...
Solution - https://leetcode.com/problems/maximum...
*************************************************
Timestamps -
00:00 - Agenda
01:09 - Problem Description
04:13 - How to approach the problem?
07:20 - [Reduced Problem 1] Brute force solution
11:00 - [Reduced Problem 1] How to optimise?
14:35 - [Reduced Problem 1] Another way to visualise recursion
16:25 - [Reduced Problem 1] Time Complexity
17:35 - [Reduced Problem 2] Problem Description
18:24 - [Reduced Problem 2] Brute force solution
19:35 - [Reduced Problem 2] Why same optimisation wouldn't work?
23:10 - [Reduced Problem 2] How to optimise?
26:00 - [Reduced Problem 2] Pseudo code & Time Complexity
31:00 - [Original Problem] Brute force solution
37:10 - [Original Problem] Time Complexity of brute force
38:54 - [Original Problem] Optimising using 1D version trick
44:35 - [Original Problem] Time Complexity post 1st optimisation
46:18 - [Original Problem] What to optimise and how?
49:42 - [Original Problem] Code Walkthrough of O(R*R*R*C)
54:07 - [Original Problem] How to optimise further?
59:47 - [Original Problem] 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.