// My solution var topKFrequent = function(arr, k) { let map = new Map(); for(let i=0; i<arr.length; i++){ if(map.has(arr[i])){ map.set(arr[i], map.get(arr[i]) + 1); } else { map.set(arr[i], 1); } } let sortedArray = Array.from(map).sort((a, b) => b[1] - a[1]); let ans = []; for(let i=0; i<k; i++){ ans.push(sortedArray[i][0]); } return ans; };

Is it recommended to start cp with js , coz I was planning to do so.

Please ignore the audio issues for this problem :)

Sir I am lagging in dp(like backtracking) ..could you please help me sir

Please ignore the audio issues for Problem 21 & Problem 22.

Please ignore the audio issues for Problem 21 & Problem 22.

Please Ignore the Audio Issue for this one Particular Problem.

can i have full code ?

Please share GitHub link for this

Brilliant solution, thanks for sharing!

Hey, you just go for solution, but don't explain the logic behind the solution, seems like just memorized the solution, there is very few DSA channel with javascript, i think if you explain, how to approach a problem then, it will be very useful.

I will follow your series DSA WITH JAVASCRIPT but if langauge is Hindi

Sir Agar hindi mai possible ho best hoga

your content was so in-depth. keep it up. Definitely your channel is going to be successful because no one was there in dsa with js

we want more video like this

hey bro, you are doing great.

Great content. I was searching for DSA in Javascript. Just one thing, explain the solution as well by voice, that's more interactive. You got a new subscriber

The Time Complexity is O(log n) and I had mistakenly typed O(n) at the end. 🙂

I meant the space complexity of the problem would be O(n) not the time complexity of the space complexity is O(n). Please ignore that sentence. :)

Bro, I want to become a java backend web developer but for that I need guidance. Can you help me? Right now, I know the fundamentals and basics of Java, the only portion left for me to master is collections framework, multithreading and stream api, I am working on it side by side, also I have started learning jdbc, MySQL and hibernate framework so that I can interact with the db and then I am planning to also learn servlets and jsp and then proceed to springboot. Is my plan correct, am I leaving something and how should I proceed further??

thanks mate

Thank you..... this is so cool and the tutorial is easy to follow😇

Awesome 🎉🎉🎉

❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

First reviwe what to do your project work designe after your code started ❤❤❤❤❤

One more thing in HTML ( Forgot to mention ) is to move the span tag inside the label tag. That was one more wrong thing! Please correct it or else you won't see the hamburger icon and also toggle🙂

any other API which works for hindi songs as well?

wow sir ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😮😮😮😮😮😮😮😮😮 🙏🙏🙏🙏🙏 thank you

wow sir unbilevable ❤❤❤❤❤❤

Please ignore the Logo for this one Particular Video!

Happy to see 100 Subscribers🤩 More success to you

awosome sir wowwwwwwww

it will be better if you show the browser too, to see changes while applying style

keep coding bro❤❤

Approach: Greedy Time Complexity: O(n) Space Complexity: O(m)

Approach: Hash Map with Mathematical Reduction Time Complexity: O(n) Space Complexity: O(n)

Approach: Sliding Window Time Complexity: O(n) Space Complexity: O(1)

Great great great video--love it!!!

Approach: Breadth-First Search (BFS) Time Complexity: O(n) Space Complexity: O(n)

Approach: Linear Search with Counting Time Complexity: O(n^2) Space Complexity: O(1)

Approach: Memoized Dynamic Programming Time Complexity: O(n) Space Complexity: O(n)

Approach: Greedy Time Complexity: O(√n) Space Complexity: O(1)

havent watched the video yet cause its 40 minutes but does this random cat generator go through images on google or do i have to download a bunch of cat pictures and put them on here?

"Also, I forgot to mention at the end of the video that I made a mistake in the code. Inside the JS file, the second API call should be: const response = await fetch('www.omdbapi.com/?apikey=${apiKey}&i=${imdbID}');. I forgot to change this one. You can also refer to my GitHub link in the description for the correct code."

Approach: Dynamic Programming Time Complexity: O(n^2) Space Complexity: O(n^2)

Approach: Iterative Time Complexity: O(n) Space Complexity: O(1)

Approach: Backtracking Time Complexity: O(2^n * n) Space Complexity: O(n)

Approach: Iterative Subset Generation Time Complexity: O(2^n) Space Complexity: O(2^n)

Approach: Sorting and Slicing Time Complexity: O(q⋅(nlogn+t)) Space Complexity: O(n)

Approach : Hash Map for Sum of Digits Time Complexity : O(n * d) Space Complexity : O(n)