992. Subarrays with K Different Integers | leetcode daily challenge | DSA | shashwat | hindi

[@adishan7079]

Clarity with which u explain is phenomenal, even hard questions looks like cakewalk...never loose this teaching style of yours😇

[@shashwatbajpai5725]

Awesome explanation sir .. I watch these videos to understand more approaches and write down a more better and refined LeetCode POTD editorial.

[@deepak-ly3ob]

Amazing concept.

[@utpalkant6354]

Awesome explanation bro, superb.

[@mr.nishantawasthi4402]

Osm explain ❤

[@anubhavutkarsh707]

Oh got it I was missing the end++ increment😅

[@sumitrajan9030]

[@pulkitjain8135]

You can use map.merge() now for putting with 1 or increment if present, which is much less verbose than your current method.

[@shashwat_tiwari_st]

Good idea! Next time 💯

[@BhujiaCoder]

Sir, I became a daily visitor 😅 , even if I solved the problem, I came to understand it properly.

[@shashwat_tiwari_st]

Hahaha. You had me at your username 😂💯

[@BhujiaCoder]

@@shashwat_tiwari_st Yes , it's pretty funny 🤣 , Thank you so much for all the effort you put in. ♥️

[@dayashankarlakhotia4943]

can explain leetcode 2nd approach of official solution

[@anubhavutkarsh707]

Sir I am a beginner so I am learning by the explanation really great 👍🏻 , also I am trying the problem with same code but it’s showing time limit error

[@shashwat_tiwari_st]

End++ kra h? Infinite loop toh nhi chal gya?

[@batmandoesntkill4744]

Really helpful

[@shashwat_tiwari_st]

❤️💯