1. Find the next palindrome number. If I pass any integer value to a function it should return the next palindrome number. 2. Print the first “n” prime numbers. N is anything a user might enter. 3. Write a function fib() that takes an integer n and returns the series up to nth Fibonacci number. 4. Create an Angular / React component which will have a progress bar. It will increment after 1 sec. The progress bar will keep on incrementing till the width of the page is met and then it will stop incrementing. 5. Write an algorithm that will tell if a group of characters can be a probable palindrome string with its different combinations. Example “rarecac”…. Its possible combinations can be rraacec, racecar, etc. Now Racecar is the palindrome, hence return true
