วีดีโอ

Great solution using JS. Thank you so much.

var topKFrequent = function (nums, k) { //create hash object to store instances let numsHash = {}; for (let i = 0; i < nums.length; i++) { numsHash[nums[i]] = (numsHash[nums[i]] || 0) + 1; } let sortedKeys = Object.keys(numsHash) .sort((a, b) => numsHash[b] - numsHash[a]) .map((key) => Number(key)); return sortedKeys.splice(0, k); }; I did it this way which is a summated version of yours however the problem says to try and do it under O(nLogn). Our solutions are O(nLogn)

Thank you!!

lol what your viewer should do when facing a problems with ts modules or importing files no visible

Immediate rejection in any interview with that while loop

The explanation is vague but the solution is correct. I recommend writing out the solution as provided by the video and sticking it into ChatGPT with a prompt along the lines of "explain line by line".

Thanks!

Is it ever have been working? It's o(n^2) solution, it gives TLE on leetcode

clear and direct explanation, thanks

This definitely seems like a more reasonable solution in a 25 min interview. Other answers I've seen are more performant, but I don't think most people would ever think of them that quickly!

nice one mate

Nice

super simple and well explained!

3:27 - "We are going to do some logic here" great explanation :)

thanks very useful!

great explanation!

Thanks, very clear explanation

thanks a lot i have been searching for the solution for past 1 hour which is easy to understand , really helped me a lot you deserve a subsribe I hope you have a good day Love from India

1st

thanks

thank you

Thank you!

I really dont know what the f Im doing wrong, this basically is the standard solution, everywhere I look, it's basically the same code..... I can write it down by my own or I can just copy and paste, but It doesn't return the expected output.... I understand clearly what the code is doing, but the output I recieve it's not the expected.... Im actually tired to look at this simple thing, understand it, even copy and paste, but ????

great logic

Leetcode is the dumbbest goddamn thing ever. God I hate leetcode

This is not correct. It should be solved using Floyd's Cycle Detection algorithm

Thanks a lot!

where are we using stack here?? and why is depth = max of count and depth (i am not able to understand this part)

Exactly what I needed thanks!

weak explaining

Thank!

It shouldnt be converted to string did you read the problem

Good explanation, but if I understand correct the shift method does not take any arguments.

finally i understand it

ididn't think of the array wow thank u

Great video! Here are my thoughts on time and space complexity for this solution: Time Complexity: O(n + m) - Loop through nums1 and nums2 array once. Space Complexity: O(n + m) - worst case is nums1 and nums2 has the exact same values.

I dont understand, leetcode say in this exercise "Follow up: Could you solve it without converting the integer to a string?" and you are convert the integer to a string. This right?

very helpful, thanks!

NIce and excellent explanation! thank you so much

Why did you call your video 'Mixin in Vue 3 ' if you are using vue 2 syntax?

Thanks a lot

HOW TO DECOMPRESS A STRING IN JS..IF YOU ALREADY MADE THE VIDEO PLS SHARE LINK

wtf was that, awful explanation

great! what does !obj means??

Thanks for the video.

Thanks a lot, very informative and concise. You deserve way more subscribers! I suggest you work on your thumbnails. Thanks again!

good examples, thank you for sharing this with us.

You really did effort to explain. Subscribed!!!

thanks for a solution that's easy to understand :)

This is incorrect. The rule is to use constant space, and O(n) time.