funWithAnagrams

public class FunWithAnagrams {

    public static boolean areAnagram(String w1, String w2) {
        char[] chr1 = w1.toCharArray();
        char[] chr2 = w2.toCharArray();

        // Sorting the two arrays and checking for equality also works, but this is faster

        int[] count = new int[26];
        for (char ch : chr1) {
            count[ch - 97] = count[ch - 97] + 1;
        }

        for (char ch : chr2) {
            count[ch - 97] = count[ch - 97] - 1;
        }

        for (int n : count) {
            if (n != 0) {
                return false;
            }
        }


        return true;
    }

    public static String key(String word) {
        char[] chrs = word.toCharArray();
        Arrays.sort(chrs);
        return new String(chrs);
    }

    public static List<String> funWithAnagrams(List<String> s) {
        List<String> ans = new LinkedList<String>();
        Set<String> found = new HashSet<String>();
       for (int i=0; i<s.size(); i++) {
            String word = s.get(i);
            String key = key(word);
            if (!found.contains(key)) {
                ans.add(word);
                found.add(key);
            }

        }

        Collections.sort(ans);

        return ans;
    }


    public static void main(String[] args) throws FileNotFoundException {
        //List<String> a = Arrays.asList("code", "doce", "ecod", "framer", "frame");
        List<String> a = Arrays.asList("code", "aaagmnrs", "anagrams", "doce");
        System.out.println(funWithAnagrams(a));
    }

}

Are there any code examples left?
Made with love
This website uses cookies to make IQCode work for you. By using this site, you agree to our cookie policy

Welcome Back!

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign in
Recover lost password
Or log in with

Create a Free Account

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign up
Or sign up with
By signing up, you agree to the Terms and Conditions and Privacy Policy. You also agree to receive product-related marketing emails from IQCode, which you can unsubscribe from at any time.
Creating a new code example
Code snippet title
Source