This content originally appeared on DEV Community and was authored by özkan pakdil
Every interviewer asks about arrays hashmaps and trees and what is O notation access times to the item in those data structures
And second big interview helper is sorting #algorithms, if you have a photographic memory this would help you
Btw which one is faster O(logn) or O(n) below graphic shows their speed difference
O(logn) is faster than O(n) 🤓
Reference:
bigonotation
This content originally appeared on DEV Community and was authored by özkan pakdil
özkan pakdil | Sciencx (2024-11-05T22:28:34+00:00) Data structures and algorithms cheat sheet for interviews. Retrieved from https://www.scien.cx/2024/11/05/data-structures-and-algorithms-cheat-sheet-for-interviews/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.