Giving back. Goodluck :)

Phone Screen

1. Implement MagicMap's following methods, where k is string and v is int
   get(k)
   put(k, v)
   putall(v), which changes all the values of the dictionary to v
2. Count the number of monotonic subarrays(both increasing and decreasing) in a given array of nums

On-Site

• System Design: Design Leetcode

• Coding:

1. Next Permutation
2. Range Sum
3. Merge 3 sorted arrays, variant of https://leetcode.com/problems/merge-sorted-array/description/
4. Find valley or plain (3 ints where the middle int is less than its neighbors or all 3 are the same value), variant of https://leetcode.com/problems/find-peak-element/description

• Behavioural:
  Tell me a time you...
  took initiative
  had pushback on your design
  had a conflict with a difficult coworker (it's okay if you don't have one)
  had to deal with ambiguous requirements. Follow up: did you need to take any risks?
  you learned something by following another person's example
  Tell me about an area you want to grow in, and what steps you have taken to achieve it

ETA: I got rejected. Better luck to everyone else!