SDE - Intern

You are given an array of N integers and an integer K. For each array element, you are allowed to increase or decrease it by a value k. The task is to minimize the difference between the maximum element and the minimum element after modifications.

This time we are executing a program containing ‘N’ functions on a single-threaded CPU. Each function has a unique ‘ID’ between 0 and (N-1) and each time it starts or ends, we write a log with the ID, whether it started or ended, and the TIMESTAMP.

You are given a 2D array of integers containing information about ‘L’ logs where ith column represents the ith log message. Each column contains 3 rows to describe the ith log where,

1st Row - represents the ID of the function.

2nd Row - represents whether the function has started or ended where 1 denotes the start and -1 denotes the end.

3rd Row - represents the TIMESTAMP of the log.

You are required to return an array where the value at the ith index represents the exclusive time for the function with ID ‘i’.

Note:

1. The exclusive time of a function is the sum of execution times for all calls of that function.

2. A function can be called multiple times, possibly recursively.

3. No two events will happen at the same time where an event denotes either a start or end of a function call. This basically means no two logs have the same timestamp. 

4. Each function has an end log for each start log. 

For Example:

Consider the following input
0 1 1 1 2 2 1 0
1 1 1 -1 1 -1 -1 -1
0 2 5 7 8 10 11 14

Thus, we return [5, 7, 3] as a process with ID 0 has taken 5 units of time and process with ID 1 has taken 7 units of time and process ID 2 has taken 3 units of time. A process’s exclusive time is the sum of exclusive times for all function calls in the program. As process Id 1 has called itself so exclusive time is the sum of exclusive times(5 + 2).

You have been given a directed weighted graph of ‘N’ vertices labeled from 1 to 'N' and ‘M’ edges. Each edge connecting two nodes 'u' and 'v' has a weight 'w' denoting the distance between them.

Your task is to calculate the shortest distance of all vertices from the source vertex 'src'.

Note:

If there is no path between 'src' and 'ith' vertex, the value at 'ith' index in the answer array will be 10^8.

Example :

3 3 1
1 2 2
1 3 2
2 3 -1

In the above graph: 

The length of the shortest path between vertex 1 and vertex 1 is 1->1 and the cost is 0.

The length of the shortest path between vertex 1 and vertex 2 is 1->2 and the cost is 2.

The length of the shortest path between vertex 1 and vertex 3 is 1->2->3 and the cost is 1.

Hence we return [0, 2, 1].

Note :

It's guaranteed that the graph doesn't contain self-loops and multiple edges. Also, the graph does not contain negative weight cycles.

In this round, the interviewer mainly focused on behavioral and experience-based questions. I was asked to explain my internship experience at the startup Cograd and the application I built during that time. The interviewer also asked how the project helped the company and what my role was in the development process.

There were questions about how I handle conflicts within a team, how I collaborate with seniors and juniors while working on projects, and some general HR questions about my strengths, motivations, and career goals.

The final round was more of an interaction with a senior HR representative. The discussion was informal and focused on understanding my personality, interests, and cultural fit for the company. We talked about my interests outside academics, including my interest in Formula 1 racing. I also discussed how I admire the long-term partnership between Oracle and Formula 1 teams.

The conversation mainly revolved around my interests, my motivation to work at Oracle, and a general discussion about the company and my future goals.