Over a million developers have joined DZone.

Thursday Code Puzzler: Grouping Anagrams

DZone's Guide to

Thursday Code Puzzler: Grouping Anagrams

· Java Zone
Free Resource

Bitbucket is for the code that takes us to Mars, decodes the human genome, or drives your next car. What will your code do? Get started with Bitbucket today, it's free.

It's Thursday, so it's time for another code puzzler. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.

Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer.  It's all about the participation!

Grouping Anagrams 

Write a method that, when given an array of strings, will group all of the anagrams, and partial anagrams together in their individual arrays. A partial anagram is a word that is composed of characters in another word, although it might not have the same number of characters as the original word. 

For example given [dzone, java, one, node] you would get two arrays: 

[dzone, one, node] and [java].

Catch up on all our previous puzzlers here

Bitbucket is the Git solution for professional teams who code with a purpose, not just as a hobby. Get started today, it's free.


Opinions expressed by DZone contributors are their own.


Dev Resources & Solutions Straight to Your Inbox

Thanks for subscribing!

Awesome! Check your inbox to verify your email so you can start receiving the latest in tech news and resources.


{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}