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

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

Solution - https://leetcode.com/problems/find-lo...

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

00:00 - Agenda
01:22 - Problem Description
03:06 - [Approach 1] Brute force solution
06:03 - [Approach 1] Dry run of the Algorithm
08:20 - [Approach 1] Pseudo code
10:39 - [Approach 1] Time Complexity
12:30 - [Approach 1] Optimising by avoiding computing substring
19:34 - [Approach 1] Time Complexity
20:20 - [Approach 1] How to account for "Special" criteria?
22:10 - [Approach 1] Pseudo code
23:34 - [Approach 1] Optimising by avoiding linear search
28:30 - [Approach 1] Optimising by skip searching all characters
30:04 - [Approach 1] Code Walkthrough
34:16 - [Approach 2] Intuition
35:39 - [Approach 2] Dry run of Algorithm
38:32 - [Approach 2] Time Complexity

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