Amazon·Software Engineer·Online Assessment (OA)
- Given an integer array of values and a binary string representing which indices are currently available, build a sequence of length m by repeatedly picking an available index and appending its value. After each pick, any index immediately to the right of an available index gets unlocked. Return the lexicographically largest sequence possible.
“This one took me a while to even parse the problem statement.”