SDE - 2

There is an array 'JUMP' of size 'N' which is 1-indexed and you are currently at index 1. Your goal is to reach index 'N' (end).

When you are at index 'i', you can jump a maximum length of 'JUMP[i]' which means you can make a jump of size 1 to JUMP[i]. Return true if you can reach the end otherwise false.

Example:-

N = 5
JUMP = [1,2,3,4,5]

ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.

In a social group, there are ‘N’ people, with unique integer ids from 0 to (N - 1). We have an array of ‘logs’, where each logs[i] = [timestamp, idA, idB] contains a non-negative integer ‘timestamp’ and the ‘ids’ of two different people.

Each log represents the time in which two different people became friends.

Let’s say that person A is acquainted with person B if A is friends with B, or A is a friend of someone acquainted with B. Your task is to return the earliest time every person became acquainted with every other person.

Note:

1) The ids are 0-indexed.

2) Friendship is symmetric here. That is, if A is friends with B, then B is friends with A.

3) Return -1 if there is no such earliest time.

For example:

Given ‘logs’ =[[2, 0, 1],[3, 1, 2],[4, 2, 3]].

The answer here would be 4 : 
When the people with id 2 and 3 become friends, then the circle gets completed, and the time among them is 4, and because 4 is the largest time among all, the time for the circle to get completed is 4.

Ninja lives in the village and has animal husbandry which consists of various animals like cows, sheep, etc. Ninjas’ village also has animal-eating monsters which eat animals that are not present in the fence of the husbandry. You have given the points array ‘POINTS’ having ‘N’ vertices which denote the coordinates in the X-Y plane of the fence and the coordinates of the animal ‘X’ and ‘Y’. The width of the fence is very large so the points present on the fence are considered to be inside. Find if the given animal is safe from monsters or not.

Imagine that you have 26 constants, labeled A through Z. Each constant is assigned a value in the following way: A = 26^1, B = 25^2, C = 24^3, D = 23^2, and so on, until Z = 1^26. Find the exact numerical value of the following equation: (Y - A) * (Y - B) * (Y - C) * ... * (Y - Z).

-Describe a time when you experienced conflict with a coworker. How did you handle it?

-How does this job compare to others you might be interviewing for?

-What interests you about this role?

-What critical feedback do you most often receive?