String 7: Anagram | Must Do Coding Questions | GeeksForGeeks

This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
from geeksforgeeks platform.

website link:
https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adobe/

Topics covered in this video series are:
1.Arrays
https://youtube.com/playlist?list=PLvI381EFf-Uio-3KkcLtYoe7GaIaxSb6f
2.String
https://www.youtube.com/playlist?list=PLvI381EFf-Uj4bxfEYAkRka9uEeKlEM-Y
3.Linked List
4.Stack and Queue
5.Tree and BST
6.Heap
7.Recursion
8.Hashing
9.Graph
10.Greedy
11.Dynamic Programming
12.Divide and Conquer
13.Backtracking
14.Bit Magic

String:
7. Anagram:
Given two strings a and b consisting of lowercase characters. The task is to check whether two given strings are an anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, “act” and “tac” are an anagram of each other.


Example:
Input: a = geeksforgeeks, b = forgeeksgeeks Output: YES Explanation: Both the string have same characters with same frequency. So, both are anagrams.

Code Link:
https://github.com/krishna-gavas/Competitive-Coding/tree/master/GeeksForGeeks/Arrays

Complete Playlist:
https://www.youtube.com/playlist?list=PLvI381EFf-Uio-3KkcLtYoe7GaIaxSb6f

Intro Music :
https://youtu.be/93YYANzHbV4