3085. Minimum Deletions to Make String K-Special | DP | Hash Table
In this video, I'll talk about how to solve Leetcode 3085. Minimum Deletions to Make String K-Special | DP | Hash Table
Checkout DSA-169 Series: • Aryan DSA-169 Series |...
100Days 100k Placements: • 100 Days 100K Placement
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Пікірлер: 14
Excellent solution. Tried to do similar thing in the contest but was unable to do it.
i got almost like sorting frequencies and two pointer but didn't thinked dp solution. anyway great explanation understood.
Found all the observations but was unable to think of DP solution
@rakshitkathawate8838
4 ай бұрын
It’s greedy too as suboptimal solution contributes to optimal too
@gauravagrawal7988
3 ай бұрын
just sort all frequency ( leaving zeros ) put one pointer left and one right ... then use simple dp with all possibilities
i didn't thinked about left and right but thinked about that 2 cases
Best solution ❤
Great approach and intuition
Great approach brother keep posting more content💯💯💯💯
nice explanation🥳🥳🥳
This problem ate my brain and yet I couldn't even come close to the actual solution :(
Mujhe lagta hai tujhe apna solution khud nahi samajh aaya
i am watching you lecture frm very long time but this video is time waste ,very bad explainnation
@rakshitkathawate8838
4 ай бұрын
It was difficult to explain that expression. I did it contest but when I wanted to write it in notepad, even I found it difficult for proof. With example was best option