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.
sql : how would you get data from table A that is not in table b using join
HR: Ask some questions about the complexity
Questions about SQL, PLSQL, Python and Probability.
If you were given a business card written entirely in Japanese, how would you go about finding the location of the business?
What is the difference between ospf and eigrp
No technical questions.
What is the CAP theroem? Can you explain me what happens in different cases when applying it?
Given a list of user record, select out unique users in one city
Vous recherchez exactement quoi aujourd’hui ?
Viewing 121 - 130 interview questions