Java Exercises: Check if a given string is a permutation of another specified string

Java Basic: Exercise-149 with Solution

Write a Java program to check if a given string is a permutation of another given string.

Pictorial Presentation:

Sample Solution:

Java Code:

import java.util.*;
  public  class  Solution {
    public static void main(String[] args) {
		String str1 = "xxyz";
		String str2 = "yxzx";
		System.out.println("Original strings: "+str1+"  "+str2);
        System.out.println(stringPermutation(str1, str2));
    }
      public static boolean stringPermutation(String str1, String str2) {
        int[] arr = new int[500];
        for (int i = 0; i < str1.length(); i++) {
            arr[(int) str1.charAt(i)] += 1;
        }
        for (int i = 0; i < str2.length(); i++) {
            arr[(int) str2.charAt(i)] -= 1;
        }
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] != 0) return false;
        }
        return true;
    }
}

Sample Output:

Original strings: xxyz  yxzx
true

Flowchart:

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Java program to find the index of the first unique character in a given string, assume that there is at least one unique character in the string.
Next: Write a Java program to test if a binary tree is a subtree of another binary tree.