Check if One String Swap Can Make Strings Equal - Leetcode 1790 - Python

[@Math-is-fun.627]

I love you Neetcode!!❤❤😂😂

[@codewithven9391]

another way: def areAlmostEqual(self, s1: str, s2: str) -> bool: count, j = 0, 0 for i in range(len(s1)): if s1[i] != s2[i]: count += 1 if count == 1: j = i elif (count == 2 and s1[i] != s2[j] or s2[i] != s1[j]) or count > 2: return False return count != 1

[@smartdragon2504]

this is similar to what i did , noice

[@setkaung729]

similar to mine,great

[@araneuskyuro]

Quick question, instead of checking len(indexes) == 0 would it not be better to return True initially itself on If s1 == s2: return True ? The iteration over the entire string feels a bit pointless in that case

[@rhugvedbhojane4387]

I watch so much neetcode that my solutions are getting similar to his

[@Douglascaina]

great solution!

[@Sammie_]

feelsgood to beat neetcode by having slightly better memory usage while being on 100%.

[@Deadmanstrolln]

I really hate that they call this "string" swapping. At least for languages I'm familiar with, you're swapping chars of a string. Swapping strings makes it sound like there is some substring (of any length) that can be swapped with another substring (of any length) to make the 2 original strings equal

[@Nishanth_S]

+1

[@dialgos7574]

That would be a really interesting and probably challenging exercise

[@araneuskyuro]

Lisan Al Gaib, I am sure this will be a daily problem soon

[@jeehar1]

Nice sol man

[@sandeepsalwan2911]

🔥

[@alizu3803]

did the brute force in 40s things are going good

[@UltiRequiem]

I have not seen the video. My udea: Check for the diff, the diff must be exactly two.

[@cordrust]

they need to be the same different characters

[@Tahsan14710]

test case 'aa' 'bb' has exactly two, but It can't be same by swapping.

[@abdalla4425]

easy -> 50% acceptance rating >.< lmao we got baited

[@zangdaarrmortpartout]

maybe the easiest problem I've seen on lt so far

[@vickykumar-vp7ux]

First