Let's try a fun problem now. Two words are called anagrams if they have the exact same letters but in a different order. For example, 'night' and 'thing' are anagrams.
Can you write a code to find out if two strings are anagrams or no? We strongly recommend that you try this question on your own by thinking of the logic, building the flow chart, and translating that logic into code.
Here is Sajan's explanation incase you were not able to solve the code on your own.