Problem 1: Program to display Fibonacci Series.
Input: How Many Terms do you want to Display: 12
Output: 0 1 1 2 3 5 8 13 21 34 55 89Problem 2: Program to find Factorial of number.
Input: Enter a Number: 5
Output: 5! = 120Problem 3: Program to find HCF of numbers.
Input: Enter 1st Number: 5
Enter 2nd Number: 12
Output: HCF: 1Problem 4: Program to find LCM of numbers.
Input: Enter 1st Number: 5
Enter 2nd Number: 12
Output: LCM: 1 Input: Enter a Number: 78
Output: It's not an Fibonacci Number
Input: Enter a Number: 55
Output: Yup! It's a Fibinacci Number Input: Enter a Number: 189
Output: No, It's not an Armstrong Number
Input: Enter a Number: 153
Output: It's an Armstrong NumberProblem 2: Program for Array Rotation.
Input: [ 5, 6, 7, 8, 1, 11, 15, 16], N = 4
Output: [1, 11, 15, 16, 5, 6, 7, 8] Input: [5, 7, 9, 4, 6, 23, 11, 12]
Output: Max: 23, MIN: 4 Input: Enter a Number: 121
Output: Palindrome Number
Input: Enter a Number: 123
Output: Not a Palindrome Number Input: Upto How Many Terms: 20
Output: 2 3 5 7 11 13 17 19 Input: [5, 6, 7, 9, 1, 10, 25, 31]
Output: No, It's not an Monotonic List
Input: [1, 2, 3, 4, 5, 6, 7, 8]
Output: Yup, It's an Monotonic ListProblem 2: Program for Reversing a list.
Input: [7, 4, 5, 6, 7, 8, 9, 1]
Output: [1, 9, 8, 7, 6, 5, 4, 7]Problem 3: Program for Searching elements in a list.
Input: [7, 6, 5, 3, 2, 6, 5, 10], N = 6
Output: Present Input: [7, 6, 5, 3, 2, 6, 5, 10]
Output: Second Largest Element is: 7 Input: [10, 5, 2, 6, 3, 7, 9, 4]
Output: [4, 5, 2, 6, 3, 7, 9, 10]Problem 1: Program for Cloning/Copying the list.
Input: [4, 5, 7, 8, 9, 6, 10, 15]
Output: [4, 5, 7, 8, 9, 6, 10, 15]Problem 2: Program for N Largest elements in a list.
Input: [4, 5, 7, 8, 9, 6, 10, 15]
Output: [15, 10, 9, 8]Problem 3: Program for Occurrences of elements.
Input: [14, 25, 16, 23, 10, 5, 6, 8, 7, 9, 10, 25, 14], N = 14
Output: 14 Occurs 2 timesProblem 4: Program for Removing Empty list.
Input: [5, 6, [], 7, 8, 9, [], 12, [], 4,[]]
Output: [5, 6, 7, 8, 9, 12, 4]Problem 5: Program for Removing Multiple Elements.
Input: [1, 2, 3, 4, 5], N = [2, 4]
Output: [1, 3, 5]Problem 1: Program to Break list into Chunks of list.
Input: [10, 45, 20, 62, 47, 85, 12, 63, 24, 78, 10], N = 2
Output: [[45, 20], [62, 47], [85, 12], [63, 24], [78, 10]]Problem 2: Program for Cumulative Sum of list.
Input: [10, 20, 30, 40, 50, 60]
Output: [10, 30, 60, 100, 150, 210]Problem 3: Program to print Duplicates in list.
Input: [4, 5, 1, 2, 6, 5, 2]
Output: [5, 2]Problem 4: Program for Flattening a list.
Input: [1, 2, [3, 4, [5, 6], 7], [[[8, 9], 10]], [11, [12, 13]]]
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]