Frontend developer II

Stark Industry is planning to organize Stark Expo, for which various departments have to organize meetings to check their preparations. Since Stark Tower has limited rooms available for the meeting, Tony decided to allot a room to each meeting so that all the meetings are organized in the least possible conference rooms, and a the moment, only one meeting will happen in one room. So, he asked JARVIS to allot each meeting a room and tell the minimum number of conference rooms to be reserved. But, since JARVIS was busy rendering another Iron Man suit model, he asked you to help.

You are given an array of integers ARR of size N x 2, representing the start and end time for N meetings. Your task is to find the minimum number of rooms required to organize all the meetings.

Note:

1. You can assume that all the meetings will happen on the same day.
2. Also, as soon as a meeting gets over if some other meeting is scheduled to start at that moment, they can then be allocated that room.

Note:

Try to solve the problem in linear time complexity.

For Example:

Consider there are three meetings scheduled with timings:
1pm - 4pm
3pm - 5pm
4pm - 6pm

At the start of time, meeting 1 will be allotted room 1, which will be occupied till 4 pm hence for meeting 2 we’ll have to provide another room. At 4 pm, meeting 3 can be organized in room 1 because by that time, meeting 1 would have ended. Hence we’ll require two rooms for holding all three meetings.

You are a student of Netaji Subhas Institute of Technology. You have to take ‘N’ number of courses labelled from 1 to N to complete your B.Tech Degree.

Some courses may have prerequisites, for example, to take course 1 you have to first take course 2, which is expressed as a pair: [1, 2]. Now, your task is to find is it possible for you to finish all courses.

Note: There are no duplicate pairs in the prerequisites array.

For example-

If N = 2 and prerequisite = [[1, 2]]. Then, there are a total of 2 courses you need to take. To take course 1 you need to finish course 2. So, it is possible to complete all courses. 

Ques: Create a Deep Flatten Function

const obj = {
A: '12',
B: 23,
C: {
P: 23,
O: {
L: 56,
},
Q: [1, 2],
},
};

console.log(deepFlatten(obj));

// {
// A: "12"
// B: 23
// C.O.L: 56
// C.P: 23
// C.Q.0: 1
// C.Q.1: 2
// }

Given an array of objects, print each element after the delay specified in the timer property of the object, where the timer is in milliseconds. For example, 'abc' will be printed after 3 seconds, and '123' will be printed after 4 seconds. The array is as follows:

[  { value: "abc", timer: 3000 },  

{ value: "123", timer: 4000 },

  { value: "xyz", timer: 1000 } ]

Create a toggler behaviour where clicking on one item should highlight it.
 

document.querySelector("table").addEventListener("click", highlightCells);

let selectedCell = null;

function highlightCells(e) {
 if (e.target.tagName === "TD") {
   const currTd = e.target;

   if (selectedCell) {
     selectedCell.classList.remove("bgColor");
   }

   selectedCell = currTd;
   selectedCell.classList.add("bgColor");
 }
}
 

Build a popular arcade game where players attempt to hit moles as they pop up from holes in a board.

Requirements

- The game should have a grid of 9 holes.
- When the game starts, a mole will pop up randomly from one of the holes.
- The player must click on the mole to whack it. When the player whacks the mole, they will get a point.
- If the player does not whack the mole within 1.5 seconds, the mole will disappear.
- The next mole randomly appears from one of the holes and the process repeats.
- The player has 15 seconds to hit as many moles as possible.
- The game ends when the timer runs out, the score is displayed and the player has the option to play again.