Hello Readers! I’ve recently launched JavaScript Algorithms and Data Structures repository on GitHub with a collection of classic algorithms and da...
For further actions, you may consider blocking this person and/or reporting abuse
THIS THIS THIS THIS THIS. Google recruiter reached out to me the other day. We had a conversation and he wants me to be ready for the interview by studying this stuff. The materials he sent honestly. This is going to help me so much. Thank you!
Hey if you got to learn this maybe you might want to consider studying the complexity of a piece of code containing for example multiple for-loops or recursion
O (n2) is not horrible. If you problem is matrix multiplication, the you're a god if you do it in O (n2). The complexity is relative to the problem. Also, time complexity should be considered together with space complexity. If you can sort in O(n) time wih O(n2) it might be not that good, but it depends on the size of your data. For small data you can afford to store O(n2). A good complexity table is the one of "data structure complexity in c++" which compares operation for different data structs
Hi Isaac,
I think the chart was taken from bigocheatsheet.com/ and there it mainly talks about data structure operations (read, insert, update, delete) and sorting algorithms.
I agree with you that to say a complexity is bad cannot be done independently of the problem.
Yeah exactly thats the cheatsheet I had in mind :)
Has anyone tried online courses like this one udemy.com/coding-interview-bootcam... ?
There is Frontend Masters' course frontendmasters.com/courses/data-s... but it's so irritatingly wordy. I like concise and to the point way of teaching.
P.S. You all are probably aware of this repo but in case or for future references - github.com/getify/You-Dont-Know-JS
Hi Oleksii!
Thanks for sharing. Where'd you get the image from? It looks a lot like the one on bigocheatsheet.com/ but it's missing the "excellent" part in the graph, although it's present in the legend.
Cooooool! I wrote a post on Linear and Binary Search. I'd love to get your feedback, Oleksii. :)
Seriously, thank you!
Wow, this is awesome!
5 years later...thanks for doing this, was an interesting introduction to data structures from a perspective of someone who kind of needs to backfill my knowledge!
Conclusion: In CS, no algorithm is "excellent".
- Not even O(1)?
+ No
- That's not fair!
+ No, there are not "fair" algorithms, either.
This is so awesome! Thanks!
Thank
You
Soooo
Muchhh....😀😀😃
This is so sick! Thank you so much for this. I wonder if we could do this for typescript?