DEV Community

özkan pakdil
özkan pakdil

Posted on

1

Data structures and algorithms cheat sheet for interviews

Every interviewer asks about arrays hashmaps and trees and what is O notation access times to the item in those data structures

image

And second big interview helper is sorting #algorithms, if you have a photographic memory this would help you

image

Btw which one is faster O(logn) or O(n) below graphic shows their speed difference

image

O(logn) is faster than O(n) 🤓

Reference:

bigonotation

Top comments (3)

Collapse
 
programmerraja profile image
Boopathi

This is a great starting point for anyone preparing for coding interviews! I especially appreciate the clear explanation of big O notation and the visual comparison of speeds.

Collapse
 
ozkanpakdil profile image
özkan pakdil

feel free to share if you find a good article on this topic, it is not easy to understand these from one article 🤓

Collapse
 
programmerraja profile image
Boopathi

sure

Postmark Image

Speedy emails, satisfied customers

Are delayed transactional emails costing you user satisfaction? Postmark delivers your emails almost instantly, keeping your customers happy and connected.

Sign up