Code a data structure which allows us to store and retrieve items by key up to a fixed capacity. When we add items over capacity we free up space by removing an item first: 1) remove any expired item first 2) If there are no expired items, find the items with the lowest priority number, and remove the one which has been used least recently of them Optimise for time.
Why are you interested in this position?
A & B toss a die, whoever gets 6 first wins. Given A starts first, what's the probability that A can win?
Probability question and a case study
a brief introduction of yourself. And then a question that you have to solve it in python.
How do you understand energy efficiency?
Tell me about your previous job?
1. Probability Question 2. Open-ended case studies
What is interchange?
They ask me to do a tableau dashboard
Viewing 711 - 720 interview questions