Round 1:
Question 1: Find the element that appears once in an array where every other element appears twice in less than O(n). Array is sorted.
Question 2: https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/amp/
I was eliminated after this round.