Position: L4\n\nGiven two strings, find the index of the extra character that only appears in one of the strings.\n\n**Example 1:**\n```\nInput: s = "wxgyz", t = "wxyz"\nOutput: 2\n```\n\n**Example 2:**\n```\nInput: s = "bxbbb", t = "bbbb"\nOutput: 1\n```\n\nEDIT: Can this be solved in faster than linear time? Bc I know you can easily loop over it/use a hash map but that answer wasnt acceptable

Position: L4\n\nGiven two strings, find the index of the extra character that only appears in one of the strings.\n\nExample 1:\n\nInput: s = "wxgyz", t = "wxyz