Implement lazy array and KV store

You are asked two coding problems in the same interview round: 1. **Implement a lazy array abstraction** - Create a `LazyArray<T>` that wraps an input list. - It should support chained transformations such as `map` and `filter`. - Intermediate transformations must be recorded but **not executed immediately**. - Computation should happen only when a terminal operation is called, such as `toList()`, `reduce()`, or `get(index)`. - In addition to implementation, explain how you would test that the class is truly lazy and does not accidentally evaluate work early. 2. **Implement an in-memory key-value store with hit counting** - Support `put(key, value)`, `get(key)`, `delete(key)`, and `getHitCount(key)`. - Each successful `get` on an existing key should increment that key's hit counter. - Define the expected behavior for missing keys and for overwriting existing values. - Aim for clear APIs and efficient basic operations.