- Output a list that has all the keys and values in one hash table and if the key exists in the second table, return the value else Null.
- Return the keys and values.
- Ensure your tests are passing before you submit your solution.
- Create a list for the output
- Run a loop through out the index in the storage
- Set a tracker for current in the storage nodes
- Do a while loop till the nodes are not null
- Create an Array of size 3
- Check to see if the values exists in the second table
- If the key exits, add it to the third index of the array
- Else return Null
- Return the list.
-
Space Complexity O(n)
-
Time Complexity O(n)