Oracle·Software Engineer·Technical Phone Screen
- Given k sorted singly linked lists where each node holds a key-value pair, merge them into a single sorted list. If the same key appears in multiple lists, the value from the higher-indexed list should win. What's your approach and complexity?
“My first instinct was just a standard k-way merge with a min-heap and I started coding that up before fully reading the tie-breaking part.”