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