Velikost videa: 1280 X 720853 X 480640 X 360
Zobrazit ovladače přehrávání
Automatické přehrávání
Přehrát
Master Data Structures & Algorithms For FREE at AlgoMap.io!
Learnt heap with a single short 😂, kudos to you.
Epic 😎 I love your shorts. Nice elegant code
Thank you!
Unordered_map is good choice?
Why not O(n+k×ln(k))?
Also in the beginning you say you solved it in O(n). Why bother with slower solution?
@@Ford-ju9yrfor k
Counter has most_common method.
Yeah! :)
What is counter time complexity
O(n)
lmao what else do u think it could be it literally just adds 1 for each occurrence
It uses a dictionary, which is hashing
@@prawnydagrate what's in it to laugh? someone asked a question, if you can answer it then do it else move on!
I cant take this dude seriously… first he codes on python and then his voice breaks lol
Post a video of you speaking then tough guy
What would you code in? You do know that if you can code in one language you have the ability to code in another language you just need to learn the syntax …
Master Data Structures & Algorithms For FREE at AlgoMap.io!
Learnt heap with a single short 😂, kudos to you.
Epic 😎
I love your shorts. Nice elegant code
Thank you!
Unordered_map is good choice?
Why not O(n+k×ln(k))?
Also in the beginning you say you solved it in O(n). Why bother with slower solution?
@@Ford-ju9yrfor k
Counter has most_common method.
Yeah! :)
What is counter time complexity
O(n)
lmao what else do u think it could be it literally just adds 1 for each occurrence
It uses a dictionary, which is hashing
@@prawnydagrate what's in it to laugh? someone asked a question, if you can answer it then do it else move on!
I cant take this dude seriously… first he codes on python and then his voice breaks lol
Post a video of you speaking then tough guy
What would you code in? You do know that if you can code in one language you have the ability to code in another language you just need to learn the syntax …