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

Painting la Manche: le Havre to Ouessant

Paintings by Paul Signac, Claude Monet, Félix Vallotton, Millet, John Singer Sargent, Maurice Denis, and others.

via The Eclectic Light Company

System One models like Jev can train their own replacements

“System One” models like Jev are fast general classifiers. Classifiers have existed since 1958, but they have to be trained for specific tasks: if you build a classifier to identify images of dogs, it can’t be used to tell you if a streetlight is red, or if a letter is urgent. Like a LLM, Jev can be...

via Sean Goedecke

Notes on discrete-time Fourier series and transform

The following are my notes on discrete-time Fourier series (DTFS), as well as the discrete-time Fourier transform (DTFT). These topics serve as an important theoretical underpinning to the digital processing of signals by computers using the DFT (which will be covered in a future post). For discrete...

via Eli Bendersky