Showing 3 of 25 questions
You are given a grid of oranges, some fresh, some rotten. Rotten oranges contaminate adjacent fresh oranges; find the minimum time until all oranges are rotten.
#1. Rotting Oranges
Design a key-value store that supports storing values associated with timestamps. You should be able to retrieve the value for a given key at the latest timestamp less than or equal to a given time.
#2. Time Based Key-Value Store
Implement a function to read characters from a file using a provided read4 API, but the read function can be called multiple times, so you need to handle internal buffering.
#3. Read N Characters Given read4 II - Call Multiple Times