SDE - Intern

Choose a stream of data of size A You have B different types of integers from which you have to select the stream of data. You can select an integer multiple times. A valid combination is a stream of data in which there are exactly C integers that are different from the previous integer in the sequence. You are given integers A B. and C The first Integer in the stream of data is not included among the C integers. Print the number of ways Of selecting a valid combination modulo 998244353.

Ankitha enjoys finding new games. One day she found a grid with dimensions and decided to make up a special game to play on it When Ankitha came up with the idea for the new gamer her friend Akhil joined her. She then decided to share and explain the game to him. Akhil is given a grid with dimensions MAN, where each cell contains either 0 or 1. Additionally. he is provided with the coordinates of source and destination cells. You can only move to places whose value is 0. Furthermore, he is given the move rule (x, y) which helps in finding the location for the next move. From the given cell, you can move in four directions (forward, back, right, left), unless they are out of the grid. The rules for finding the next move from a current cell are given below.• For moving forward, add the move rule to the current cell.• For moving right, from the current position add the thGnove rule, rotate the path 90 degrees clockwise,• For moving left, from the current position add the move rule, rotate the path 90 degrees anticlockwise direction.• For moving backwards, from the current position add the move rule, and rotate the path 180 degrees in clock or anti-clockwise. The rules can be understood better from the following example. Let the current cell be (1.1) and the move rule as (1,2)

Ninja has been given a sorted array/list ‘ARR’ of integers of size ‘N’ and 3 integer coefficients ‘X’, ‘Y’, and ‘Z’. Ninja needs to sort the ‘ARR’ by applying the quadratic equation ‘X(ARR[i] * ARR[i]) + Y(ARR[i]) + Z’ to each element of ‘ARR’.

For Example :

Let ‘ARR[]’ = [1, 2, -1] and ‘X’ = 1, ’Y’ =2 and ‘Z’ = 1. Then, for each element at index ‘i’ in the ‘ARR’:
For ‘i’ = 0, ‘ARR[0]’ = 1 and after applying the equation as ‘1 * (1 * 1) + 2 * (1) + 1‘ ‘ARR[0]’ becomes 4.
For ‘i’ = 1, ‘ARR[1]’ = 2 and after applying the equation as ‘1 * (2 * 2) + 2 * (2) + 1‘ ‘ARR[1]’ becomes 9 .
For ‘i’ = 2, ‘ARR[2]’ = -1 and after applying the equation as ‘1 * (-1 * -1) + 2 * (-1) + 1‘ ‘ARR[2]’ becomes 0.
So, ‘ARR’ after modification [4, 9, 0]. The final ‘ARR’ after sorting is [0, 4, 9].

As Ninja is weak with Maths, he asks you for help. Can you help Ninja sort the given ‘ARR’ after applying the quadratic equation to each element?

You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

Example:

Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.

Note:

1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order. 

2) All the elements of the array are pairwise distinct.

If a fridge has a light bulb inside which glows when the door is opened. How will you tell whether the light is turning off when the door is closed?

The interview looked over my live deployed projects.