2053. Kth Distinct String in an Array | string | Leetcode Daily Challenge | DSA | Hindi

[@shashwat_tiwari_st]

Like target for this video is 100. Please do like if you have understood the explanation.😊😊

[@kevalyagupta359]

Thank you

[@explorescience6510]

concept clear and great explanation. Keep it up❤

[@pranatis2314]

how do you think of edge cases while problem solving, would love some video or content on this

[@AbhishekKumar-hu2pz]

Bhaiya when will graph series completed and dp series start?

[@vibhutiagrawal5105]

Hey, qq - which approach out of the last two do you think is more optimal? The one using Hashmap or the one using Hashset?

[@shashwat_tiwari_st]

both have same tc, you can explain anyone to the interviewer.

[@ankitagrawal4477]

Will sorting work?

[@Nikhil_3239]

grt explain

[@PiyushSharma-we8yd]

"why single set fails" Jb bhi ata hu aap kuch naya sikha dete ho bhaiya. Thankyou 😍😍

[@RohitKumar-dz8dh]

Thanks 😊

[@GirjeshSharma-zv3xo]

Day5 of request for do series

[@priyanshgarg1292]

class Solution {
public String kthDistinct(String[] arr, int k) {
HashMap map=new HashMap();
for(int i=0;i

[@max1237]

Thank you sir
New subscriber 🩷

[@nishantrathore5031]

public static String kthDistinct(String[] arr, int k) {
Map mp = new LinkedHashMap();
for(var str : arr){
mp.put(str,mp.getOrDefault(str,0)+1);
}
int tmp = k;
for(String freq : mp.keySet()){
if(mp.get(freq) > 1) continue;
if(mp.get(freq)==1){
tmp--;
}
if(tmp==0) return freq;
}
return "";
} this is my brute force solution is this efficient ?

[@shashwat_tiwari_st]

You used linkedHashMap nice 👌👌