Status: University Graduate
I had two phone interviews before on-site (which I will have in about 2 weeks - keep your fingers crossed :))

1st interview:

• Write a function which returns length of the longest path in acyclic directed graph.
  Modification: what if a graph had cycles?
  Time and space complexity.

2nd interview:

• Check if the number is a power of 7 (number is of type long)
  Modification: what if there is no log function.
  Time complexity
• https://leetcode.com/problems/frog-jump/