Skip to content

Alternative solution to Problem 4 under JAVA (easier and non case sensitive and non space redundant) #199

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
swaaz merged 3 commits into from
Oct 10, 2020
Merged

Alternative solution to Problem 4 under JAVA (easier and non case sensitive and non space redundant) #199

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
fdcff1e
Add files via upload
ArjunBhandari-666 Oct 10, 2020
d7c6891
Rename README.md.txt to README.md
swaaz Oct 10, 2020
dface4f
Rename program.java.txt to program.java
swaaz Oct 10, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions Java/Program 4 alternative/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
Q. Taking input of two lines or Strings from the user, compare and
find if they are anagrams of each other or not.

What are anagrams?
Two statements with the same alphabets used the same no. of times but
irrespective of spacing in words.

Ex.
INPUT1: I LOVE COMPUTERS
INPUT2: MOLE COVERS IT UP
OUTPUT: YES
LOGIC: they're just rearrangement of the used alphabets.
hence they are anagrams.
53 changes: 53 additions & 0 deletions Java/Program 4 alternative/program.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@




//Author @ArjunBhandari.666
//github.com/ArjunBhandari-666
//alternative solution to problem 4 irrespective of case input
import java.io.*;
import java.util.Scanner;
class StringAnagrams
{
public static void main()throws IOException
{
Scanner scan=new Scanner(System.in);
System.out.println("\fEnter two statements to compare");
String s1=scan.nextLine(),s2=scan.nextLine();
s1=s1.trim(); //removes extra spaces
s1=s1.toUpperCase(); //auto conversion of all alphabets to upper case
s2=s2.trim();
s2=s2.toUpperCase();
int a=s1.length(),b=s2.length(),j=b; //returns length of the trimmed strings
if(a>=b)
j=a;
int [] cmp1=new int[26]; //each index representing an alphabet from 'A' to 'Z'
int [] cmp2=new int[26];
int op=0;
for(int i=0;i<a;i++)
{
for(int k=65;k<=90;k++)
{
if(s1.charAt(i)==k)
cmp1[k-65]+=1; //ascii value for 'A'=65
}
}
for(int i=0;i<a;i++)
{
for(int k=65;k<=90;k++)
{
if(s2.charAt(i)==k)
cmp2[k-65]+=1;
}
}
for(int i=0;i<26;i++) //checks if each alphabet has been used the exact same no. of times in both the strings
{
if(cmp1[i]==cmp2[i])
op+=1;
if(op==25)
System.out.println("They are anagrams");
}
if(op!=25)
System.out.println("NOT ANAGRAMS");
}
}