How To Banking Concern Gibe If Ii String Are Anagram Of Each Other - Coding Problem

Here is a Java programme to cheque if 2 String is an anagram of each other or not.  Two String is said to last an anagram of each other, if they comprise precisely the same characters merely inwards a dissimilar order. For instance "army" together with "mary" is an anagram of each other because they comprise exact same characters 'a', 'r', 'm' and  'y'. For the sake of simplicity, you lot tin likewise assume that your solution demand non last case-sensitive, which agency both ARMY together with mary tin last matched every bit an anagram of each other.

import java.util.Arrays;    /**  * Java Program to cheque if 2 String is an anagram of each other or not. Two  * String is said to last an anagram of each other, if they comprise precisely same  * characters merely inwards a dissimilar order. For instance "army" together with "mary" are anagram  * of each other because they comprise exact same characters 'a', 'r', 'm' and  * 'y'.  *  * @author javinpaul  */  public class Testing {        public static void main(String args[]) {            String[][] data = {{"army", "mary"}, {"stop", "tops"}, {"soap", "abcd"}};          System.out.println("======== Testing areAnagrams() method =======");          for (String[] value : data) {              String s1 = value[0];              String s2 = value[1];              System.out.printf("Are %s together with %s are Anagrams? %b%n", s1, s2,                        areAnagrams(s1, s2));          }            System.out.println("======== Testing isAnagaram() method =======");          for (String[] value : data) {              String s1 = value[0];              String s2 = value[1];              System.out.printf("Does %s together with %s are Anagrams? %b%n", s1, s2,                                 isAnagram(s1, s2));          }        }        /*       * One of the easiest way to cheque if 2 Strings are an anagram of each other       * is to possess got their graphic symbol array, variety them together with cheque if they are equal.       * If sorted graphic symbol arrays are equal together with thus both String are an anagram of       * each other.       */      public static boolean areAnagrams(String first, String second) {          char[] fa = first.toCharArray();          char[] sa = second.toCharArray();            // variety arrays          Arrays.sort(fa);          Arrays.sort(sa);            // check if arrays are equal          if (Arrays.equals(fa, sa)) {              return true;          }            return false;      }        /*       * Earlier method was using a distich of library methods, which is non permitted during       * interviews. This method checks if 2 Strings are anagram without using whatever utility       * method. This solution assumes that both root together with target string are ASCII strings.       */      public static boolean isAnagram(String source, String target) {          if ((source == null || target == null) || source.length() != target.length()) {              return false;          }            int[] table = new int[256];            int numOfUniqueCharInSource = 0;          int numOfCharProcessedInTarget = 0;            char[] characters = source.toCharArray();            // shop count of each unique character in source String          for (char ch : characters) {              if (table[ch] == 0) {                  ++numOfUniqueCharInSource;              }              ++table[ch];          }            for (int i = 0; i < target.length(); ++i) {              int c = target.charAt(i);              if (table[c] == 0) {                  return false;              }              --table[c];              if (table[c] == 0) {                  ++numOfCharProcessedInTarget;                  if (numOfCharProcessedInTarget == numOfUniqueCharInSource) {                     // it’s a match if t has been processed completely                      return i == target.length() - 1;                  }              }          }          return false;        }    }    Output  ======== Testing areAnagrams() method =======  Are regular army and mary are Anagrams? true  Are halt and tops are Anagrams? true  Are lather and abcd are Anagrams? false  ======== Testing isAnagaram() method =======  Does regular army and mary are Anagrams? true  Does halt and tops are Anagrams? true  Does lather and abcd are Anagrams? false

That's all about how to cheque if 2 String is Anagram of each other or not. If you lot demand to a greater extent than String based coding problems for exercise together with thus you lot tin likewise solve problems listed below.  It's an interesting occupation together with at that spot are a distich of invariants every bit good every bit the case-sensitive 1 I discussed inwards the commencement paragraph. You may likewise last asked to calculate the fourth dimension together with infinite complexity of this problem, tin you lot calculate?

Further Learning
Data Structures together with Algorithms: Deep Dive Using Java
solution)

How to cheque if 2 Strings are anagrams of each other? (solution)

How to programme to impress commencement non-repeated graphic symbol from String? (solution)

How to contrary String inwards Java using Iteration together with Recursion? (solution)

How to cheque if a String contains solely digits?  (solution)

How to notice duplicate characters inwards a String? (solution)

How to count the set out of vowels together with consonants inwards a String? (solution)

How to count the occurrence of a given graphic symbol inwards String? (solution)

How to convert numeric String to an int? (solution)

How to notice all permutations of String? (solution)

10 Algorithms Courses to Crack Programming Job Interviews (courses)

How to contrary words inwards a judgement without using a library method? (solution)

How to cheque if String is Palindrome? (solution)

How to furnish highest occurred graphic symbol inwards a String? (solution)

How to contrary a String inwards house inwards Java? (solution)

50+ Data Structure together with Algorithms Interview Questions (questions)

Thanks for reading this coding interview enquiry thus far. If you lot similar this String interview enquiry together with thus delight portion amongst your friends together with colleagues. If you lot possess got whatever enquiry or feedback together with thus delight drib a comment.

P. S. - If you lot are looking for some Free Algorithms courses to meliorate your agreement of Data Structure together with Algorithms, together with thus you lot should likewise cheque this listing of Free Data Structure together with Algorithms Courses for Programmers.

Share this post