Build a more powerful version of the Unix tr command. Given a list of lines and two equal-length strings set1 and set2, replace every character in each line that appears in set1 at index i with set2[i]. Characters not in set1 are unchanged. Return the lines joined by newline characters (\n).
Notes: set1 and set2 have the same length, contain only ASCII characters, and set1 has no repeated character. Characters are taken literally: there are no ranges like a-z. All replacements happen at once, so set1 = "ab", set2 = "ba" swaps the two letters. Lines may be empty.
Function signature:
fun tr(lines: List<String>, set1: String, set2: String): String
Example:
Input: lines = ["banana", "cherry"], set1 = "abc", set2 = "ABC" Output: "BAnAnA\nCherry" When printed: BAnAnA Cherry
Build a
HashMap<Char, Char> from each char in set1 to the matching char in set2. Then walk each line and use map.getOrDefault(ch, ch) to translate.
val map = HashMap<Char, Char>()
for (i in set1.indices) {
map[set1[i]] = set2[i]
}
// per char: map.getOrDefault(ch, ch)
The full solution:
class Solution {
fun tr(lines: List<String>, set1: String, set2: String): String {
val map = HashMap<Char, Char>()
for (i in set1.indices) {
map[set1[i]] = set2[i]
}
val result = ArrayList<String>()
for (line in lines) {
val sb = StringBuilder()
for (ch in line) {
sb.append(map.getOrDefault(ch, ch))
}
result.add(sb.toString())
}
return result.joinToString("\n")
}
}
Free plan: 30 tutor messages. Premium is unlimited.
