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/apply-o...
*************************************************
Timestamps -
00:00 - Agenda
00:45 - Problem Description
03:35 - Possible Approaches
04:36 - [Approach 1] Fixing the Element
04:50 - [Approach 1] Why not convert to random element?
06:30 - [Approach 1] What is maximum frq of an element?
08:15 - [Approach 1] Dry run of Algorithm
11:25 - [Approach 1] Time Complexity
12:35 - [Approach 1] Slight optimisation using 2 Pointers
16:10 - [Approach 1] Further Optimisations?
18:20 - [Approach 2] Fixing the length
21:15 - [Approach 2] Whether an element can have X frequency?
23:55 - [Approach 2] Minimum operations to convert to same element?
28:40 - [Approach 2] Time Complexity
30:25 - [Approach 2] Proof of # of operations
35:15 - [Approach 2] Optimising the solution
37:28 - 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.