# Salesforce Interview Experience for Internship (On-Campus 2020)

Online Test: There were 3 coding questions to be answered in 75mins

1. Give an array you have to sum up the values of the array and call the sum as q. You have to evaluate the following:

âˆ‘qi=1 âˆ‘qj=i F(i,j)

Where F(i,j)=sum of divisors of i and j. Simple, brute force solution was expected

2. Given an array find the number of index triplets (i,j,k) such that i<j<k and array[i]<array[j]<array[k] or array[i]>array[j]>array[k]

3. Minimum time required to rot all oranges

25 out of 200(around) were shortlisted for virtual interviews). You need to solve at least 2.5 questions as fast as possible

Round 1: First, there was an introduction from both sides. 2 coding questions:

Level of number in binary search tree(Simple recursive solution)

Given an array in sorted(ascending) order and a percentile value. (Percentile value: percentage number of values less than or equal to a given number of elements). You have to find an element with this or just a lesser percentile value than this.

Eg:

```Input: arr={1,2,3,4,5,6,7,8,9,10} percentile=50%
Output: 5```

Around 10 were sent for round 2.

Round 2: He directly gave me 1 question:

5 were sent to Round 3

Round 3: There were only Hr questions

1. Family members & what they are doing
2. What did you do during the lockdown
3. How were the last 2 interviews

And a few more ….

Finally, 3 were selected, and I was one of them…

Tips: Be patient even if you don’t get the question for the first time and keep asking questions and any hint if you need it. The interviewers were helpful enough.

Thank you GeksforGeeks for being constant help for the preparation

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!