it includes some React Js and Javascript questions

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

L1: css positions, props, virtual dom, functional components, class components, difference between them, Hoisting, promises, promises.all, es6 functions, props drilling, context api, redux, difference between class and functional, callback, diff let, var and const, css properties, git stash, cherrypick, reducers, setState, hooks, spread operator, rest operator, diff between both, react optimization, error boundaries, closures L2: Q1. Implement progressbar which keeps incrementing after every 10s to 10px till it reaches browser width. Q2. Write a function to print n prime number eg. n=5 print 5 prime numbers eg: 2,3,5,7,9 etc. Q3: Write a program to shuffle string 'sadads' in all possible patterns and find the palidrome in it.