3085. Minimum Deletions to Make String K-Special | DP | Hash Table

[@subhankarmajumdar8528]

Excellent solution. Tried to do similar thing in the contest but was unable to do it.

[@JIGARSINGTHAKOR-yy6qp]

Best solution ❤

[@k.satish3663]

i got almost like sorting frequencies and two pointer but didn't thinked dp solution. anyway great explanation understood.

[@HarshitPareek-sc1fz]

i didn't thinked about left and right but thinked about that 2 cases

[@charanganesh526]

Found all the observations but was unable to think of DP solution

[@rakshitkathawate8838]

It’s greedy too as suboptimal solution contributes to optimal too

[@gauravagrawal7988]

just sort all frequency ( leaving zeros ) put one pointer left and one right ... then use simple dp with all possibilities

[@mukulkhanna5071]

Great approach brother keep posting more content💯💯💯💯

[@ajinkyaagarkar4833]

Great approach and intuition

[@Hamsters_yt]

nice explanation🥳🥳🥳

[@ritishrai581]

This problem ate my brain and yet I couldn't even come close to the actual solution :(

[@k.8597]

Mujhe lagta hai tujhe apna solution khud nahi samajh aaya

[@PRIYAMJAIN]

i am watching you lecture frm very long time but this video is time waste ,very bad explainnation

[@rakshitkathawate8838]

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