Time Based Key-Value Store

Design set and get methods in this Uber problem to handle strictly increasing inputs, retrieving values for the largest timestamp at or below a target.