Leetcode 706. Design HashMap

Implement a HashMap for integer keys/values without using built-in hash table libraries that supports put, get, and remove operations. The core challenge is to design a hashing and collision-resolution strategy (e.g., chaining or open addressing) to achieve expected O(1) time per operation given keys/values ≤ 10^6 and up to 10^4 calls.