T

tables

adding values to, 133

joining, 134, 138

in a relational database, 131

retrieving data from, 133–135

retrieving data from two, 138

tail element

in a doubly-linked list, 27

of a singly-linked list, 26

tail pointer, maintaining, 36

tail recursion, 90

talking, while solving coding questions, 17

team

fitting in with existing, 194

wanting to work with a great, 195

technical career paths, companies with, 2

technical interview sites, visiting, 201

technical interviews, nontechnical questions in, 193–199

technical questions, examples of, 194–199

technical resumes, examples of, 203–218

technical skills, categorizing by type, 207, 208

Telephone Words problem, 100–105

“Tell Me About Your Experience”, 195

temporary buffer, eliminating the need for, 82

temporary storage data structure, using to traverse a list, 42

temporary string buffer, allocating for a modified string, 77

ternary logic, 141

testing, 2

themes, shared by brainteasers, 159

thinking outside the box, questions identifying, 165

thought processes, working through a programming problem, 17

thread synchronization, constructs of, 108

threading, example of, 109–112

threads

described, 107–108

implementing, 107–108

incorrect use of, 107

Three Switches problem, 164–165

three-dimensional problems, solving, 173–174

three-valued logic. See ternary logic

Three-Valued Logic problem, 140–141

time, representing a fourth dimension, 178

timeout, adding for deadlocks, 119

toggling a locker, 163

token scanner, 79

transactions. See database transactions

transfer, as two operations, 136

travelers, crossing a bridge, 165–168

traversals, 59–60

traversing elements of a linked list, 28–29

tree-related vocabulary, 55

trees, 53–55

two-element list, as a special case, 36, 38

two-element lists, checking behavior for, 38–39

two-way pointers, graphs with, 60