Member of Technical Staff

You are given ‘n’ cities, some of which are connected by bidirectional roads. You are also given an ‘n x n’ matrix i.e. ‘roads’, where if city ‘i’ and ‘j’ are connected by a road then ‘roads[i][j]'= 1, otherwise ‘roads[i][j]' = 0.

A province is a group of cities that are either directly or indirectly connected to each other through roads.

The goal is to count and return the total number of such provinces in the given matrix.

Example:

n = 4, roads = [ [1, 1, 1, 0],
                 [1, 1, 1, 0],
                 [1, 1, 1, 0],
                 [0, 0, 0, 1] ]

So, there are ‘2’ provinces.

Note:

1. A city is connected to itself. So, for every city ‘i’, ‘roads[i][i] = 1’.

A coach is forming a new team of size K from a pool of N available players. Each player has a skill rating, given as an integer. The coach wants to form the most cohesive team possible.

Team Cohesion is defined as the difference between the highest and lowest skill ratings of the players on the team. A smaller difference indicates better cohesion.

Your task is to find the minimum possible cohesion score for a team of size K. To do this, you will need to find a group of K players from the pool whose maximum and minimum skill ratings are as close as possible.

Given an array 'arr' of 'n' non-negative integers, your task is to move all the zeros to the end of the array while keeping the non-zero elements at the start of the array in their original order. Return the modified array.

Example :

Input: ‘n’ = 5, ‘arr’ = [1, 2, 0, 0, 2, 3]
Output: [1, 2, 2, 3, 0, 0]

Explanation: Moved all the 0’s to the end of an array, and the rest of the elements retain the order at the start.

You are given an array/list 'asteroids' representing asteroids in a row.

For each element of the given array, its absolute value denotes the size of that asteroid, and its sign denotes the direction it moves in(+ve meaning right and -ve meaning left).

An asteroid with a weight of 0 denotes a massless asteroid that moves in the right direction.

All asteroids are moving at the same speed. Whenever two asteroids collide, the smaller asteroid gets destroyed.

If both asteroids are the same size, then both asteroids get destroyed. Two asteroids moving in the same direction never collide.

You are supposed to find the state of the asteroids after all collisions.

Example :

Input: ‘asteroids’ = [3,-2,4]

Output: [3, 4]

Explanation: The first asteroid will destroy the second asteroid. Hence, after the collision, the state of the asteroids will be [3,4].

Note:

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

You are given a table named Employees with the following columns:
EmpID (INT)
EmpName (VARCHAR)
Department (VARCHAR)
Salary (INT)
Write an SQL query to find the names of employees who work in the 'IT' department and have a salary greater than 50,000.

• Tell me about yourself.
• What are your strengths and weaknesses?
• Why do you want to work for our company?
• Where do you see yourself in the next 5 years?
• Describe a situation where you worked in a team.