Write recursive function that as an argument gets n and calculates what is corresponding number in n place in Fibonacci sequence For example f(8) = 21 (Fibonacci sequence for example: 0,1,1,2,3,5,8,13,21,34,55….) a. Discuss performance of the function with large n number. What are pitfalls? How function can be optimized. b. Bonus: write function complexity of space and time.
Write function that get an array and bubble sort it
[Hands-on coding] Adding a new feature to the take home assessment project.
Previous experience and frontend architectural questions.
Chatgpt but in a text area. Make sure you think about what database you want to use!
Tell me about a project you're proud of working on.
What have you learned from working for company x / y / z?
What is useState, useContext, useEffect?
Do a task that includes the following:- 1. CRUD operation: your app should have Add, Edit, Delete and View functionality. 2. You should mock the API via some sort of a server (You should do that instead of it being part of the setup provided by them) 3. Task takes 8 hours and will be discussed in person
What is the difference between throttling and debouncing?
Viewing 461 - 470 interview questions