Implement lazy array and KV store

Part 1: LazyArray

Implement a LazyArray class that supports a sequence of transformations without executing them until the values are explicitly requested. The class should store an initial base list and a list of transformation functions (e.g., map, filter).

• __init__(self, data): Initializes the array.
• map(self, func): Chains a transformation to be applied to every element.
• filter(self, predicate): Chains a filter to keep only elements satisfying the predicate.
• compute(self): Applies all chained operations in order and returns the resulting list.

Example:

arr = LazyArray([1, 2, 3, 4])
arr.map(lambda x: x * 2).filter(lambda x: x > 5)
print(arr.compute()) # Output: [6, 8]

Part 2: Instrumented KV Store

Design a key-value store class KVStore that maintains a count of how many times each key is accessed (via get).

• put(key, value): Stores a value.
• get(key): Returns the value and increments its access count.
• get_hit_count(key): Returns the current access count for the key.

Constraint: Ensure operations are efficient. Consider how the store handles missing keys.

Constraints & Edge Cases

• LazyArray: Operations should be O(1) until compute() is called. compute should be O(N * M) where N is the number of elements and M is the number of operations.
• KVStore: All operations should aim for O(1) average time complexity.
• Consider empty inputs for LazyArray and requesting counts for keys that were never put.