ProjectGopher: Difference between revisions
From charlesreid1
| Line 3: | Line 3: | ||
Organizing notes in preparation for 2019 technical interview. | Organizing notes in preparation for 2019 technical interview. | ||
Full list of topics: https://git.charlesreid1.com/cs/study-plan/src/branch/master/SoftwareEngineering.md | |||
Top level topics: | |||
* Algorithm complexity | * Algorithm complexity | ||
* Sorting - know how to sort, know at least 2 O(n log n) sort methods (merge sort and quicksort) | * Sorting - know how to sort, know at least 2 O(n log n) sort methods (merge sort and quicksort) | ||
Revision as of 23:31, 28 January 2019
Project Gopher
Organizing notes in preparation for 2019 technical interview.
Full list of topics: https://git.charlesreid1.com/cs/study-plan/src/branch/master/SoftwareEngineering.md
Top level topics:
- Algorithm complexity
- Sorting - know how to sort, know at least 2 O(n log n) sort methods (merge sort and quicksort)
- Hashtables - the most useful data structure known to humankind.
- Trees - this is basic stuff, BFS/DFS, so learn it.
- Graphs - twice as important as you think they are.
- Other Data Structures - fill up your brain with other data structures.
- Math - discrete math, combinatorics, probability.
- Systems - operating system level, concurrency, threads, processing, memory.