Cracking The Coding Interview |Given Two Strings,Check If One Is Permutation Of The Other | Tech

[@MohanRaja-t8m]

can do using hash map. More efficient

[@djpsn7094]

We can do with object as well

[@SHIVAMSHARMA-rh7xe]

Cracking the Coding Interview

[@madhukarvissapragada8955]

Instead get the sum of ASCII values of each character in both the strings and check if their sum is equal or not

[@pinigantikrishnavamsi7779]

In this case will it be O(n)?

[@uditgupta7627]

Damn that's osm

[@Nitinsingh-uj1gw]

Wrong. with this logic "bb" will be permutation of "ac"; a = 97 b = 98 c = 99 98+98 = 97+99 b + b = a + c

[@Nitinsingh-uj1gw]

Instead get the total occurance of each charactor in both string seperatley and store it in seperate array and then compare both arrays

[@TechIsFun358]

Nice brother

[@pawansnair997]

Thanks for your support bro

[@rituparnadas2982]

👍 😁