THis question👆 L1-M2

def main():
    w1 = input().lower()
    w2 = input().lower()

    w1_list = [0] * 26
    w2_list = [0] * 26

    for c in w1:
        w1_list[ord(c) - ord('a')] += 1

    for c in w2:
        w2_list[ord(c) - ord('a')] += 1

    if w1_list == w2_list:
        print(len(w1))
    else:
        different_letters = []
        for i in range(26):
            if w1_list[i] != w2_list[i]:
                different_letters.append(chr(i + ord('a')))

        different_letters.sort()
        print("".join(different_letters))

if name == 'main':
    main()


WEB dEveloper code ✅ E1

Accolite code python✅


Sharing = caring = spreading happiness

Join 👉 @Examhelp_143 ❤️

Any one want projects -mini or Major 😊  Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️

Anyone need help in GRE and TOFEL Exam help 👨‍💻👨‍💻

SOP , LOR✍📝

Note -paid 🤑

share✅ share ✅@Coding_000

Resume for deliotte.. 😊👍

In this channel i will share all 2023 batch offcampus job 🤘🤘
https://t.me/Offcampus_000

Everyone join this for off-campus updates @whitehatcoding❤️

Happy rose day guys..🌹🌹
👉 @ILOVEU_143 😅

Propose day guys..💍💍
👉 @ILOVEU_143 😅

Wiley edge
Amazon Sde
AMcat
Deliotee
or any exam help available 🔥💯

Book your slot

Contact here @ILOVEU_143✅
Note: It's Paid 💰💰
Share✅ @Coding_000💯💥

💯 Clearance and genuine help

Check all previous  proofs 😎💯

Any one want projects -mini or Major 😊  Unique project💥💥
Domain AI/ML
contact -@ILOVEU_143 ❤️

Anyone need help in GRE and TOFEL, GMAT, DUOLINGO Exam help 👨‍💻👨‍💻

SOP , LOR✍📝

Note -paid 🤑

share✅ share ✅@Coding_000

Apply amazon👇👇

👉@Offcampus_000

Don`t waste money for accolite..

All ans here @Coding_000
just scroll above...

share with ur frds ✅😍

https://t.me/whitehatcoding
https://t.me/whitehatcoding

https://t.me/whitehatcoding
Join this 👆👆👆
for more...Answers upcoming..😅😅

#include<bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s;
cin>>s;
unordered_set<char>st;
int flag=0;
for(int i=0; i<n; i++){
if(st.find(s[i])!=st.end()){
flag=1;
break;
}
st.insert(s[i]);
}
if(flag)
cout<<n-2<<endl;
else
cout<<-1<<endl;
}
}

Bi_lindrome solution C++✅
@whitehatcoding❤️