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/maximum...
*************************************************
Timestamps -
00:00 - Agenda
00:33 - Problem Description
03:20 - [Solution 1] Coming up with initial recursion
09:35 - [Solution 1] Pseudo code & Time Complexity
13:50 - [Solution 2] What to optimise and how?
14:50 - [Solution 2] Removing the need for "all" taken elements
18:30 - [Solution 2] Pseudo code & Time Complexity
21:00 - [Solution 3] Intuition to optimise further
23:50 - [Solution 3] Dry run of Algorithm
27:10 - [Solution 3] Pseudo code & Time Complexity
30:10 - [Solution 4] How to compute "nxt" efficiently?
34:44 - How to take care of "power[i]"?
36:40 - 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.