Frontend Developer

'N' students are standing in a row. You are given the height of every student standing in the row. Your task is to find the longest strictly increasing subsequence of heights from the row such that the relative order of the students does not change.

A subsequence is a sequence that can be derived from another sequence by deleting zero or more elements without changing the order of the remaining elements.

Afzal has been working with an organization called 'Money Traders for the past few years. The organization is in the money trading business. His manager assigned him a task.

Given an array ’prices’ which denotes stock prices for ’n’ days, e.g., 'prices[ i ]' = price of the stock at ‘ith’ day, Find the stock's span for each day.

The span of the stock's price today is defined as the maximum number of consecutive days(starting from today and going backward) for which the price of the stock was less than today's price.

Example:

Input: ‘n’ = 7,  ‘prices’ = [100, 80, 60, 70, 60, 75, 85]

Output: [1, 1, 1, 2, 1, 4, 6]

Explanation: 
On the sixth day, when the stock price was 75, 

The span came out to be 4 because the last three prices(plus today) were less than the current or the sixth day's price.

Similarly, we can deduce the remaining results.

Note:

You don’t need to print anything. Just implement the given function

1) What is curring?
2) What is closure? He also asked me to implement closure. Then he asked some output questions related to closure.
3) Questions regarding eventloop with all minute details.
4) He asked me to write code for changing style using button click.
4) Difference between inline and block elements.
Then he asked me about my projects and internship.

I was able to answer all questions and was instantly called for round 2.

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.

For Example:

For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.

This round started with a formal introduction.
First interviewer asked a few output questions of JS which were quite tough.
Then he asked about event bubbling and asked me to write an event handler for a button.
Then the second interviewer asked questions related to box modal and selectors. Then he wrote CSS code for div and asked me to determine the colors of div.
Then he asked me about local storage, session storage and cache.
Then second interviewer asked some output questions of JS.
Then he asked about all the attributes of tag and few more questions related to HTML.