Implement a prototype of a simple cache query handler.
There are n entries stored in the cache. Each entry is of the form {timestamp, key, value}, where time stamp represents the time at which the entry was stored in the cache entry, and value represents the data value of the entry, an integer represented as string. The keys assigned to the cache entries may not be unique. The cache query handler receives q query requests, where each query is of the form {key, timestamp}, where key represents the ID of the query entry to find, and timestamp represents the time the enry was added.
Given 2 2d arr of strings, cache_entries, and queries, of sizes n X 3 and q X 2 respectively, return an arr of size q with the data values for each query.
Function Description
Complete the function getQueryAnswers in the editor.
getQueryAnswers has the following parameters:
string cache_entries[n][3]: the cache data entriesstring queries[q][2]: the queries
Returns
int[q]: the answers to the queries
Example 1:
Input: cache_entries = [["01:34:05", "l66klkph", "352"], ["56:38:37", "8pvj20oo", "107"], ["36:17:33", "r0v06eec", "180"], ["20:34:20", "e15y6dv4", "490"]], queries = [["e15y6dv4", "20:34:20"], ["8pvj20oo", "56:38:37"]]
Output: [490, 107]
Explanation::)
Example 2:
Input: cache_entries = [["12:30:22", "a2er5i80", "125"], ["09:07:47", "ioO9ju56", "341"], ["01:23:09", "a2er5i8O", "764"], ], queries = [["a2er5i8O", "01:23:09"], ["ioO9ju56", "09:07:47"]]
Output: [764, 341]
Explanation:queries[0] corresponds to the data entry at index 2, with value = "764" queries[1] corresponds to the data entry at index 1, with value = "341"Return [764, 341] :)
- 1 ≤ n ≤ 10^5
- 1 ≤ q ≤ 10^5
- 1 ≤ int(cache_entries[i][2]) ≤ 10^8
- cache_entries[i][0] represents a valid timestamp in the format hh:mm:ss
- size(cache_entries[i][0]) = 8
- cache_entries[i][1] is an alphanumeric value, consisting of only lowercase English letters (a-z) and digits (0-9)
- It is guaranteed that the queried {key, timestamp} pair is present in the cache.
- At a particular timestamp, there can be no duplicate keys.
input:
output: