Top 10 Algorithms for Coding Interviews
summary
Provides a seven-step interview flow (practice on paper, mock interviews via pram.com, write big examples, brute force then optimize, modularize, test) and gives concrete algorithms to implement: binary search and the missing-number trick using the n(n+1)/2 sum, use merge sort / heap sort (O(n log n)) for large sorts, wave-sort by sorting then swapping adjacent pairs, graph tools (Dijkstra, Bellman–Ford), KMP and Boyer–Moore for pattern search, DP and knapsack, and when to prefer heaps/priority queues.
AI-written summary · about
chapters (7)
- 0:00Introduction and goals
- 1:22Seven steps to crack coding interviews
- 15:50Understanding algorithm basics
- 19:21Searching and sorting algorithms
- 31:51Graph algorithms in real world
- 44:41Dynamic programming and pattern matching
- 57:22Summary and next steps
related talks
01h 03mCracking the Coding Interview
06mLightning Talk: How to Win at Coding Interviews
40mSolving algorithms: beyond cramming for job interviews
01h 12mDiscussion: Algorithms and Interviews
01h 58mTrees in Interviews: Preparing for an Algorithmic Interview (for One Big Company)
01h 16mTalks about 'Interview Like Google (or not)-But Better!'
25mFrom Rabbi to Coder: How To Prepare for the Technical Interview
17mDe-Coding The Technical Interview Process