Panda Guru LogoPanda
Guru

Salesforce OA | General Software Engineer Assessment (INDIA ONLY) + onsites (Drive Sep 20)

Round 1

Questions:

  1. image
  2. image image image
Candidate's Approach

I solved the first question completely. For the second question, I used DFS but was only able to pass 11 out of 15 test cases. I recommend using BFS or Union Find for better results.

Interviewer's Feedback

No feedback provided.


Round 2

Questions:

  1. Promise based question.

  2. You are given a graph consisting of n nodes (numbered from 1 to n) and m edges. You need to first calculate the difference between the maximum numbered and minimum numbered node in each connected component. Then you need to answer the maximum of these differences across all connected components.

    Input: The first line of input consists of two space separated integers n (1 ≤ n ≤ 10^5) and m (1 ≤ m ≤ 10^5). The next m lines each consist of 2 space separated integers, u and v, which denote that there is an edge between the nodes u and v.

    Output: The output consists of a single integer - the maximum difference across all connected components.

    Example:

    Input 6 4 1 3 3 5 5 2 2 4 Output 4
Candidate's Approach

I did well in this round.

Interviewer's Feedback

No feedback provided.


Round 3

Questions:

Candidate's Approach

This round was not easy for sure. It took 2 hours, and my head is gonna explode.

Interviewer's Feedback

No feedback provided.


Round 4

Questions:

Candidate's Approach

The interviewer was smooth and listened to my answers carefully. I asked a couple of questions, and we concluded the round.

Interviewer's Feedback

No feedback provided.