Rosetta Code

Anagrams

Group a fixed word list into anagram sets using sorted-letter signatures.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/anagrams.vibe
def signature(word: string) -> string
  word.downcase.chars.sort.join("")
end

def anagram_groups(words: array<string>) -> array<array<string>>
  groups: hash<string, array<string>> = {}
  order: array<string> = []

  words.each { |word|
    key = signature(word)
    if groups[key] == nil
      groups[key] = []
      order << key
    end
    groups[key] << word
  }

  output: array<array<string>> = []
  order.each { |key|
    if groups.fetch(key).length > 1
      output << groups.fetch(key).sort
    end
  }

  output
end

def run -> array<array<string>>
  anagram_groups(["care", "race", "acre", "dog", "god", "note", "tone", "vibe"])
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.