You can report issues at

https://careercup.wufoo.com/forms/cracking-the-book-bug-report/
 Chapter Page #
Type Date Reported By Chapter / Problem Name (US)
Spelling / Grammar / Typo 7/12/2015 CM 4 4 103
Minor 7/17/2015 AR 1.5 1.5 199
Minor 7/17/2015 AR 1.4 #VALUE!
Question 196
Spelling / Grammar / Typo 7/17/2015 GS VII sQuestion 67
Spelling / Grammar / Typo 7/17/2015 VII sAdvance 61
Spelling / Grammar / Typo 7/17/2015 TA XI d Topics 631
Spelling / Grammar / Typo 7/17/2015 OM 6 6 120
Spelling / Grammar / Typo 7/17/2015 OM 4.1 4.1 109
Spelling / Grammar / Typo 9/8/2015 DW 9.2 9.2 378
Spelling / Grammar / Typo 9/8/2015 AW 5.3 5.3
Spelling / Grammar / Typo 9/8/2015 LK 6.10 6.10 299
Minor 9/11/2015 RV 8.4 349
Correction 9/14/2015 ZY 4.12 272
Enhancement 9/16/2015 AM 4.12 275
Enhancement 9/16/2015 AM 4.8 257
Enhancement 9/21/2015 SL 5.3 280
Enhancement 9/21/2015 GV 4.10 265
Minor 2/2/2016 DM 4.12 274
Spelling / Grammar / Typo 2/2/2016 PS 4.8 258
Clarification 2/3/2016 SB 4.12 258
Enhancement 2/3/2016 BS 1.4 196
Minor 2/3/2016 CC 3.5 238
Spelling / Grammar / Typo 2/3/2016 MO 13.5 436
Minor 2/4/2016 VM 1.3 194
Enhancement 2/4/2016 MT 2.6 162
Minor 2/4/2016 SS, Gayle 16.24 411
Minor 2/4/2016 GM 16.3 465
Enhancement 2/4/2016 GM 8.9 360
Enhancement 2/4/2016 AV 5 79
Minor 2/4/2016 GV 16.12 182
Minor 2/4/2016 KDS 4.7 254
Enhancement 2/4/2016 ML 17.18 589
Minor 2/4/2016 ES Big O 51
Minor 2/4/2016 ES 8.7 357
Enhancement 2/6/2016 Gayle 8.2 346
Minor 6/12/2016 FR 17.5 536
Typo 6/12/2016 MV 8.2 344
Typo 6/12/2016 MV 9.6, 9.7 388
Minor 6/13/2016 SS VI Technical Questions 75
Minor 6/13/2016 EC VI Technical Questions 68
Enhancement 6/13/2016 KR 1.2 194
Typo 6/13/2016 AF 2.6 217
Minor 6/13/2016 EW 4 104
Enhancement 6/13/2016 MV 7.12 339
Minor 6/13/2016 MV 12.6 427
Minor 6/13/2016 MT 16.11 488
Clarification 6/13/2016 MV 16.22 512
Clarification 6/13/2016 MV 16.23 518
Typo 6/13/2016 MT 16.26 527
Clarification 6/13/2016 MT 17.21 599
Minor 6/13/2016 LE 5.6 286
Page # (India)

163
71
263
333
384
404
409
417
475
216
Description
Methods} in preorder and postorder traversal should be preOrderTraversal and postOrderTraversal
index2++; // Always move pointer for longer
Character.getNumericValue(‘a’) + 1]; string
For example, given the array {1, 7, 5, 9, 2, 12, 3} and the difference k = 2, there are four pairs with
difference 2: (1,
this mapping. 3), (3,
That’s 5), (5,
about 7),a(7,
half 9).
gigabyte of memory, which can be easily held in memory on a typical
machine.
Should be:
log10(p) = log2(p)/log2(10)
Result#20,
Hints for P(x is evenon
#32,#48 or4.1
x <= 5) should
should read
be with 4.44/5

Bidirectional BFS: O(q^k/2

It should be "Flipping a 0 to +1 q^k/2)
will joinshould
..........".be O(k^q/2 + k^q/2) instead. BFS should say O(k^q)

This
of approach
those subsetswill
is nwork as long as 2^T >= B, ....
* 2n-1.
We will not be able
return to beat O(n2n) in space or time complexity.
totalPaths;
}
Updated code in second solution to delete key when its value is zero. Reduces space complexity to O(log
N)
Changed first solution (with links to parents) to leverage approach from 2.7 (intersection of two linked
lists)return maxLength;
}
On first
Line solution,
30 of you
code got actually
deleted in only need to check the"int
incrementHashTable: pre-order traversal.
newCount Updated code.
= hashTable.getOrDefault(key, 0) +
delta;"
"n" should be replaced with "x' in "Therefore, we only need to check the new nodes “uncovered”, which
will be the nodes under x’s sibling."
Problem return
doesn't-1;
need to specify binary search tree, as solutions don't rely on this.
}
Changed code to copy solution back into stack
Changed isComparable to Comparable
Adding bounds
return check
one == nullon
&&line
two9 == null;
} counter.put(key, counter.getOrDefault(key, 0) + delta);
Typo} in code. If-statement should read end1, not end2. "if (line1.yintercept == line2.yintercept &&
} isBetween(start1, start2, end1))"
}
int mask = (-1 << (i + 1));
return num & mask;
Fixed problem
} statement. Should say "Value --> string value" instead of "Value --> string value END"
} return allLocations;
}
Example 12: Fixed runtime. Should take into account printing the string. Total runtime is O(n*n!).

Switching from hashmap to hashset

Brute force runtime should be O(N^3)
Runtime
Line saying should
"We say
willO(rc)
assumenotthat
O(xy)
the categorizations are based strictly on the origin of the transaction
(i.e., the seller’s name), not the price or date." should be in 9.7, not 9.6
It should
should alsosay "Stop at
validate B[4] =55. Not Found" -- because the value being looked for is 49, not 55.
d<=n
if (a^3+b^3==c^3+d^3
the size of the character&&set.d<=
We n)
assumed that the character set was ASCII.

Removed
Heaps underlast"Extract
two linesMin"
under Solution
code do not #1 that didn't
actually depictapply
heapstothat
thatwere
solution
initially valid. Replace all
instances of 80 with 96 to make it valid.
Changed put and remove to return values
Changed
K+1 "elsesums
different break"
wetocan
"else return"
make. Therefore, the table really has (K+1)2 cells, and the runtime is O(K2).".
Solution #3 -- There are only K+1 (not K) ways
Added a clarification that the grid is all white
Clarified that rand() returns an integer
Changed
Assumes numberStack.push(/) to at
that tallest two bars are operatorStack.push(/)
each
* end. */"
Changed >> to >>> to handle negative numbers
Corrected as-of (version number on copyright page +
date) number 6.015007017017042 (Amazon
Version
orders after
Version July 6.015007017017042
number 20, 2015) (Amazon
orders after
Version July 6.015007017017042
number 20, 2015) (Amazon
orders after July 20, 2015)
Version number 6.015007017017042 (Amazon
orders
Versionafter July 6.015007017017042
number 20, 2015) (Amazon
orders after July 20, 2015)
Version number 6.015007017017042 (Amazon
orders after
Version July 6.015007017017042
number 20, 2015) (Amazon
orders after
Version July 6.015007017017042
number 20, 2015) (Amazon
orders after
Amazon Julyafter
orders 20, 2015)
about February 10, 2016 (see
copyright page for
Amazon orders compilation
after date) 10, 2016 (see
about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyright page for compilation date) 10, 2016 (see
Amazon orders after about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyrightorders
Amazon page for compilation
after date) 10, 2016 (see
about February
copyright page for compilation date)
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME? #NAME? #NAME? #NAME? ### ###
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
#NAME? #NAME?
Type Reported By Chapter / Problem Chapter Name Page
Spelling / Grammar / Typo CM 4 4
Technical 103
Spelling / Grammar / Typo GS VII Questions
Technical 67
Spelling / Grammar / Typo VII Questions 61
Spelling / Grammar / Typo TA XI Advanced Topics 631
Spelling / Grammar / Typo OM 6 6 120
Spelling / Grammar / Typo OM 4.1 4.1 109
Spelling / Grammar / Typo DW 9.2 9.2 378
Spelling / Grammar / Typo AW 5.3 5.3
Spelling / Grammar / Typo LK 6.10 6.10 299
Spelling / Grammar / Typo PS 4.8 258
Spelling / Grammar / Typo MO 13.5 436
Description
Is it CORRECTED in
your printing?
and
postOrderTraversal
(1, 3), (3, 5), (5, 7), Version number 6.015007017017042 (Amazon orders after July 20, 2015)
(7, 9). on a
memory Version number 6.015007017017042 (Amazon orders after July 20, 2015)
typical machine.
log10(p) = Version number 6.015007017017042 (Amazon orders after July 20, 2015)
log2(p)/log2(10)
even or x <= 5) Version number 6.015007017017042 (Amazon orders after July 20, 2015)
should
with 4.4 read 4/5 Version number 6.015007017017042 (Amazon orders after July 20, 2015)
BFS should say Version number 6.015007017017042 (Amazon orders after July 20, 2015)
O(k^q)
will join ..........". Amazon orders after about February 10, 2016 (see copyright page for compilation date)
work as long as Amazon orders after about February 10, 2016 (see copyright page for compilation date)
2^T >= B, ....
will be the nodes Amazon orders after about February 10, 2016 (see copyright page for compilation date)
under x’s sibling."
isComparable to Amazon orders after about February 10, 2016 (see copyright page for compilation date)
Comparable Amazon orders after about February 10, 2016 (see copyright page for compilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
Type Date Reported By Chapter / Problem Chapter Name
Minor 7/17/2015 AR 1.5 1.5
Minor 7/17/2015 AR 1.4 #VALUE!
Minor 9/11/2015 RV 8.4
Minor 2/2/2016 DM 4.12
Minor 2/3/2016 CC 3.5
Minor 2/4/2016 VM 1.3
Minor 2/4/2016 SS, Gayle 16.24
Minor 2/4/2016 GM 16.3
Minor 2/4/2016 GV 16.12
Minor 2/4/2016 KDS 4.7
Minor 2/4/2016 ES Big O
Minor 2/4/2016 ES 8.7
Minor 6/12/2016 FR 17.5
VI Technical
Minor 6/13/2016 SS Questions
VI Technical
Minor 6/13/2016 EC Questions
Minor 6/13/2016 EW 4
Minor 6/13/2016 MV 12.6
Minor 6/13/2016 MT 16.11
Minor 6/13/2016 LE 5.6
Page Description
199
196
349
274
238
194
411
465
182
254
51
357
536
75
68
104 71
427 333
488 384
286 216
Is it CORRECTED in
your printing?
pointer for longer
string
ricValue(‘a’) + 1]; Version number 6.015007017017042 (Amazon orders after July 20, 2015)
space or time Version number 6.015007017017042 (Amazon orders after July 20, 2015)
complexity.
ault(key, 0) + Amazon orders after about February 10, 2016 (see copyright page for compilation date)
delta;"
copy solution back Amazon orders after about February 10, 2016 (see copyright page for compilation date)
into stack
Adding bounds Amazon orders after about February 10, 2016 (see copyright page for compilation date)
check on
lt(key, line
0) + 9
delta); Amazon orders after about February 10, 2016 (see copyright page for compilation date)
}
isBetween(start1, Amazon orders after about February 10, 2016 (see copyright page for compilation date)
start2,
-->end1))"
string value Amazon orders after about February 10, 2016 (see copyright page for compilation date)
END" } Amazon orders after about February 10, 2016 (see copyright page for compilation date)
}
Total runtime is Amazon orders after about February 10, 2016 (see copyright page for compilation date)
O(n*n!). Amazon orders after about February 10, 2016 (see copyright page for compilation date)
runtime should be Amazon orders after about February 10, 2016 (see copyright page for compilation date)
O(N^3)
looked for is 49,
not 55.
(a^3+b^3==c^3+d
^3
with 96d<=
&& n) it
to make
valid.
break" to "else
return"
There are only K+1
(not
to K) ways
handle negative
numbers
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
Type Reported By Chapter / Problem Chapter Name Page
Clarification SB 4.12 258
Clarification MV 16.22 512
Clarification MV 16.23 518
Clarification MT 17.21 599
Description

404
409
475
Is it CORRECTED in
your
as printing?
solutions don't
rely on this. that
clarification Amazon orders after about February 10, 2016 (see copyright page for compilation date)
the gridreturns
rand() is all white
an
integer
at each
* end. */"
mpilation date)
 Chapter / Chapter
Type Date Reported By Problem Name Page
Enhancement 9/16/2015 AM 4.12 275
Enhancement 9/16/2015 AM 4.8 257
Enhancement 9/21/2015 SL 5.3 280
Enhancement 9/21/2015 GV 4.10 265
Enhancement 2/3/2016 BS 1.4 196
Enhancement 2/4/2016 MT 2.6 162
Enhancement 2/4/2016 GM 8.9 360
Enhancement 2/4/2016 AV 5 79
Enhancement 2/4/2016 ML 17.18 589
Enhancement 2/6/2016 Gayle 8.2 346
Enhancement 6/13/2016 KR 1.2 194
Enhancement 6/13/2016 MV 7.12 339
Description

263
Is it CORRECTED in
your printing?
complexity to O(log
N)
(intersection of two Amazon orders after about February 10, 2016 (see copyright page for compilation date)
linked lists)
maxLength; Amazon orders after about February 10, 2016 (see copyright page for compilation date)
}pre-order traversal. Amazon orders after about February 10, 2016 (see copyright page for compilation date)
Updated return
code. -1; Amazon orders after about February 10, 2016 (see copyright page for compilation date)
null;} Amazon orders after about February 10, 2016 (see copyright page for compilation date)
} } Amazon orders after about February 10, 2016 (see copyright page for compilation date)
} num &
return Amazon orders after about February 10, 2016 (see copyright page for compilation date)
mask;
allLocations; Amazon orders after about February 10, 2016 (see copyright page for compilation date)
}
hashmap to Amazon orders after about February 10, 2016 (see copyright page for compilation date)
hashset
ASCII. Amazon orders after about February 10, 2016 (see copyright page for compilation date)
remove to return
values
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
mpilation date)
Type Date Reported By Chapter / Problem Chapter Name
Correction 9/14/2015 ZY 4.12
Page Description
272
Is it CORRECTED in
your printing?
totalPaths;
} Amazon orders after about February 10, 2016 (see copyright page for compilation date)
mpilation date)
Chapter Number Chapter Name
1 Arrays and Strings
2 Linked Lists
3 Stacks and Queues
4 Trees and Graphs
5 Bit Manipulation
6 Math and Logic
7 Recursion
Object-Oriented Design
and Dynamic
8 Programming
9 Scalability and Memory Limits
10 Sorting and Searching
11 Testing
12 C and C++
13 Java
14 Databases
15 Threads and Locks
16 Moderate
17 Hard