SDE - 1

Ninja got a map in his hand with ‘N’ cities numbered 0 to ‘N’, connected with bridges. He asks his sister to delete some cities from the map.

He will ask his sister a ‘Q’ query. Each query is denoted by an integer ‘X’, meaning that he will delete the city ‘X’. He wants to see if the new map obtained after deleting the city node will have more connected components than the previous map.

He wants to build the program for the queries given by his sister for the above condition.

Ninja knows that you are a very good programmer and can help him in writing the code for the above. Help Ninja!

Note:

A connected component in the map is the maximum subset of cities that are connected i.e we can go from one city to any other in that subset.

You are given a pattern in the form of a string and a collection of words. Your task is to determine if the pattern string and the collection of words have the same order.

Note :

The strings are non-empty.

The strings only contain lowercase English letters.

Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.

Example:

If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".

The string is compressed only when the repeated character count is more than 1.

Note :

The consecutive count of every character in the input string is less than or equal to 9.

You have a set of 10 weights, each weighing 10g. There are 10 such sets. However, one set contains 10 weights of 9g. Determine the set of 9g weights by using a weighing scale only once.

Tell me about yourself

Why do you want to be a part of our company?

Why do you want to join as Computer engineer?

Why did you choose this college?

Strength, weakness, family background.