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!
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