All challenges
Easy 0 solved 0% acceptance

Text Message Abbreviations

Expand common texting abbreviations in a message into full words.

What you'll learn

  • Split a sentence into words and join it back
  • Store abbreviations in a dictionary or map
  • Replace only exact whole-word matches

Problem

Grandpa keeps getting texts full of abbreviations, so you are writing a decoder for him. The decoder knows these eight abbreviations:

AbbreviationMeaning
BRBbe right back
BTWby the way
IDKI don't know
IMOin my opinion
JKjust kidding
NVMnever mind
TMItoo much information
TTYLtalk to you later

The message is split into words at single spaces. A word is replaced only when it is exactly one of the abbreviations, in capital letters and with nothing attached: BTW is replaced, but btw and BTW, are not.

Implement text_abbreviations(message).

Input

message: The text message. Words are separated by single spaces.

Output

Return the message with every abbreviation replaced by its meaning and everything else unchanged. An empty message gives an empty string.

Constraints

0 ≤ length of message ≤ 1000

The message uses printable ASCII characters, with no leading, trailing or double spaces

Examples

Example 1
Input:
message = "IDK if I can come BTW"

Expected output:
expected = "I don't know if I can come by the way"
Input:
std::string message = "IDK if I can come BTW";

Expected output:
std::string expected = "I don't know if I can come by the way";
Input:
string message = "IDK if I can come BTW";

Expected output:
string expected = "I don't know if I can come by the way";

Explanation

IDK and BTW are both whole words in the table, so the result is "I don't know if I can come by the way".

Example 2
Input:
message = "ok TTYL, jk"

Expected output:
expected = "ok TTYL, jk"
Input:
std::string message = "ok TTYL, jk";

Expected output:
std::string expected = "ok TTYL, jk";
Input:
string message = "ok TTYL, jk";

Expected output:
string expected = "ok TTYL, jk";

Explanation

TTYL, has a comma attached and jk is lowercase, so nothing changes: "ok TTYL, jk".

How to approach it

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

Hint 1

Split on single spaces so you can look at one word at a time.

Hint 2

A dictionary from abbreviation to meaning keeps the code short.

Hint 3

Words that are not in the table go back unchanged; watch out for the empty message.

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.