Screening Round: 2 coding questions, 1st one was moving avarage. 2nd problem was to find nearest island from a starting point(BFS).

ONSITE:
Round 1(Coding): Populating Next Right Pointers in Each Node, I was able to solve within 10 mins using queue.The 2nd coding question was to find the union of two list of intervals(sorted and non over lapping).

e.g. list 1([1,3], [5,6], [8, 10)
     list 2([2,4], [7,11])
	 
	 ans: [1,4], [5,6], [7,11]
	 
	 I was not able to solve the problem,possible reason for rejection.

Round 2(Coding): 1st problem was Print a linked list backward, 2nd problem Minimum Knight Moves. I was able to solve both within 40 mins.

Round 3(Design): Design a streaming service for registered user (e.g. Netflix), went well.

Round 4(Coding): 1st problem was Kth Largest Element in an Array, I was able to solve using heap. 2nd problem was clone a Graph. I was able to solve the problem using DFS.

Round 5(Behavioural): This was mostly project discussions and behavioural questions, went well.

Time and space complexity was asked for all the coding rounds.