Top K Frequent Elements | LeetCode
Hello friends! Today we are looking at a problem that's solved by a fixed-sized heap. The runtime analysis on this solution is pretty fun so make sure to watch it!
This video is divided into 4 parts:
Part I: Problem description and examples 0:11
Part II: Intuitive solution and runtime 1:35
Part III: Optimized solution and runtime 5:09
Part IV: Code to the optimized solution 7:55
Overall Runtime: O(nlogk)
Overal Space: O(n+k)
Similar questions:
https://leetcode.com/problems/kth-lar...
https://leetcode.com/problems/top-k-f...
Hope you enjoy this video and happy coding!
Let's be friends:
My website where I occasionally post blogs: JazWang.com
Email: CodingWithJaz@gmail.com
En esta página del sitio puede ver el video en línea Top K Frequent Elements | LeetCode de Duración hora minuto segunda en buena calidad , que subió el usuario Coding With Jaz 09 junio 2021, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 1,637 veces y le gustó 35 a los espectadores. Disfruta viendo!
