Anagram
Coding Problem Keys
Anagram
Problem Statement
Anagram is a form of word play in which letters of a word or phrase are rearranged in such a way that a new word or phrase is formed.
Anagram is formed by using exactly the same letters of the original word but with a different arrangement.
Write a function to check if two given strings are anagrams or not. Return "Yes" if they are anagrams, otherwise return "No".
Example Input/Output 1
Input
Output
Example Input/Output 2
Input
Output
Example Input/Output 3
Input
Output
Note: Max Execution Time Limit: 5000 millisecs
Solution
Programming Language: Python 3 Language
# Published By PKJCODERSa=input().lower() b=input().lower() if(len(a)==len(b)): a=sorted(a) b=sorted(b) if(a==b): print("Yes") else: print("No") else: print("No")
Alter
# Published By PKJCODERSdef Anagram(s1,s2): n1=len(s1) n2=len(s2) if(n1!=n2): return False s1=sorted(s1);s2=sorted(s2) for i in range(0,n1): if s1[i]!=s2[i]: return False return True s1=input().lower() s2=input().lower() if Anagram(s1,s2): print("Yes") else: print("No")
Programming Language: Java Language
// Published By PKJCODERSimport java.util.Arrays; class Test{ public boolean isAnagram(String first, String second){ boolean status = true; if (first.length() != second.length()) { status = false; }else{ char[] ArrayS1 = first.toLowerCase().toCharArray(); char[] ArrayS2 = second.toLowerCase().toCharArray(); Arrays.sort(ArrayS1); Arrays.sort(ArrayS2); status = Arrays.equals(ArrayS1, ArrayS2); } return status; } } public class AnagramString { public static void main(String[] args){ Test obj=new Test(); System.out.println(obj.isAnagram("hello","olleh")); System.out.println(obj.isAnagram("shakespeare","keshareapes")); System.out.println(obj.isAnagram("Hello","World")); } }
(Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.)
Comments