Notes for technical interview prep.
- Sliding window : contiguous subarray, substring
- Two pointers : triplet sums
- Tree BFS : level-oriented maths, horizontal relations
- Tree DFS :
- Strategy 1 (Mastery) : One topic at a time. i.e. To get good with linked lists, tackle all linked list related Qs
- Strategy 2 (Exposure) : Devise a method for the problem, then compare solutions. Code problem when unfamiliar
- Strategy 3 (Motivate) : Knockout as many doable problems to get the ball rolling. Consistency is 🔑
- Strategy 4 (Specific) : Interviewing soon. ROTE memorize recent questions. Find patterns.
- Strategy 5 (PEMDAS): Find balance between frequently asked questions at companies applied to and problem sets on topics less familiar. In my case, its graphs and DP.
What to prep according to HackeRank
Topics | % of companies test this subject |
---|---|
Arrays | 70 |
Dictionaries and Hashmaps | 40 |
Sorting | 40 |
String Manipulation | 40 |
Greedy Algorithms | 31 |
Search | 30 |
Dynamic Programming | 27 |
Stacks and Queues | 17 |
Graphs | 15 |
Trees | 12 |
Linked Lists | 8 |
Recursion and Backtracking | 5 |
Miscellaneous | <5 |
- Educative.io grokking the coding intv: patterns and coding questions
- Blind-curated top-75 Leetcode interviewv questions
- LeetCode Problem Bank
© Yasin Ehsan Licensed under the Apache License.