Amazon Hackon coding round problem | Character Traversal | Lamp and Houses

This was a screening test to qualify for the Amazon HackOn competition. It was a 90 minute test with 2 problems. Problem 1 You are given a string s and a list of bidirectional edges representing connections between characters. Your task is to determine the last character in the string that can be reached starting from the first character of the string using the given connections. If no such character exists, return -1. Input Format The first line contains an ...