LeetCode in Kotlin
389. Find the Difference
Easy
You are given two strings s and t.
String t is generated by random shuffling string s and then add one more letter at a random position.
Return the letter that was added to t.
Example 1:
Input: s = “abcd”, t = “abcde”
Output: “e”
Explanation: ‘e’ is the letter that was added.
Example 2:
Input: s = “”, t = “y”
Output: “y”
Constraints:
0 <= s.length <= 1000t.length == s.length + 1sandtconsist of lowercase English letters.
Solution
class Solution {
fun findTheDifference(s: String, t: String): Char {
var c = 0.toChar()
for (cs in s.toCharArray()) {
c = (c.code xor cs.code).toChar()
}
for (ct in t.toCharArray()) {
c = (c.code xor ct.code).toChar()
}
return c
}
}