Skip to content

Latest commit

 

History

History
16 lines (12 loc) · 762 Bytes

README.md

File metadata and controls

16 lines (12 loc) · 762 Bytes
Raw

fun-with-anagrams

Solution to the Hacker Rank problem 'Fun with Anagram' - JS

To run this npm start

Problem

Given an array of strings, remove each string that is an anagram of an earlier string, then return the remaining array in sorted order.

Example

str = ['code', 'doce', 'ecod', 'framer', 'frame']

code and doce are anagrams. Remove doce from the array and keep the first occurrence code in the array. code and ecod are anagrams. Remove ecod from the array and keep the first occurrence code in the array. code and framer are not anagrams. Keep both strings in the array. framer and frame are not anagrams due to the extra r in framer. Keep both strings in the array. Order the remaining strings in ascending order: ['code','frame','framer'].