- vector (more useful than array), std::string (more useful than cStr). Many string operations are still unfamiliar
- Array-based data structures are required in 80% of my coding tests.
- More than 50% of all my coding tests
require nothing but arrays.
- Most of my toughest coding tests are presented in arrays but may need maps as helpers
- sorted data structure (like std::multimap)
- sorting, operator<(), upper_bound, binary search … on containers
- basics of map lookup
- [w] stringstream — ECT to improve
- [w] nested container is common. You may need typedef for clarity.
Very few hiring companies on either coast would test you on
graph or DP. Here are other less important constructs:
- [w] binary tree is common and simple, but they can ask very tough questions on it!
- [w] double pointer is trickier and my advantage
- [w] Node class in a linked data structure.
- [w] stack, queue.
- [w] grid or matrix
- file I/O? only for IDE tests, not pure algo or take-home tests
- [w] basic syntax for pointer arithmetic.
- [w] dtor, copier, op=? only for design questions, not algo questions.
- [w] shared_ptr? Only for design questions, never needed in algo questions!
- [w] ref variable only as function I/O.
- stl algo? Only Citadel array-shrink
- never exception
- never template
- no (very, very seldom) threading in coding Q
- adv: pointer to function
- adv: circular buffer
- [w = no weakness]