(Before the Interview) What you need to know

Question 1

Linked Lists

Answer 1

Linear collection of elements, called nodes, each pointing to the next by means of a pointer

Question 2

Binary Trees

Answer 2

A tree structure where each node has at most 2 children

Question 3

Stacks

Answer 3

Collection of elements where popping an item returns the last item pushed to the list

Question 4

Queues

Answer 4

Collection of elements where popping an item returns the first item added to the list not yet removed (removal of entities from the terminal position

Question 5

Vectors / ArrayList

Answer 5

One dimensional array

Question 6

Hash Tables

Answer 6

Associative array mapping keys to values

Question 7

Breadth-first search

Answer 7

Explores all neighbors in a level of a tree before moving to children (all nodes in next level)

Question 8

Depth-first search

Answer 8

Explores as far as possible along each branch until backtracking

Question 9

Binary Search

Answer 9

Finds target value in sorted array by recursively searching each half-interval

Question 10

Merge sort

Answer 10

Recursively divides by 2 and sorts each half-interval of array. Last step 2 halves are returned and these sorted halves are merged

Question 11

Quick Sort

Answer 11

Recursively pick a pivot, partition and sort left and right halves. Base case is of a pivot position with 0 or 1 on either side of the pivot.

Question 12

Tree Insert

Answer 12

?

Question 13

Bit manipulation

Answer 13

?

Question 14

Factory Design Pattern

Answer 14

?

Question 15

Memory (Stack vs Heap)

Answer 15

?

Question 16

Recursion

Answer 16

?

Question 17

Big-O Time

Answer 17

?