## Question 1
What should be the output if the following string is given as an input?


str = "conceptoftheday"

### Options

1. 8
Correct
The longest substring without any repeating characters is "oftheday", with a length of 8.
----------------------------

2. 6
Incorrect

----------------------------

3. 5
Incorrect

----------------------------

4. 13
Incorrect

----------------------------

---------------------------------------------

## Question 2
What should be the output if the following string is given as an input?


str = "bbbbbbbbbbbbbbbb"


### Options

1. 5
Incorrect

----------------------------

2. 1
Correct
The longest substring without any repeating characters is the "b", with a length of 1. Since all the characters in the input string are the same, we can't find a substring with a length greater than 1.
----------------------------

3. 16
Incorrect

----------------------------

4. 0
Incorrect

----------------------------

---------------------------------------------

## Question 3
What should be the output if the following string is given as an input?

str = "racecar"

### Options

1. 5
Incorrect

----------------------------

2. 3
Incorrect

----------------------------

3. 4
Correct
The longest substring without any repeating characters is "ecar" or "race", with a length of 4.
----------------------------

4. 8
Incorrect

----------------------------

---------------------------------------------

## Question 4
What should be the output if the following string is given as an input?


str = "bankrupted"


### Options

1. 8
Incorrect

----------------------------

2. 10
Correct
The longest substring without any repeating characters is "bankrupted", with a length of 10. Since all the characters in the input string are unique, the entire input string is the output. 
----------------------------

3. 4
Incorrect

----------------------------

4. 5
Incorrect

----------------------------

---------------------------------------------