inputs stringlengths 559 828 | targets stringclasses 180
values | _template_idx int64 0 9 | _task_source stringclasses 1
value | _task_name stringclasses 1
value | _template_type stringclasses 2
values |
|---|---|---|---|---|---|
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = a
Solution: 5
Why? Using 5 steps, it can become a strong password
New input: password = Wg..kzaadGCI0k3rA5oHlf40NTVDMTVu8RMa!
Solution: | 17 | 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example Input: password = GuuT7KTgWXyeATj007M7em.5wdSRoU8B
Example Output: 12
Example Input: password = zE5u3FOL!bWzvJ8aQEnVduqLEwigpuzX
Example Output: 12
Example Input: password = !t9wbz
Example Output: | 1
| 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Part 1. Definition
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Part 2. Example
password = a
Answer: 5
Explanation: Using 5 steps, it can become a strong password
Part 3. Exercise
password = tXv7g
Answer: | 1 | 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Input: Consider Input: password = ysoiWD80dtyguvD5j3ABWkTyfKWfqZz
Output: 11
Input: Consider Input: password = 9V0nbb8klH3.jO1dGRZNbjys46!EfEpb.Xi6wVl
Output: 19
Input: Consider Input: password = lGslIqaVSqyWn3FsL2g4V72klz.
| Output: 7
| 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = lGslIqaVSqyWn3FsL2g4V72klz.
A: | 7 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = xsqH3d
A: | 0 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = ZBZOidSWdEh
[EX A]: 1
[EX Q]: password = DC007Kc2GEDN3wwQEInAOiskGTl4WPQvkj0b
[EX A]: 16
[EX Q]: password = 5vuAFwunxbpMo9SkgZF93
[EX A]: | 1
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Teacher: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Teacher: Now, understand the problem? If you are still confused, see the following example:
password = a
Solution: 5
Reason: Using 5 steps, it can become a strong password
Now, solve this instance: password = sOgFljLmEA12gGK1Qi!PgFkYZwcL9PLe87Flv1ea
Student: | 20 | 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Input: Consider Input: password = x5u7yPKDgvKokNbmP166cu3SaWU0lcexAuoMwQ9.
Output: 20
Input: Consider Input: password = IpS2vBJLhJ9PG5Mbz
Output: 0
Input: Consider Input: password = olJdTHCheKTsIarVjSgCFJQo
| Output: 5
| 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = QeO2K0CwfVKqHDPqbhKvPGbr2m0MeH9G
SOLUTION: 12
PROBLEM: password = 557vnC4fF
SOLUTION: 0
PROBLEM: password = 0bvGzl3DD9BBJ1r5pGZNCXG73vGnBFcuPCFO!DqJV1tkVktez
SOLUTION: | 29
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = s21QgdF1cE46WpFDpD
A: | 0 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = 1Pu19c1.E5kv135rwZ7MVtLM
answer:
4
question:
password = ZtqRWX
answer:
1
question:
password = Fh08ujBQUHbKt6Yu2qZoExn
answer:
| 3
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = BTY2HesNW!4ieIX7GsQewofst4RzUvSnzHp99hNfvJKPL5Y
[EX A]: 27
[EX Q]: password = jNdBKb
[EX A]: 1
[EX Q]: password = scu2Q!7z6AevhXrpA.q9TKMLiFwWf0H.QwWGFiDDW3j
[EX A]: | 23
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = B39G73NC7Vlvi5VhZzLR9cwt!TeD
Output: | 8 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = TOz
A: 3
****
Q: password = cfBFAHlsvC86mSySLC2tvmsc49AfsTynD3Fdg
A: 17
****
Q: password = .qf9HUjaWhXQ5hnBSyWmry1
A: | 3
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = RagN07UMcbcVLtYJkWKtAUCh
Solution: | 4 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = kqbokpsD
[A]: 1
[Q]: password = KUgs3Gh8f0FRPw4
[A]: 0
[Q]: password = ..hyZJUX.21BU
[A]: | 0
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = iPipwE9THnm5wJXzgYFVr.cFiN6!Zzn
[A]: 11
[Q]: password = eOpqzwAx!Ql2MGVK4whzDkGgsBeSXflqQddlG6
[A]: 18
[Q]: password = AR1H2QyBEgWWRhhdBIu3EQhz
[A]: | 4
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Teacher: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Teacher: Now, understand the problem? If you are still confused, see the following example:
password = a
Solution: 5
Reason: Using 5 steps, it can become a strong password
Now, solve this instance: password = bP1ia3JrR5!fVbjl
Student: | 0 | 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = xhczcadyp7EXwlfBMa8rV2ACmwgSAIRasDVXRqgBSnY
[EX A]: 23
[EX Q]: password = hc2KAVd6F
[EX A]: 0
[EX Q]: password = lzR0alTMTfYAgdkunbr.CkPQa4dQ0JBb00
[EX A]: | 14
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = JqUj8Kq!I7VN4
| Solution: 0 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = sA
Solution: | 4 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = !Lgwec.rMzYOgQdCLprCs7wN
4
password = v25i7J193RmF.EMxvvZ9KUlubmYd!pmEMdf.En
18
password = YIURFtljopmGMdgQIM
| 1
| 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = PPnnyrijZaarx73f
[EX A]: 0
[EX Q]: password = J4CYVgiEyYezwDf!ZSs3VpnEMx9.NB1NQsiSaS
[EX A]: 18
[EX Q]: password = 7R01.pfIWKl
[EX A]: | 0
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Let me give you an example: password = a
The answer to this example can be: 5
Here is why: Using 5 steps, it can become a strong password
OK. solve this:
password = 7lXp!RXhCOlahnF740xIna29a
Answer: | 5 | 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = 7R01.pfIWKl
Output: | 0 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = ZtqRWX
Answer: 1
Question: password = CbZzH3SWE3RAvQRO515udxnheY92jvUZ.gSnnlC
Answer: 19
Question: password = 6UZdpTBw53csED2IPqwwmFC
Answer: | 3
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = a3MC2h2obwDD44V!cEfwHw
Answer: 2
Question: password = L3ysRo3pLd.pksAkS6uO9fHqfa
Answer: 6
Question: password = KiOxUi7PiJj.OJouE22eNI1LLs
Answer: | 6
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Let me give you an example: password = a
The answer to this example can be: 5
Here is why: Using 5 steps, it can become a strong password
OK. solve this:
password = RmxePUpH8v
Answer: | 0 | 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = mSgo78ADW5cV4GIIBNc.1
Solution: | 1 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = PNCp2r1slYRkELp7K4g8yZ0ZaUloAx
10
password = yPttdZ1RnqIj9yvjJfacTu0DfnmwUgY
11
password = C9T
| 3
| 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Input: Consider Input: password = NdM2vK4NA!wQcNltkQ4Fj9X1FmCFXNXX
Output: 12
Input: Consider Input: password = rsgzg1gYBpev55NPN
Output: 0
Input: Consider Input: password = !W2RGcZAd3nIQGdRpUS02qg
| Output: 3
| 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = jn.Q7JCdW10dYF02SANXTUHTE
A: | 5 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = .lDvoyXr!db7NN5M1!A3E.Fy9QiNztXncf
SOLUTION: 14
PROBLEM: password = jNdBKb
SOLUTION: 1
PROBLEM: password = jn.Q7JCdW10dYF02SANXTUHTE
SOLUTION: | 5
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example Input: password = wzvt5dMF!5M6tz7LBT2vdIP0JE
Example Output: 6
Example Input: password = sly0x6qo20duBbsmnLYP4jMoBaiQjFj
Example Output: 11
Example Input: password = 5kTq6zU5FpR7.zdfTJrnlBytRXkDd2LUyz4pwDD.L0eB
Example Output: | 24
| 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = !vc8l8YPebynbiyQm6s!o2
| Solution: 2 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = 6PESlLvNESrdQBsbwroA5KEn
[A]: 4
[Q]: password = zRmtAsXySpsjj.n
[A]: 1
[Q]: password = co21OeRtRoJzbCVh
[A]: | 0
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = kqbokpsD
Answer: 1
Question: password = ZCbpjOLGGJfSOmAw1EK8y5ld4pZm.BLY3CHgcLQBjVnen
Answer: 25
Question: password = 7lXp!RXhCOlahnF740xIna29a
Answer: | 5
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Ex Input:
password = 92Ix16abiXz2K9FJjpe9VV5DPqk
Ex Output:
7
Ex Input:
password = cCJkIk5tbcJ
Ex Output:
0
Ex Input:
password = yeRLBqaFL33mFEXRSraIBsUbDwXn
Ex Output:
| 8
| 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example Input: password = ugE9xYTXMNJl1uIP4
Example Output: 0
Example Input: password = jM7onapaNqjAfn!LmsRT7tdgC14o3
Example Output: 9
Example Input: password = 6IP.lJ3pLYGcg7d3kUVlRweCdE3k!o.
Example Output: | 11
| 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Ex Input:
password = 8qifTnm4d4x8HFYydqTXa1khn53wpx353LmrSLeJYe
Ex Output:
22
Ex Input:
password = bhK84NgHt3Tipg5
Ex Output:
0
Ex Input:
password = fjpcNgEABIykMq3K97VVXHyH.8Ux8
Ex Output:
| 9
| 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = Vwc7ggLGWmWzGPa.xQXnzzo2pP
answer:
6
question:
password = DF9!Lij69xg0TH3FFyzKWVtqB6aVc9rJl2n0qbsKB
answer:
21
question:
password = MeG8n1dbHb!Dj389jtc5E4h.bXvWjIHlA
answer:
| 13
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = PponUB3SM.k2HkK9fNDQSGIohUrdOHb2SPjfQm1ziyWVNQGW
Solution: | 28 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = QYkxwKxY88clGHGr.MXPnM
Solution: | 2 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Teacher: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Teacher: Now, understand the problem? If you are still confused, see the following example:
password = a
Solution: 5
Reason: Using 5 steps, it can become a strong password
Now, solve this instance: password = kfUbfQDuGVIF
Student: | 1 | 2 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = 9f
[EX A]: 4
[EX Q]: password = mWUcmkvctBL8MdkLd
[EX A]: 0
[EX Q]: password = 673kt7KxyBdPlTfbAP
[EX A]: | 0
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = qqklxb!tn09vjyQtyZjwul4YQnw2kEFq
[A]: 12
[Q]: password = yPttdZ1RnqIj9yvjJfacTu0DfnmwUgY
[A]: 11
[Q]: password = quxeRZD0dsYBNdfodb5sW5Br5
[A]: | 5
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = ilYj74bJB1sB
0
password = xDq6qYXlYWFVeL2Q2d8t33MRfv24.5wbhz9mUy23P9R8Uo.
27
password = oL!wdQ2J5IIMrebDQWj8PfADNrccsMgrLcDtBAM5Dfks5W5yv
| 29
| 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = Ym1Ujdu!1Z56zExZ60PGXCDfu5.X
SOLUTION: 8
PROBLEM: password = oyRz4mO8S
SOLUTION: 0
PROBLEM: password = .mn
SOLUTION: | 3
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = P73mm4FqRHAbh5
A: 0
****
Q: password = HLzj5JoHXcS4E2JDA7h4fpYCp5Xao.Iz3gh7xg5gEzeAsuN7
A: 28
****
Q: password = q.StWHHn9gWsQbCh5BXCtziWZelyCuKqFVjh679JmKob6x
A: | 26
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = yel!1XYi7hT8je1iVezEeg
answer:
2
question:
password = 47Dmv4ERSyqXeKLsNGafVKS0HC
answer:
6
question:
password = RJRn4nGgi
answer:
| 0
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = ppj8K
A: | 1 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = 5VkU0QN
SOLUTION: 0
PROBLEM: password = 01Aqjm.LfTekVgRofeGlD2
SOLUTION: 2
PROBLEM: password = LkhZc8yqQ8YGJSsZ
SOLUTION: | 0
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example Input: password = T82KZKza!u1yfdR
Example Output: 0
Example Input: password = .XaiMSwhhVz!LhS247Bq
Example Output: 0
Example Input: password = 8qifTnm4d4x8HFYydqTXa1khn53wpx353LmrSLeJYe
Example Output: | 22
| 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = RMDRT91
A: 1
****
Q: password = vUmtz8dHqqgbnKdG3HfQ
A: 0
****
Q: password = EvY.yQLw.Romb
A: | 1
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = Zb4jh8exEykn6hXigqEpfz
[A]: 2
[Q]: password = 8qifTnm4d4x8HFYydqTXa1khn53wpx353LmrSLeJYe
[A]: 22
[Q]: password = a6k6SAAUadM.GmTIIAXJMM3IR8hvVIHkxLjlJPRwlrsNLz
[A]: | 26
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = S6lGg
answer:
1
question:
password = zpEBFO4nf.MHhO7iwCTuoBq74VdBqwcz!EYyhorlT2
answer:
22
question:
password = StfpZQGBxrWuoJpCd!Aj79yLhUYwsU0nydDs45VksihvK7
answer:
| 26
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = tyLSdeK0g44dfDUkf4BA
Output: | 0 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example is below.
Q: password = a
A: 5
Rationale: Using 5 steps, it can become a strong password
Q: password = StfpZQGBxrWuoJpCd!Aj79yLhUYwsU0nydDs45VksihvK7
A: | 26 | 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = egZJ9wtSU1VZbKxv5TJ75NNqkcpdsOO
SOLUTION: 11
PROBLEM: password = u89Xttk
SOLUTION: 0
PROBLEM: password = xbvW!9
SOLUTION: | 0
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = Vx0C3385yuJ7El2Wzcpmo2biQTORSmb
Solution: | 11 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = sOoWehSgHCFveLH
A: 1
****
Q: password = Okwv!nxQ
A: 1
****
Q: password = 9oU3sQATKwq5TFKS7quJP5GP4yBp10069ckVeDK8uo7MG
A: | 25
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = VQENO4J72zPn6pGMfOoTb2
SOLUTION: 2
PROBLEM: password = co21OeRtRoJzbCVh
SOLUTION: 0
PROBLEM: password = d
SOLUTION: | 5
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = M4kHjrUTg!FlBtJuPPweXfNpgHwbySAl5tyDyrHBPnG4
Answer: 24
Question: password = vZmQ.q
Answer: 1
Question: password = 9Y!5Z8qGA4wX9L5g9r9Ijdsbjq09iiz09qPu
Answer: | 16
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = TPwTOac7Ou!RwMSQvdvrDlDTnnKWp2Lvi0XLY6W
Output: | 19 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example is below.
Q: password = a
A: 5
Rationale: Using 5 steps, it can become a strong password
Q: password = cFbUIR
A: | 1 | 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = a
Solution: 5
Why? Using 5 steps, it can become a strong password
New input: password = G23ktm
Solution: | 0 | 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[EX Q]: password = zGa53W3S6TttuPm1Ef9Er1r
[EX A]: 3
[EX Q]: password = Ginwww1WvOJkPMPgfLj
[EX A]: 1
[EX Q]: password = cFbUIR
[EX A]: | 1
| 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Detailed Instructions: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
See one example below:
Problem: password = a
Solution: 5
Explanation: Using 5 steps, it can become a strong password
Problem: password = iavL2rgQLDS!at0UlXiGWMlyV!2gjsOfWigZo0oK4Zr
Solution: | 23 | 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Part 1. Definition
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Part 2. Example
password = a
Answer: 5
Explanation: Using 5 steps, it can become a strong password
Part 3. Exercise
password = pBfHX!q3VFWN7zDVWduM3U5QHD4!6BlE99CqBpV5AFXF
Answer: | 24 | 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = II60yvUV
A: 0
****
Q: password = oKLai.UJobsL96iKEXLCvenlUPN2GrjrSZgM0F1SO2fs1dXd
A: 28
****
Q: password = KxmPzWgpDthYxp4eISXIgmkKGC7XpSlOwkGn
A: | 16
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example is below.
Q: password = a
A: 5
Rationale: Using 5 steps, it can become a strong password
Q: password = lEZOvfZvsDnwW5ohw641ElzRFKY
A: | 7 | 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = EqFgyqddKIPy7eINfEZ
A: 0
****
Q: password = xpJMrkG5J1N6cY7vpOLxThZcRdMTN
A: 9
****
Q: password = VMnlBfbDjkA.pIDj
A: | 1
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Ex Input:
password = euelApYajOjzzJXQqGSl0PKUki9MYSj9.Du3G9nBdkI
Ex Output:
23
Ex Input:
password = O0QqUuP6v1SDujU4hmnSg.g8rGGs5b
Ex Output:
10
Ex Input:
password = tYPBo5UfteKYRDGLpc4VkEhaY8dixLFbx3TtRt3ftG0
Ex Output:
| 23
| 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Let me give you an example: password = a
The answer to this example can be: 5
Here is why: Using 5 steps, it can become a strong password
OK. solve this:
password = fbcCtPWYO8VSaDFCvkgARoVCKGYpYRctN3z2AgDiUvjAHdj8
Answer: | 28 | 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Detailed Instructions: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
See one example below:
Problem: password = a
Solution: 5
Explanation: Using 5 steps, it can become a strong password
Problem: password = D3g6VbPHCRZYOhs8aSfMDM!8xMp7PfpfucexayBA60fl2V
Solution: | 26 | 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example Input: password = 7UTQltiiHAyLTGmnN
Example Output: 0
Example Input: password = pNS5INBTXef
Example Output: 0
Example Input: password = D3g6VbPHCRZYOhs8aSfMDM!8xMp7PfpfucexayBA60fl2V
Example Output: | 26
| 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = a
Solution: 5
Why? Using 5 steps, it can become a strong password
New input: password = TSWxVjRCuG5wwe6aEvFgx!IfvZHnVugrSoAFjWZQOI.GGQ3B
Solution: | 28 | 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = d98ZwXTMeS.J1l0mO4rQHS6EF9Pw9pe
| Solution: 11 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = qWK3NU76C
Answer: 0
Question: password = mtL.CwOgbOoqymU2
Answer: 0
Question: password = b5NLP54RzHuMyQgg8eplWfft6DIEsyRfJAokoAMT0TJA2kM1
Answer: | 28
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = tYPBo5UfteKYRDGLpc4VkEhaY8dixLFbx3TtRt3ftG0
Output: | 23 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Part 1. Definition
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Part 2. Example
password = a
Answer: 5
Explanation: Using 5 steps, it can become a strong password
Part 3. Exercise
password = IIoKHDPKCnDNyI0MJOus4Hpofb
Answer: | 6 | 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = 9ujtytB0..eba6TnJcqvTG.JtvNbaJZ3uBNieNKJ.
| Solution: 21 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = SaTgUAD7!hfmCEkWQ9!xY2E0QLemP
Solution: | 9 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Given the task definition, example input & output, solve the new input case.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Output: 5
Using 5 steps, it can become a strong password
New input case for you: password = yVUkOZjM!WsdqTHARBmdBpXVZE.izcmC.EDj
Output: | 17 | 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example input: password = a
Example output: 5
Example explanation: Using 5 steps, it can become a strong password
Q: password = 5VTw0PWrI.Jwzy6y2T7xPm!U5ce71xd
A: | 11 | 3 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = 0IoDGQQpmqiiRz61vMuYLMdSh
| Solution: 5 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Ex Input:
password = vo!K2TyPceOxfjBDbnDtD5y5
Ex Output:
4
Ex Input:
password = DN
Ex Output:
4
Ex Input:
password = y45i8YX1JcHKJj!UZdg4DqZH!43wGoUDyBGiV
Ex Output:
| 17
| 1 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Example: password = a
Example solution: 5
Example explanation: Using 5 steps, it can become a strong password
Problem: password = vzq9fV!nMmCfMKF14Dory.iI1Yw
| Solution: 7 | 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
[Q]: password = SzGlC2gXm4uvZYah8MKaM.SN3wuayjcIJ9aDoa3cb9!KGc
[A]: 26
[Q]: password = MuouWo2HOOsaCALIi
[A]: 0
[Q]: password = jcl32XH
[A]: | 0
| 5 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = m62Ap!F9eM
0
password = QaxFm0N9Db8NlASFd
0
password = jXhJ.2SEUohBmp6YiLBA
| 0
| 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
--------
Question: password = KMxgCvxC4A1SxLS2r9OEQGx3MqRaqXX
Answer: 11
Question: password = bfLVM4fs!kvTLnkDY0k
Answer: 0
Question: password = ZD.H0eaAefDwpxtfBFJzOB4XL
Answer: | 5
| 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
TASK DEFINITION: You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
PROBLEM: password = 2Kwb3JfOO0u8
SOLUTION: 0
PROBLEM: password = rxrbgX
SOLUTION: 1
PROBLEM: password = gdS43UJIMhHYYfvHYRvDr0tzORu1O21kcz2GZM5TCvdj
SOLUTION: | 24
| 8 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
One example: password = a
Solution is here: 5
Explanation: Using 5 steps, it can become a strong password
Now, solve this: password = a0aec6LCdKAwL1!T!tFznz5m5VxLslpVbHWzViT90oTyt9gv
Solution: | 28 | 6 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = puEd3Ffrsxk7if1cmlB6ttQLsEwu8j
answer:
10
question:
password = GAzvuV8V4utVZTD25gzTzk
answer:
2
question:
password = GS!O
answer:
| 2
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
password = a
Solution: 5
Why? Using 5 steps, it can become a strong password
New input: password = jXhJ.2SEUohBmp6YiLBA
Solution: | 0 | 0 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = L!cL34z7HVNDwzCtgvzul8Rl629TOfDRRhEAjlyG
A: 20
****
Q: password = v5hT3sXOZpl
A: 0
****
Q: password = zGa53W3S6TttuPm1Ef9Er1r
A: | 3
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
Part 1. Definition
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Part 2. Example
password = a
Answer: 5
Explanation: Using 5 steps, it can become a strong password
Part 3. Exercise
password = xbiNhjJtOaZz00C2jCAwi4BSe
Answer: | 5 | 7 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
Q: password = kVo9.hqQCn
A: 0
****
Q: password = B6RXMgEWr.iZkrPLUl9M7a!iZz4PbSQEnAE.yOfE
A: 20
****
Q: password = eENV3xybrcUT9fr7Y5JIyF6G55JG2u.YID9UJ
A: | 17
****
| 4 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
instruction:
You are given a password and you need to generate the number of steps required to convert the given password to a strong password. A password is considered strong if (a) it has at least 6 characters and at most 20 characters; (b) it contains at least one lowercase letter and one uppercase letter, and at least one digit; (c) it does not contain three repeating characters in a row. In one step you can: (1) Insert one character to password, (2) delete one character from password, or (3) replace one character of password with another character.
question:
password = !wsGmxKanG4wsT62Gm5lcjsMZRiwoIcIE70MR4BYWgN
answer:
23
question:
password = yEsWTc43
answer:
0
question:
password = JxQ8Soel56Pawlms
answer:
| 0
| 9 | NIv2 | task956_leetcode_420_strong_password_check | fs_opt |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 10