about | help | code help+videos | done | prefs |
Find all anagrams of a string in a given list of strings using lambda and a helper function (that determines if two given words are anagrams). findAnagrams(["bcda", "abce", "cbda", "cbea", "adcb"], "abcd") → ["bcda", "cbda", "adcb"] findAnagrams(["bcda", "abce", "cbda", "cbea", "adcb"], "dbca") → ["bcda", "cbda", "adcb"] findAnagrams(["aab", "baa", "ba", "ab", "aa", "aaab", "bab"], "aba") → ["aab", "baa"] ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 200
Copyright Nick Parlante 2017 - privacy