All challenges
Easy 0 solved 0% acceptance

Password Modifier

Strengthen a password by swapping some letters for symbols and adding its length at the end.

What you'll learn

  • Walk through a string one character at a time
  • Map characters to replacements
  • Append a number converted to text

Problem

A school IT club suggests a quick way to turn a simple word into a stronger password. Swap these lowercase letters for look-alike symbols:

LetterBecomes
a@
e3
i!
o0 (zero)
s$

Every other character stays as it is (capital letters are not swapped). Then add # and the length of the original word at the end.

Implement password_modifier(word).

Input

word: The starting word.

Output

Return the new password.

Constraints

0 ≤ length of word ≤ 100

word uses printable ASCII characters

Examples

Example 1
Input:
word = "mississippi"

Expected output:
expected = "m!$$!$$!pp!#11"
Input:
std::string word = "mississippi";

Expected output:
std::string expected = "m!$$!$$!pp!#11";
Input:
string word = "mississippi";

Expected output:
string expected = "m!$$!$$!pp!#11";

Explanation

Every i becomes ! and every s becomes $, and the word has 11 letters: "m!$$!$$!pp!#11".

Example 2
Input:
word = "Oreo"

Expected output:
expected = "Or30#4"
Input:
std::string word = "Oreo";

Expected output:
std::string expected = "Or30#4";
Input:
string word = "Oreo";

Expected output:
string expected = "Or30#4";

Explanation

The capital O stays, e becomes 3 and the last o becomes 0; the length is 4: "Or30#4".

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Look at each character and decide what to write in its place.

Hint 2

Only the five lowercase letters change; everything else is copied.

Hint 3

Use the length of the original word, then convert it to text before adding it.

Expected complexity

O(n) time, O(n) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.