No Adjacent Characters

Problem Overview

• Given a string where one character may repeat, decide if it can be arranged so no two adjacent characters are the same.
• Input: string s; Output: "POSSIBLE" if already valid or rearrangeable, else "NOT POSSIBLE".
• Constraints: N/A.
• Domain: string processing and validation in text-handling scenarios.
• A coding interview problem and interview question asked in Nutanix interviews.