3213. Construct String with Minimum Cost (Leetcode Hard)

Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!
Problem: leetcode.com/problems/constru...
Twitch: / larryny
Discord: / discord
Instagram: / larrysomewhere
#leetcode #coding #programming

[@Algorithmist]

Were you able to get the string here?

[@himanshuvohra01]

yes..was able to solve all 4 in 54 mins. Seeing improvement and that's good sign.

[@user-ub2ol5ou7e]

its feels good seeing you solve and explain at same time
...keep it up

[@sagnikbiswas3268]

Slick DP

[@julianelmasry9556]

lost on the TC

[@ShubhamGhuleCode]

I tried this question for almost 50mins but got tle on some test cases...I was using memoization using maps

[@anmeluz]

What is the 8 pointer prereq problem people are talking about?

[@Algorithmist]

Variations of this problem exists on Leetcode, this one is a funky one

[@anmeluz]

@@Algorithmist My bad, I was thinking that '8 pointer' was a specific DP technique. I realize now the problem is worth 8 points which is why people are saying that.

[@RedrixClaymore]

Isn't it still O(N^2) from the DP part?

[@Algorithmist]

It is, this problem is full of issues

[@user-ih9tu1kn7i]

I posted solution with N*SQRT(N) with KMP + Trie + DP, but people says Aho-Corasick need to be used.

[@rafeeqm]

TLE

[@lesliechiu1437]

Useless

[@proofhundred986]

wtf u mean lol ?