The two algorithm questions are not difficult. One is about K-complementary pairs in an array. They expect you to solve it with O(nlogn) time and O(n) space, but there is a faster solution with O(n) time and O(n) space. The other algorithm is about calculating the number of jumps before you jump out an array. If you can not jump out the array, then return 0 jumps. The key is to use a Set (C++) or HashSet (C#) to check if there is a jumping circle or not. This problem can be solved with O(n) time and O(n) space.