H


hash tables

benefit of, 188

versus binary search trees, 190–191

compared to arrays, 74–75

implementing for Unicode strings, 75–76

providing constant-time lookup, 74

Hash Tables versus Binary Search Trees problem, 190–191

head element

in a doubly-linked list, 27

removing from a singly-linked list, 40–41

of a singly-linked list, 26

tracking in a singly-linked list, 27–28

head pointer, updating, 36

headhunters, working with, 8

heaps, 58–59

Heavy Marble problem, 169–172

highest-order term used in big-O analysis, 21

hiring managers, more flexible than recruiters, 11

Horner’s Rule, 84

HotJobs, 3

“How Much Money Do You Want to Make?”, 196–198

human resources representative. See recruiters

hypercubic arrays of hypercubes, 178–179




Programming Interviews Exposed. Secrets to Landing Your Next Job
Programming Interviews Exposed: Secrets to Landing Your Next Job, 2nd Edition (Programmer to Programmer)
ISBN: 047012167X
EAN: 2147483647
Year: 2007
Pages: 94

Similar book on Amazon
Cracking the Coding Interview: 150 Programming Questions and Solutions
Cracking the Coding Interview: 150 Programming Questions and Solutions
The Google Resume: How to Prepare for a Career and Land a Job at Apple, Microsoft, Google, or any Top Tech Company
The Google Resume: How to Prepare for a Career and Land a Job at Apple, Microsoft, Google, or any Top Tech Company
Programming Pearls (2nd Edition)
Programming Pearls (2nd Edition)
Algorithms For Interviews
Algorithms For Interviews

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net