SDE - 1

This time Ninja has a 'GRID' of size 'N' x 'M' of binary values (0s and 1s) the 1s in a cell represent the stones. A stone will not fall when that satisfies 2 conditions:

1) It is directly connected to the top of the grid

2) At least one of its adjacent (top,bottom,left, right) stones will not fall.

Ninja has 'R' sequence of locations of stones (given in a matrix 'REM' of size 'R' X 2). In each case, he wants to remove the stone placed at (i, j) place but due to this action, some other stones will also fall. So he needs your help to find the number of stones that fall after each removal in sequence.

Return an array of size 'R' denoting the number of stones that fall after each removal of a stone.

Note:

Sometimes a removal may refer to a location with no stone, in that case, no stone fall.

Design a given signin page using HTML and CSS only.

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?

You are given string S of length N, and an integer K. Your task is to find the length of the longest substring that contains at most K distinct characters.