Numpy Python Challenge part13 [w/ subs]



00:00:03 – we're at the end of this chapter and I'd
00:00:05 – like to give you a challenge in this
00:00:07 – challenge you will divide the words of
00:00:09 – it occurring two classes based on their
00:00:11 – length then find a number of anagrams
00:00:14 – within each class you may imagine that
00:00:16 – they are very few anagrams that involve
00:00:19 – very long complicated words whereas
00:00:21 – there are more for short and more common
00:00:23 – words let's find out if that is the case
00:00:24 – so your objectives for this challenge to
00:00:28 – start with a-list awards and divided
00:00:30 – into sub lists based on the length
00:00:32 – awards then for each sub list find all
00:00:35 – the anagrams and then count the total
00:00:37 – number of anagrams in each sub list you
00:00:40 – can use the Python code to find anagrams
00:00:42 – that we developed in this chapter you
00:00:44 – will find it in exercise file or 303
00:00:47 – this challenge should take about 10
00:00:49 – minutes when you're done be sure to
00:00:52 – check my solution video let's go


Video Url:
http://youtu.be/jfjHpnNwgQs

Comments

comments