FastPrepFastPrep
Problem Brief

First Unique Character (Data & Analytics)

INTERNOA

A unique character is one that appears only once in a string. Given a string consisting of lowercase English letters only, return the index of the first occurrence of a unique character in the string using 1-based indexing. If the string does not contain any unique character, return -1.

Function Description

Complete the function getUniqueCharacter in the editor below.

getUniqueCharacter has the following parameter(s):

  • string s: a string

Returns

int: either the 1-based index or -1

✎ᝰ.Credit to chizzy_elect ᝰ.ᐟ 🧡˚

1Example 1

Input
s = "statistics"
Output
3
Explanation
The unique characters are [a, c] among which a occurs first. Using 1-based indexing, it is at index 3.

2Example 2

Input
s = "hackthegame"
Output
3
Explanation
The unique characters are [c, k, t, g, m] out of which the character c occurs first, at index 3 :)

Constraints

Limits and guarantees your solution can rely on.

  • 1 ≤ length of s ≤ 10^5
  • The string s consists of lowercase English letters only.
public int getUniqueCharacter(String s) {
  // write your code here
}
Input

s

"statistics"

Output

3

Sign in to submit your solution.