The interview was so easy. i got these questions

Round 1:

• Havining stream of data find the max number in buffer size of k
  ex stream {1,2,3,4,3,2,7} , k=3
  1-> {1} max= 1
  2-> {1,2} max= 2
  3-> {1,2,3} max= 3
  4-> {2,3,4} max= 4
  3-> {3,4,3} max= 4
  2-> {4,3,2} max= 4
  7-> {3,2,7} max= 7
  Solved using Queue + TreeSet
  complexity O(N logk)

Round 2:

• https://leetcode.com/problems/design-circular-deque/
  Solved using double linked list. Complexity O(1)

Round 3:

• https://leetcode.com/problems/palindrome-linked-list/
  Solved using stack for holding half of data + slow and fast pointer.
  complexity O(n/2)

Round 4: [System desgin]

• Desgin video renting system

I have no idea why reject.