Predict output when iterating ordered keys

Q: Predict output when iterating ordered keys

This question evaluates understanding of ordered maps, iteration semantics, reverse traversal and accumulation of values in code. It is commonly asked in Coding & Algorithms interviews to test the ability to reason about iteration order, sentinel return values and summation behavior, and it examines practical application of data-structure semantics rather than purely abstract theory.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Assume you have a data structure global_var[a][time] that behaves like an ordered map:

Keys ( time ) are kept in sorted ascending order.
order(map, key, dir) returns the next key after key .
- If dir = 1 , it returns the next higher key.
- If dir = -1 , it returns the next lower key.
- If key = "" , then order(map, "", 1) returns the smallest key and order(map, "", -1) returns the largest key.
- If there is no next key, it returns "" .

Given:

global_var["A"] = {
  2:  5,
  4:  6,
  9:  1,
  15: 3
}

And this pseudocode:

time = ""
sum = 0
visited = []

while true:
  time = order(global_var["A"], time, -1)
  if time == "":
    break
  visited.append(time)
  sum = sum + global_var["A"][time]

print(visited)
print(sum)

Task: What does the program print (the visited list and sum)?

Predict output when iterating ordered keys

Quick Overview

Comments (0)