Table of contents : Cover Table of Contents Introduction I The Interview 1 Getting Ready 2 Strategies for a Great Interview 3 Conducting an Interview 4 Problem Solving II Problems 5 Primitive Types 6 Arrays 7 Strings 8 Linked Lists 9 Stacks and Queues 10 Binary Trees 11 Heaps 12 Searching 13 Hash Tables 14 Sorting 15 Binary Search Trees 16 Recursion 17 Dynamic Programming 18 Greedy Algorithms and Invariants 19 Graphs 20 Parallel Computing III Domain Specific Problems 21 Design Problems 22 Language Questions 23 Object-Oriented Design 24 Common Tools IV The Honors Class 25 Honors Class V Notation, and Index Notation Index of Terms