1// Create a HashTable class
2class HashTable {
3    // Define the initial size of the hash table
4    private final int INITIAL_SIZE = 16;
5    // Use an array of HashEntry objects to represent the hash table
6    private HashEntry[] entries;
7
8    // Constructor
9    public HashTable() {
10        entries = new HashEntry[INITIAL_SIZE];
11    }
12
13    // Method to insert key-value pairs into the hash table
14    public void put(String key, String value) {
15        // Calculate the index based on the hash code of the key
16        int index = getIndex(key);
17
18        // Create a new HashEntry object
19        HashEntry entry = new HashEntry(key, value);
20
21        // Check if the index is empty
22        if (entries[index] == null) {
23            entries[index] = entry;
24        } else {
25            // Traverse the chain of entries at the index
26            HashEntry current = entries[index];
27
28            // Check if the key already exists
29            while (current.next != null) {
30                if (current.key.equals(key)) {
31                    // Key already exists, update the value
32                    current.value = value;
33                    return;
34                }
35
36                current = current.next;
37            }
38
39            // Check the last entry
40            if (current.key.equals(key)) {
41                // Key already exists, update the value
42                current.value = value;
43            } else {
44                // Add the new entry to the end of the chain
45                current.next = entry;
46            }
47        }
48    }
49
50    // Method to update the value associated with a key in the hash table
51    public void updateValue(String key, String value) {
52        // Calculate the index based on the hash code of the key
53        int index = getIndex(key);
54
55        // Traverse the chain of entries at the index
56        HashEntry entry = entries[index];
57
58        // Check if the key exists
59        while (entry != null) {
60            if (entry.key.equals(key)) {
61                // Key found, update the value
62                entry.value = value;
63                return;
64            }
65
66            entry = entry.next;
67        }
68    }
69
70    // Method to calculate the index based on the hash code of the key
71    private int getIndex(String key) {
72        int hashCode = key.hashCode();
73        int index = Math.abs(hashCode) % entries.length;
74
75        return index;
76    }
77
78    // Inner class to represent the entries in the hash table
79    private class HashEntry {
80        private final String key;
81        private String value;
82        private HashEntry next;
83
84        public HashEntry(String key, String value) {
85            this.key = key;
86            this.value = value;
87            this.next = null;
88        }
89    }
90}