LeetCode Solutions/April 2022 LeetCoding Challenge/Design HashMap.java
class MyHashMap {
    int[] data;
    /** Initialize your data structure here. */
    public MyHashMap() {
        data = new int[1000001];
        Arrays.fill(data, -1);
    }
    
    /** value will always be non-negative. */
    public void put(int key, int value) {
        data[key] = value;
    }
    
    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
    public int get(int key) {
        return data[key];
    }
    
    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
    public void remove(int key) {
        data[key] = -1;
    }
}

/**
 * Your MyHashMap object will be instantiated and called as such:
 * MyHashMap obj = new MyHashMap();
 * obj.put(key,value);
 * int param_2 = obj.get(key);
 * obj.remove(key);
 */