id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

frew@mclean.com > findAnagrams
prev  |  next  |  chance

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)

public List<String> findAnagrams(List<String> strings, String word) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 200

Copyright Nick Parlante 2017 - privacy