Pergunta de entrevista da empresa Uber

ese are usually LeetCode medium–hard: Implement LRU Cache. Given a stream of integers, design a system to return the kth largest element at any time. Find the shortest path between two nodes in a graph (Dijkstra, BFS).