Subsequence With the Minimum Score | Weekly Contest 332 | Leetcode

*************************************************

*************************************************
Timestamps

00:00 - Problem Statement
02:10 - Interesting Observation about "Score"
04:44 - Brute Force Solution
05:24 - Pseudo Code
06:28 - Whether a string "t" is subsequence of "s" or not
09:03 - Time Complexity
10:00 - Optimizing O(N^3) to O(N^2)
16:20 - Pseudo Code
18:45 - Time Complexity
19:20 - Optimizing O(N^2) to O(N*logN)
23:14 - Final Solution Complexity
23:45 - Code Walkthrough

*************************************************
Interview Experiences Playlists -

*********************************************************************

Please show support and subscribe if you find the content useful.

[vaibhavkumar]

I think, we can further optimise to O(n) by using sliding window instead of binary search.

[gigachad]

He came back when we needed him the most!!
Today's Contest was really difficult...could only solve first :(

[AakashKumar-vfdh]

Excellent explanation...The step by step optimization is very clear and intuitive.

[niladrisekharnath]

Is it possible can you please explain why while calculating the minValue in the final step why did you do right-left only not right-left+1;

[getconcept]

Bro please make less durations video..