Leetcode Weekly Contest 405 | Video Solutions - A to D | by Harsh Gupta | TLE Eliminators

Here are the video solutions for problems A, B, C, D of Leetcode Weekly Contest 405. We hope this will be useful for you in up-solving this contest.
📢Check out handpicked problems by Priyansh himself, on our CP-31 sheet: www.tle-eliminators.com/cp-sheet
Solution Codes:
Problem 1: leetcode.com/contest/weekly-c...
Problem 2: leetcode.com/contest/weekly-c...
Problem 3: leetcode.com/submissions/deta...
Problem 4: leetcode.com/submissions/deta...
Be sure to check out TLE Eliminators.
Website: www.tle-eliminators.com/
Instagram: / tle_eliminators
Linkedin: / tle-eliminators
Twitter: / tle_eliminators
TLE Community Discord Server: / discord
Timestamps:-
0:00 Problem A
6:50 Problem B
18:45 Problem C
34:05 Problem D

[@TLE_Eliminators]

Please fill the feedback form: forms.gle/52XsaRWXd2P4pBqz5

[@sdeBack1]

We can further optimize. Instead of storing index, we can store cost .Each time when we end at same char we store min cost

[@gigachad2419]

Trie+DP fails few testcases within constraints. Was expecting Rolling Hash+DP solution.

[@user-ym1nv1pw8i]

Yes

[@arijoymajumdar2326]

Very helpful!

[@atanunayak6637]

Well explained!

[@virujthakur9260]

Isn't the code's complexity isn't N^2 in worst case? How does it pass the constraints?

[@ronitkumarbaranwal6844]

Truly helpful !!

[@inspirationalshorts2689]

About question 4 their is not any another way to solve without using Trie because in my first instance it will seem familiar of recursion + memoization of pick or notPick because ultimately we have to calculate minimum cost to formed target string by using substring matching way on recursion by taking start index? Everyone only talking about using Trie to solve this question that's mean their is no another way left to solve this question.

[@AMITKUMAR-sz4fg]

give a try using rolling hash

[@inspirationalshorts2689]

@@AMITKUMAR-sz4fg Can you elaborate more about rolling hash to solve this problem it will be more beneficial.

[@Cools74]

​@@inspirationalshorts2689 Refer Coding mohan channel He explained using rolling hash