Frontend Development Intern

We have a collection of 'N' stones, each stone has a positive integer weight.

On each turn, we choose the two heaviest stones and smash them together. Suppose the stones have weights 'x' and 'y' with 'x' <= 'y'. The result of this smash will be:

1. If 'x' == 'y', both stones are totally destroyed;

2. If 'x' != 'y', the stone of weight 'x' is totally destroyed, and the stone of weight 'y' has a new weight equal to 'y - x'.

In the end, there is at most 1 stone left. Return the weight of this stone or 0 if there are no stones left.

Design a given signin page using HTML and CSS only.

Design and develop and todo list type of application using localstorage.

Why you used object for storing the todo list rather than using an array?

Difference between inline, inline-block and block elements?

What is CDN?

What is the difference between localstorage, sesion-storage and cookies?

Difference between let and var keywords in javascript?

What is DOM and CSS Box Model?

What is hoisting in javascript?

What is memoization in js?

What is IIFE?

What are promises in javascript?

What is Temporal Dead Zone?

What are arrow functions?

What is JSX?

What are higher order functions?

What is virtual DOM?

Where do you see yourself in 5 years?

What are your expectations?