SDE - 1

You are given a list of comparison equations, where each equation is in the form of “a!=b” or “a==b”. Your task is to check if all the equations satisfy or not and print the boolean value accordingly.

Note:

All the variables in the equations are lower case English alphabets.

For Example:

You are given ‘equations’ = [‘a==b’, ‘a==c’, ‘b!=c’], here ‘a’ is equal to ‘b’ and ‘c’ so by associative law ‘b’, and ‘c’ must be equal, but it is given ‘b!=c’. Hence all the equations do not hold. Therefore the answer is False.

We have to complete a total of ‘N’ works. Now, each work can be done on only one of the two special days given in 2 different arrays ‘day1’ and ‘day2’ respectively.

day1[i] denotes that the ‘i-th’ work can on the day1[i] th day and day2[i] denotes that the ‘i-th’ work can on the day2[i] th day. Also, it is guaranteed that day2[i] < day1[i].

Also, make sure, the works are being done in such a way that they must be in non-decreasing order in terms of days given in array ‘day1’.

Your task is to find the minimum number of days in which all the work can be completed.

For example

day1 = {5, 6, 2}
day2 = {2, 4, 1}

In this case, the ideal order will be to perform work 3 on the first day, work 1 on the second day and work 2 on the fourth day. The order with respect to Day1 in which the work is done will be {2, 5, 6} which is non-decreasing. Hence the number of days needed to finish all work will be 4.

Ninja is doing an offline course that has a duration of ‘N’ days. After attending the course, the ninja gains some experience ‘EXP[i]’ (for the day ‘i’). On some days, the ninja is busy and will not be able to attend the course, hence not gaining any experience on that day. If ‘BUSY[i] = 1’, then the ninja is busy on day ‘i’. Otherwise, if ‘BUSY[i] = 0’, the ninja attends the course on day ‘i’. To get the most out of the course, the ninja can focus for ‘K’ days straight (only once during the course), attending the course every day for these ‘K’ consecutive days. You are given two arrays, ‘EXP’ and ‘BUSY’, each of size ‘N’. You are also given an integer ‘K’. The task is to find the maximum experience that the ninja can gain from this course.

Example :

‘N’ = 6, ‘K’ = 3
‘EXP’ = [1, 4, 2, 2, 3, 6]
‘BUSY’ = [0, 1, 1, 0, 0, 1]
To get the maximum experience ninja has to focus on the last ‘3’ days. The maximum experience gained will be = 1 + 2 + 3 + 6 = 12. So, the answer is 12.

You have been given a gold mine represented by a 2-d matrix of size ('N' * 'M') 'N' rows and 'M' columns. Each field/cell in this mine contains a positive integer, the amount of gold in kgs.

Initially, the miner is at the first column but can be at any row.

He can move only right, right up, or right down. That is from a given cell and the miner can move to the cell diagonally up towards the right or right or diagonally down towards the right.

Find out the maximum amount of gold he can collect.

Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.

1 Why did you decide to apply to this role?
2. What experience do you have that would be relevant to this role?
3. Tell me about your experience in …
4. What did you like most about the job description?
5. Why are you leaving your current job? / Why did you leave your previous job?
6. What do you know about our company’s product/services?
7. Tell me about this gap in your resume.
8. Describe the workplace where you’ll be most happy and productive.
9. What are your salary expectations?
10. Do you have any questions?