Expiring Cache

Data Structures Simulation Cache

You are tasked with designing and implementing a time-based cache that supports expiration of keys. The cache should support the following operations:

  1. put(key, value, ttl): Insert the key with the associated value into the cache. The key should expire after a specified time-to-live (ttl) given in seconds.

  2. get(key): Return the value associated with the key if it exists and has not expired. If the key does not exist or has expired, return -1 (or an appropriate indicator).

  3. tick(seconds): Simulate the passing of time by advancing the internal clock by the given number of seconds. This may cause some keys to expire.

Implement the cache so that all operations are handled efficiently. Assume the system starts at time 0 and that time advances only through the tick function. Your implementation should correctly manage expired keys and ensure that expired keys do not affect subsequent get operations.

Provide a complete solution in the programming language of your choice.