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

An Introduction to Google’s Approach to AI Agent Security

via Simon Willison

Notes on Cramer's rule

Cramer's rule is a clever solution to the classical system of linear equations Ax=b: \[\begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \\ \end{bmatrix} \begin{bmatrix}x_1 \\ x_2 \\ x_3\end{bmatrix} = \begin{bmatrix}b_1 \\ b_2 \\ b_3\end{bmatrix}\] Usi...

via Eli Bendersky

Brandjes: Paintings as witnesses to fires 1640-1813

Dramatic paintings of towns and cities on fire, usually at night, were popular during the Dutch Golden Age, and known as brandjes. Examples to well into the 19th century.

via The Eclectic Light Company