To the Top
File:  root - text - article - 2019 - 12 - group-words-that-are-anagrams.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 193 Views, 16928 Search Bots | 77 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

Given a list of words, group the words that are anagrams of each other. (An anagram are words made up of the same letters).

Example:

Input: ['abc', 'bcd', 'cba', 'cbd', 'efg']
Output: [['abc', 'cba'], ['bcd', 'cbd'], ['efg']]

Here's a starting point:


import collections

def groupAnagramWords(strs):
# Fill this in.

print groupAnagramWords(['abc', 'bcd', 'cba', 'cbd', 'efg'])
# [['efg'], ['bcd', 'cbd'], ['abc', 'cba']]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 193 Views, 16928 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Subarray With Target Sum
  2. Delphi Dynamic Array
  3. Daily Interview Problem: Group Words that are Anagrams
  4. A trick for getting good at coding interviews FASTER
  5. Print a tree level-by-level, with line-breaks
  6. Daily Interview Problem: Largest BST in a Binary Tree
  7. Floor and Ceiling of a Binary Search Tree
  8. Autorun.inf Virus Protection
  9. Daily Interview Problem: Buddy Strings
  10. Daily Interview Problem: Distribute Bonuses

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />