Check if two strings are anagrams

JOIN ME
-----
KZbin 🎬 / @cppnuts
Patreon 🚀 / cppnuts
COMPLETE PLAYLIST
------------
C++ Tutorial For Beginners: • Introduction To C++
STL (Standard Template Library): • STL In C++
ThreadIng In C++: • Multithreading In C++
Data Structures: • Data Structure
Algorithms: • Binary Search
Design Patterns: • Factory Design Pattern...
Smart Pointers: • Smart Pointer In C++
C++14: • Digit Separator In C++
C++17: • std string_view in C++...
C++ All Type Casts: • static_cast In C++
INTERVIEW PLAYLIST
------------
C++ Interview Q&A: • Structural Padding & P...
C++ Interview Q&A For Experienced: • How delete[] Knows How...
Linked List Interview Questions: • Find Kth Node From Bac...
BST Interview Questions: • Search Element In Bina...
Array Interview Questions: • Reverse An Array
String Interview Questions: • Check String Is Palind...
Bit Manipulation Questions: • Find Set Bit In Intege...
Binary Tree Interview Question: • Invert Binary Tree
Sorting Algorithms: • Bubble Sort
C++ MCQ: • Video
C MCQ: • What printf returns af...
C Interview Questions: • Designated Initializat...
QUICK SHORT VIDEOS
-------------
C++ Short : • C++ Short Videos
C Short : • Shorts C Programming MCQ
In this video i have explained 3 different ways to solve this problem. This is very easy yet important question. This is generally asked in programming interview questions for placement. It can be best solved using hashing so interviewer ask this type of questions to check your knowledge on hashing.
Let me know if you feel something should be added in the comment section.
#anagram #dsa #c++ #interviewquestion

[@pavankolli4490]

Boss is Back 😎

[@CppNuts]

Thanks hahaha

[@muhammadzakiahmad8069]

My python implementation: def is_Anagram(texta, textb): if len(texta) != len(textb): return False for char in texta: if texta.count(char) != textb.count(char): return False return True

[@pitrya2533]

or you can just add the ascii numbers and compare. say numbers a-z as 1-26 then string "car" will add up to 3+1+18 = 22 and "arc" will be the same.

[@Anikashukla1808]

what will be the time complexity and space complexity for this?

[@arpitagupta4997]

No , 10+2 = 8+4 = 12 for eg. This will lead to incorrect results

[@SaurabhMishra0709]

Hey buddy whr were u?? Please keep uploading videos...i really love your content...

[@CppNuts]

Thanks man, sure I’ll do.

[@ChandraShekhar-by3cd]

I guess we can avoid one additional loop, we can increment the count while iterating over first string and decrement the count of map for the second element. At the end we can iterate over the map if any all character has 0 count then it is anagram else it is not. Please correct me if I am wrong.

[@CppNuts]

How r u populating Map which you are decrementing?

[@kolyacpp]

@@CppNuts we can delete key from map if after decrement Map[b[I]] becomes zero last loop can be replaced with: return Map.empty(); this method will be faster because decrement loop can break if there is no more that symbol in Map

[@ChandraShekhar-by3cd]

@@CppNuts Since both string will be having same length , in that same for lopp we can increment the count of character from string 1 and decrement the count of the char for the other string.

[@CppNuts]

Got it, yes that is correct, but in last solution we don't need 3rd loop that's what i asked in the end of the video. So in the end we have 2 loops in both the solutions. Good for you to think this much for given problem, then only you guys can get the max benefits.

[@sairamsharma4111]

How about having two sum variables and adding of ascii values for two string characters, if string length is same, in single for loop and comparing both sum are equal for an anagram

[@CppNuts]

Hi Shriram, No this wont work.

[@sairamsharma4111]

@@CppNuts Yeah true👍 my bad one such example is "ac" & "bb"...thanks for reply!

[@ChandraShekhar-by3cd]

Thanks a lot for your informative video. 😃

[@CppNuts]

Thanks man!!

[@notpipa_]

Can i use two for loops to count each word characters count and then return true if map1 == map2?

[@Anikashukla1808]

whats the time complexity and space complexity ?

[@pallavichaudhary6636]

Thank you for the great content. It is helping to prepare for interviews. How can we make this solution, case insensitive. Currently it is case sensitive. If "Listen", "silent" - it's saying, not anagram. If "listen", "silent" - it's saying, anagram. Please suggest. We will have to check it's ascii value and convert ascii value to small case lettter asciis, I think and store that in the same map. Or at the beginning itself, convert both strings to lower case or upper case. Added below lines and it's working fine. #include //for transform function transform(one.begin(), one.end(), one.begin(), ::tolower); transform(two.begin(), two.end(), two.begin(), ::tolower); //where one and two are string variables

[@CppNuts]

Converting in the beginning will be very easy, if interviewer is ok with that then grt, otherwise check what he/she wants in this case.

[@arpittripathi488]

I want to know if that last loop is required?

[@CppNuts]

Just think…

[@arpittripathi488]

@@CppNuts I think it is not required. It can be avoided as the conditions above last loop cover all possible scenarios

[@CppNuts]

Correct..

[@HitanshSharma-q2l]

Yes it is required reason: if the s1 contains some big string--> "abcd" and the s2 contains string like "abc" then even if the s1 left out with extra char "d", your code will return "true" for this... hence, if we have to check the i.second should be ==0

[@duonghouc7184]

wonderful video

[@ramakrishna4092]

After long time

[@CppNuts]

Yes next is vptr and vtable. Or i will complete this series first then will go for other topics.

[@arpitjohari3784]

@@CppNuts please make video for dll and move constructor

[@badassopenpolling]

An important video.

[@CppNuts]

Thanks

[@cheelavaishnavi9125]

how to do for more than 2 words like if cat tac act dog god we have to get act tac cat dog god