leetcode, coding interview question, data structures, data structures and algorithms, faang
Пікірлер: 19
@GregHogg7 ай бұрын
Master Data Structures & Algorithms For FREE at AlgoMap.io!
@tejakovvuri30422 ай бұрын
Learnt heap with a single short 😂, kudos to you.
@danielshin20478 ай бұрын
Epic 😎 I love your shorts. Nice elegant code
@GregHogg8 ай бұрын
Thank you!
@KunalSingh-ol6zx8 ай бұрын
Unordered_map is good choice?
@Ford-ju9yr4 ай бұрын
Why not O(n+k×ln(k))?
@Ford-ju9yr4 ай бұрын
Also in the beginning you say you solved it in O(n). Why bother with slower solution?
@millfreedomАй бұрын
@@Ford-ju9yrfor k
@QwDragon8 ай бұрын
Counter has most_common method.
@GregHogg8 ай бұрын
Yeah! :)
@cillwish8 ай бұрын
What is counter time complexity
@GregHogg8 ай бұрын
O(n)
@prawnydagrate8 ай бұрын
lmao what else do u think it could be it literally just adds 1 for each occurrence
@GregHogg8 ай бұрын
It uses a dictionary, which is hashing
@deeps-n5y6 ай бұрын
@@prawnydagrate what's in it to laugh? someone asked a question, if you can answer it then do it else move on!
@MurderByProxy8 ай бұрын
I cant take this dude seriously… first he codes on python and then his voice breaks lol
@anova36078 ай бұрын
Post a video of you speaking then tough guy
@6hbaufhehdj8 ай бұрын
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 …