Find the Difference - Leetcode 389 - Python

[@gaychin8654]

Wow, exactly what I needed! Also, for those who don't know, XOR operation is both associative and commutative, therefore, the sequence of characters will not affect the output.

[@infinitygod5379]

Liked the xor approach

[@MP-ny3ep]

Thank you for the daily problems ! Love the multiple approaches.

[@Banaaani]

The last solution is just mind blowing!

[@servantofthelord8147]

ikr! I never knew we could do this with bits

[@michomapeter941]

Bro youre the best ,We really appreciate your efforts ,Thankyou

[@ymncore]

thank you so much for solving the daily challenges !!

[@houssainebendhieb203]

Thank you for your efforts it's very helpful

[@omaryahia]

how is problem solving going for you? still solving? :)

[@jeewan3108]

XOR approach ❤

[@SASA_maxillo]

my solution:
if s == "":
return t
for i in s:
t = t.replace(i, "", 1)

return t
i think it is easier and more readable 🙃🙃

[@yourAI-Buddy]

The real deal is learning various ways than just for loops and stuff. the XOR method and ascii value calcs are pretty cool

[@phpostrich]

return chr(sum([ord(ch) for ch in t]) - sum([ord(ch) for ch in s])) # one liner

[@phpostrich]

return chr(reduce(lambda x, y: x ^ y, [ord(ch) for ch in (t+s)])) # one liner using reduce and XOR 🤔

[@downhillskating101]

same, good one

[@rushabhlegion2560]

I wrote like this
class Solution {
public:
char findTheDifference(string s, string t) {
vectorvecS(26,0);
vectorvecT(26,0);
for(int i=0;i

[@jessanraj9086]

❤❤

[@anantom251]

Did it myself today!!
using the hashing.
char findTheDifference(string s, string t) {
vector mp(27,0);
char ans = '0';
// we first initialise the vector array with the freq of the characters of string s;
for(auto i=0;i

[@nikospappas8718]

Another one liner
return set(t).difference(set(s)).pop()