Group Anagrams

Problem

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

Input: strs = ["eat","tea","tan","ate","nat","bat"]
Output: [["bat"],["nat","tan"],["ate","eat","tea"]]

Example 2:

Input: strs = [""]
Output: [[""]]

Example 3:

Input: strs = ["a"]
Output: [["a"]]

Constraints:

  • 1 <= strs.length <= 104
  • 0 <= strs[i].length <= 100
  • strs[i] consists of lowercase English letters.

Solution

First try!

class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        var output = new ArrayList<List<String>>();
        int[][] a = new int[strs.length][26];
        Map<String, List<String>> m = new HashMap<>();

        for (int i = 0; i < strs.length; i++) {
            var str = strs[i];
            for (var c : str.toCharArray()) {
                a[i][(int) c - 'a'] += 1;
            }
            var key = Arrays.toString(a[i]);
            if (m.containsKey(key)) {
                m.get(key).add(str);
            } else {
                var l = new ArrayList<String>();
                l.add(str);
                m.put(key, l);
                output.add(l);
            }
        }

        return output;
    }
}

Cleaned up

Here’s the above solution, just cleaned up a bit

class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        var a = new int[26];
        var m = new HashMap<String, List<String>>();

        for (var str : strs) {
            Arrays.fill(a, 0);
            for (var c : str.toCharArray()) {
                a[(int) c - 'a'] += 1;
            }
            var key = Arrays.toString(a);
            m.compute(key, (k, v) -> {
                if (v == null) {
                    v = new ArrayList<String>();
                }
                v.add(str);
                return v;
            });
        }

        return new ArrayList<>(m.values());
    }
}

Recent posts from blogs that I like

Automatically detecting AI text in my browser

Automated AI text detection is currently an underserved niche. The only game in town is Pangram, which does an excellent job but desperately needs more competition. In a few years, I would be surprised if every major social network doesn’t scan new posts1 and comments for AI content in order to tag ...

via Sean Goedecke

Logistician version 1.5 fixes a crashing bug

Version 1.4 can crash when trying to display a Chart view for Signpost or HighVolume log files with less than 6 processes. This update fixes that.

via The Eclectic Light Company

The Pelican comparison grid for Astra is pretty interesting

via Simon Willison