filmov
tv
CodeWars || Where my anagrams at? || C# || Code Challenge
Показать описание
What is an anagram? Well, two words are anagrams of each other if they both contain the same letters. For example:
'abba' & 'baab' == true
'abba' & 'bbaa' == true
'abba' & 'abbba' == false
'abba' & 'abca' == false
Write a function that will find all the anagrams of a word from a list. You will be given two inputs a word and an array with words. You should return an array of all the anagrams or an empty array if there are none. For example:
'abba' & 'baab' == true
'abba' & 'bbaa' == true
'abba' & 'abbba' == false
'abba' & 'abca' == false
Write a function that will find all the anagrams of a word from a list. You will be given two inputs a word and an array with words. You should return an array of all the anagrams or an empty array if there are none. For example:
0:02:46
0:03:54
0:11:02
0:11:11
0:11:55
0:08:59
0:06:40
0:24:56
0:31:03
0:25:23
0:35:29
0:03:46
0:07:03
0:08:36
0:00:51
2:19:17
2:02:12
0:31:06
0:03:03
0:50:07
0:09:27
0:15:02
0:10:38
0:03:46