Some questions for practice

• Find sum of all digits in a number, preferably in one line.
• Check if the given number is Armstrong, preferably in one line.
• Check if the given number is perfect square, without using any built in function.
• Write your own implementation of map()
• Write your own implementation of reduce()
• Write your own implementation of filter()
• Write your own implementation of zip()
• Write your own implementation of enumerate()
• Write your own implementation of range()
• Write a generator that gives first n Fibonacci number.
• Implement sets using dictionaries.
• Write a decorator to print the time taken by a function.

Put your solutions as a .ipynb file of your name in the solutions directory.