Neighboring Record IDs

You are given records in their current order. Each record is a string whose id appears before the first | character. For each queried id, return the previous and next record ids in the original order.
The answer for one query should be formatted as previousId,nextId. Use None for a missing neighbor or for both values when the queried id is not present.

Function
queryNeighborIds(records: String[], queries: String[]) → String[]

Examples
Example 1
records = ["a|red","b|blue","c|green","d|yellow"]
queries = ["a","c","x"]
return = ["None,b","b,d","None,None"]
a has no previous id, c is between b and d, and x is not present.
Example 2
records = ["id7|one"]
queries = ["id7"]
return = ["None,None"]
A single record has no neighbors.

Constraints
Record ids are unique.

Parse each record by taking everything before the first | character. That's your id. Ids are unique, so you can build a map from id to its index in one pass. Then for each query, look up the index. If it's missing, output "None,None". Otherwise the previous id is the parsed id at index-1 (or None if index is 0), and the next id is at index+1 (or None if it's the last). Store the parsed ids in a separate array so you don't re-split strings per query. The common pitfall is splitting on every | and grabbing the wrong piece, or using a linear search per query and timing out on large inputs. Another one: a record value may itself contain a | character, so only cut at the first one. Output format is previousId,nextId with a comma and no space. StealthCoder is the hedge if the format details slip under pressure.

If you see this problem in your OA tomorrow, the play is to recognize the pattern in 30 seconds. StealthCoder buys you that recognition.