5,337
edits
Technical Interviews: Difference between revisions
→Algorithms
No edit summary |
|||
| Line 5: | Line 5: | ||
==Algorithms== | ==Algorithms== | ||
{{main | Interview Algorithms}} | {{main | Interview Algorithms}} | ||
In general, consider the following approaches | |||
* Brute-force and searching | |||
* Dynamic Programming | |||
* Greedy (sorting + take the best at each step) | |||
* Linear searching (with 2 pointers) | |||
** Usually the answer if you're searching for a connected segment along an array | |||
** E.g. max contiguous subarray | |||
==Computer Systems== | ==Computer Systems== | ||