Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

​

Flashcards Review

Flashcards Review

Use these cards to review the Array chapter before you take the checkpoint. Each card shows a question on the front and a short answer on the back. Answer it in your head first, then flip the card. The deck covers what an array is, how memory layout makes index access cheap, static and dynamic arrays, the cost of every basic operation, how the six languages in this course handle arrays, and the ideas behind the four problems you solved.

.....

.....

.....

Like the course? Get enrolled and start learning!
Jeremiah Stones

Jeremiah Stones

· 5 days ago

For Contains Duplicate, this says to offer sorting when extra space is ruled out, but that depends on the sorting implementation. For example, Python’s Timsort can use O(n) auxiliary space, so using the standard library sort does not satisfy a strict O(1)-extra-space requirement. It may be worth specifying that this alternative assumes an in-place sorting algorithm such as heapsort.

Show 1 reply

Reading Progress

0%

Vote for new content