How should I practice No Adjacent Characters?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Nutanix online assessment problems in FastPrep.

Is No Adjacent Characters associated with Nutanix?

FastPrep tags this as a Nutanix online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

No Adjacent Characters

Learn this problem

● Easy

NutanixOA

Problem statement

Given a string s, determine whether its characters can be rearranged so that no two adjacent characters are the same. A rearrangement uses every character of s exactly once.

Return "POSSIBLE" if the string already satisfies the condition or if such a rearrangement exists. Otherwise, return "NOT POSSIBLE".

Function

canRearrangeString(s: String) → String

Examples

Example 1

s = "aab"return = "POSSIBLE"

The characters can be rearranged as "aba", which has no equal adjacent characters.

Example 2

s = "aa"return = "NOT POSSIBLE"

Both characters are equal, so every rearrangement still places them next to each other.

Problem statement

Function

Examples

Example 1

Example 2

More Nutanix problems