Odd One Out

Problem Overview

• Given a list of uppercase strings, identify the single string whose adjacent-letter difference pattern is unique.
• Input: series[n] of A–Z strings, all the same length (2–26); 3 ≤ n ≤ 26; Output: the odd one out string.
• Domain: pattern recognition and string analysis based on alphabet position differences.
• Source: Mathworks interviews; this is a coding interview problem and a common interview question.