Your question is FizzBuzz and Anagrams Coding. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Iowa State University utilities may need small text and sequence helpers. Implement one function that generates FizzBuzz output and checks whether two terms are anagrams.
For integers from 1 through n, return "Fizz" for multiples of 3, "Buzz" for multiples of 5, "FizzBuzz" for multiples of both, and the number as a string otherwise. Also compare first and second case-insensitively, ignoring spaces and punctuation. Return whether they contain the same letters and digits with the same frequencies.
Implement fizz_buzz_and_are_anagrams(n, first, second). The input is a positive integer n and two strings. Return a dictionary with a fizzbuzz list of strings and an anagrams Boolean.
def fizz_buzz_and_are_anagrams(n, first, second):