FastPrepFastPrep
Problem Brief

Find Number of Possible Unique Strings 🍏

OA
See Amazon online assessment and hiring insights

Given a string of lowercase characters, pick substring of any length in it and reverse them. Find the number of possible unique strings.

Function Description

Complete the function findNumberOfPossibleUniqueStrings in the editor.

findNumberOfPossibleUniqueStrings has the following parameter:

  • String s: the input string

    • Returns

    int: the number of possible unique strings

    1Example 1

    Input
    s = "abc"
    Output
    4
    Explanation
    Possible unique strings: Substring of length 1: Reversing a single character results in same original string. For example reverse a in abc, gives abc Substring of length 2: Reverse ab (substring of length 2) in abc results in bac Reverse bc (substring of length 2) in abc results in acb Substring of length 3: Reverse abc (substring of length 3) in abc results in cba So return result as 4

    Constraints

    Limits and guarantees your solution can rely on.

  • The length of the input string is 1 to 105
    • public int findNumberOfPossibleUniqueStrings(String s) {
  // write your code here
}
    Input

    s

    "abc"

    Output

    4

    Sign in to submit your solution.