TCS Ninja

There are an infinite number of electric bulbs. Each bulb is assigned a unique integer starting from 1. There are ‘N’ switches also and each switch is labeled by a unique prime number. If a switch labeled with prime integer ‘p’ is turned ON, then all the bulbs having a number that is multiple of ‘p’ will start glowing. For example, if we turn ON the switch labelled 2, then all the bulbs having numbers 2, 4, 6, 8, 10, ... i.e all bulbs with numbers as multiples of 2 will start glowing.

You are given an array/list ‘LABELS’ consisting of ‘N’ unique prime integers representing the label of the switches and an integer ‘K’. Your task is to find the integer assigned to Kth glowing bulb from the start when all these ‘N’ switches are turned ON.

Note :

1. Some bulbs can glow by multiple switches and some are not glowed by any switch.
2. If any of the switches that can glow a bulb is turned ‘ON’, then the corresponding bulb will glow.

Example :

Consider 3 switches with labels [3, 5,  7] and we need to find the 5th glowing bulb from the start after turning these 3 switches ON.
We can see that bulbs numbered  3, 6, 9, 15, 18 …  will glow if the switch having label 3 is turned ON.
The bulbs numbered 5, 10, 15, 20 … will glow if the switch having label 5 is turned ON.
The bulbs numbered 7, 14, 21, 28 … will glow if the switch having label 7 is turned ON.
It implies that bulbs numbered 3, 5, 6, 7, 9, 10, 14, 15, 18, 20, 21… will glow when these three switches are turned ON.
The 5th glowing bulb from start is assigned integer 9. Thus, we should return 9.

There is a fight between Spiderman and the Zombie. Spiderman has to protect the planet earth, and for this, he has to give punches in the head of the zombie. The Spiderman is given an integer ‘N’ and he has to construct a number ‘Num’ such that the count of nice divisors of ‘NUM’ is maximum and the constructed number has at most 'N' prime factors. It is not necessary for all prime factors of ‘NUM’ to be distinct. A divisor of ‘NUM’ is called nice if it is divisible by every prime factor of ‘NUM’. Assuming yourselves as spiderman protect the planet earth by returning the nice divisors of ‘NUM’.

Return the number of nice divisors of ‘NUM’. Since that number can be too large, return it modulo 10^9 + 7.

For Example:

If N = 12, then its prime factors are [2, 2, 3], then 6 and 12 are nice divisors, while 3, 4, and 2 are not.

1) Second Highest Salary from the table
2) What is Normalization?
3) Difference between delete vs truncate vs drop?
4) Difference between primary key and secondary key?
5) What is Inner Join and Right join?

1) What is Linear Regression?
2) What are the different types of algorithms?
3) Explain the Difference Between Classification and Regression?
4) How to Tackle Overfitting and Underfitting?
5) What is Supervised Learning?
6) What is Cross-Validation?

1) What is the motivation regarding the project you have built?
2) What are the technologies used?
3) Follow up question regarding the projects?

1) What is an array?
2) What is LinkedList?
3) Difference between Singly LinkedList and Doubly LinkedList
4) Difference between stack and queue

1) Why do you want to join TCS?
2) Where do you see yourself in the next 5 years?
3) If your colleague is in trouble what will you do?