SDE - 2

Ninja loves playing with numbers. One day Alice gives him some numbers and asks him to find the Kth largest value among them.

You are given a Circular Linked List of integers, and an integer, 'key'.

You have to write a function that finds the given key in the list and deletes it. If no such key is present, then the list remains unchanged.

For Example :

This is a visualization of the Circular Linked List, represented by:
1 2 3 4 5 -1

Note :

The Circular Linked List before/after deletion may happen to be empty. In that case, only print -1.

All integers in the list are unique.

I was asked to design a rate limiter where a single user can make 5 requests in a minute. If the user raises more requests than that, then that will be terminated with a message that you have reached out the limit, please try again after 1 minute.

It was a general discussion round, asked about my prior project experience and the challenges faced. 

Then he told me about the team and project and tech stack.