Bit Set Problem Statement

You are provided with a string, termed as DIGIT_PATTERN, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no repeating digit, the result should be -1.

Example:

Input:

123456325

Output:

3

Explanation:

In the given string 123456325, as we move from left to right, digit '3' is the first to repeat, making it our answer.

Constraints:

1

Question

Bit Set Problem Statement

You are provided with a string, termed as DIGIT_PATTERN, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no repeating digit, the result should be -1.

Example:

Input:

123456325

Output:

Explanation:

In the given string 123456325, as we move from left to right, digit '3' is the first to repeat, making it our answer.

Constraints:

1 <= T <= 10
1 <= |DIGIT_PATTERN| <= 10^5
0 <= DIGIT_PATTERN[i] <= 9

Note:

You do not need to print anything; just return the answer for each test case.

Accepted Answer

Identify the first repeating digit in a given string of digits.

Iterate through the string and keep track of seen digits using a set.
Return the first digit that repeats, or -1 if no digit repeats.
Time complexity: O(n), where n is the length of the input string.

Asked in Grey Orange