The complete process was online.

I was asked to solve one Data Structures and Algorithms question in one hour.

A lot of focus was given to Multithreading and Concurrency topics.

You are receiving a continuous data stream of integers. You are also given a queue of size k in which you can store this integer stream.

Now, within this queue, your task is to find the minimum absolute difference possible between any two integers and return it.

For example: Integer stream: 1, 2, 8, 4, 7... Queue size: 3 Output: 0, 1, 1, 2, 1...

Note: Initially, the queue is empty. When it receives the first integer (1), it does not have any other number to find a minimum absolute difference with, so it returns 0.