Algorithms and data structures
Big-O and running time
How running time and memory grow with input size, and how to argue about it.
About 6 hours of study.
Where to learn it
Read
Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)
Erik Demaine, Jason Ku, Justin Solomon
Lecture 1, Algorithms and computation
Practise
Top Interview 150
LeetCode
Top Interview 150: Binary Search, then Divide & Conquer
Grouped by topic, which makes it a good map of interview DSA. Needs a free account.
Wrong chapter, dead link, or know something better? Tell us on GitHub.
Which roles ask for it
- UGC NET computer science to get hired
Before and after
Learn first
Big-O and running time