Question: c + + 1 2 3 is a string commonly found in weak passwords. Remove all occurrences of 1 2 3
c is a string commonly found in weak passwords. Remove all occurrences of from passwordStr. Then, assign lengthStr with the length of passwordStr.
Ex: If the input is N&x@pvgHJ then the output is:
Remaining string: N&x@pvgHJ
Length:
Note:
string.finditem returns the index of the first occurrence of item in string. If no occurrence is found, then the function returns string::npos.
string.replaceindx num, subStr replaces characters at indices indx to indxnum with a copy of subStr.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
