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.
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
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"]] return = [490, 107]
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"]] return = [764, 341]

- Count Ideal NumbersOA · Seen Jun 2026
- Count Descending SubarraysOA · Seen Apr 2026
- Count Power Products in RangeOA · Seen Apr 2026
- Minimum Operations to Make Alternating Binary StringSeen Feb 2026
- Minimum Number of Non-Empty Disjoint SegmentsSeen Feb 2026
- Count Unstable ProcessesOA · Seen Feb 2026
- Longest Balanced Binary SubarrayOA · Seen Feb 2026
- Process Execution TimeOA · Seen Nov 2025
public int[] getQueryAnswers(String[][] cacheEntries, String[][] queries) {
// write your code here
}