Frontend Engineer

Ninja is feeling very bored and wants to try something new. So, he decides to find the reverse of a given number. But he cannot do it on his own and needs your help.

Note:

If a number has trailing zeros, then its reverse will not include them. For e.g., the reverse of 10400 will be 401 instead of 00401.

A polyfill for Promise.all() in JavaScript can be implemented to provide support for environments where it might not be available. Promise.all() is used to wait for multiple promises to fulfill and then returns a single promise that resolves after all of the input promises have resolved, or rejects with the reason of the first promise that rejects. 

Promise.all() and Promise.allSettled() are both methods available on the Promise object in JavaScript, but they have different behaviors:

Promise.all():

• It takes an array of promises as input.
• It returns a single promise that resolves when all of the input promises have resolved or when any one of them rejects (whichever happens first).
• If any of the input promises rejects, the returned promise will be rejected with the reason of the first promise that rejects.
• If all input promises fulfill successfully, the returned promise will be fulfilled with an array containing the fulfillment values of all input promises, in the same order as the original array.

Promise.allSettled():

• It takes an array of promises as input.
• It returns a single promise that resolves after all of the input promises have settled (i.e., either fulfilled or rejected).
• The returned promise will always fulfill, even if some of the input promises reject.
• The fulfillment value of the returned promise is an array of objects representing the outcome of each input promise. Each object has a status property indicating whether the promise was fulfilled or rejected, and a value or reason property containing the fulfillment value or rejection reason of the corresponding promise.

You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.

For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.

Design a frontend component using higher order components

Difference between server side rendering and client side rendering

How to improve the speed of a client side rendered application

What is virtual dom and how does reconciliation work in react

Why do you want to join and will you be able to cope up in high paced environment type of questions