How should I practice Minimal Unique Segments?

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

Is Minimal Unique Segments associated with Amazon?

FastPrep tags this as a Amazon coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · String

Minimal Unique Segments

Learn this problem

● EasyAmazonINTERNOA

See Amazon hiring insights

Problem statement

Your team at AMZ is currently working on an innovative algorithm to generate password suggestions when users create a brand-new account.

Imagine a string composed solely of lowercase English letters that qualifies as "redundancy-free" — meaning that each individual character appears at most once within that string. To ensure minimal repetition, the developers want to suggest a password that can be split into the smallest number of these redundancy-free segments.

In this challenge, you are provided with an input string called userPassword. Your task is to determine the minimum number of segments into which userPassword can be partitioned so that every segment is redundancy-free.

Function

minimalUniqueSegments(userPassword: String) → int

Complete the function getNumberRedundancyFree in the editor.

getNumberRedundancyFree has the following parameter:

string userPassword: the given password

Returns

int: The minimum number of segments required to divide the string into redundancy-free parts :)

Examples

Example 1

userPassword = "aabcdea"return = 3

The password can be partitioned into a minimum of 3 valid segments. Return 3.

Example 2

userPassword = "alabama"return = 4

The minimum partitions are "al", "ab", "a", "ma".

Example 3

userPassword = "zebra"return = 1

Constraints

1 ≤ length of userPassword ≤ 10^5
All characters in userPassword are lowercase English letters.