Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Salesforce interview experience Real time questions & tips from candidates to crack your interview

Salesforce

4 rounds | 7 Coding
problems

Preparation

Duration: 2 months

Topics: Data Structures, Dynamic Programming, OOPS, OS, DBMS.

Tip

Tip 1 : For fresher role, System design is not very important.

Tip 2 : Do at least 1-2 good quality projects.

Application process

Where: Other

Eligibility: No criteria

Resume tip

Tip 1 : Have 1-2 good engaging projects in resume.

Tip 2 : Internships are helpful.

01

Round

Easy

Online Coding Interview

Duration60 minutes

Interview date8 Jan 2021

Coding problem2

Timing - flexible 12 hours window to take the test. (9AM - 9PM)

Test was proctored

View more

Problem approach

This was a online test.

This is a standard DP question.

I solved it in Time Complexity: O(N*m)

View more

Problem approach

This is a problem of topological sorting.

Time complexity of topological sorting is O(V+E). After finding topological order, the algorithm process all vertices and for every vertex, it runs a loop for all adjacent vertices.

overall time complexity of this algorithm is O(V+E).

02

Round

Easy

Video Call

Duration40 minutes

Interview date27 Jan 2021

Coding problem2

Timing - 9:00 AM - 9:40 AM

View more

Problem approach

Step 1 - Trailing 0s in x! = Count of 5s in prime factors of x!

= floor(x/5) + floor(x/25) + floor(x/125) + ....

Step 2 - We can notice that, the maximum value whose factorial contain n trailing zeroes is 5*n.

Step 3 -So, to find minimum value whose factorial contains n trailing zeroes, use binary search on range from 0 to 5*n. And, find the smallest number whose factorial contains...

View more

`The given linked list is 1 -> 2 ->...`

View more

Problem approach

We return the pointer of next node to his previous(current) node and then make the previous node as the next node of returned node and then returning the current node.

We first traverse till the last node and making the last node as the head node of reversed linked list and then applying the above procedure in the recursive manner.

03

Round

Easy

Video Call

Duration40 minutes

Interview date27 Jan 2021

Coding problem2

Timing - 12:00 Pm to 12:40 PM

`a) push(int x) : 'x' has to be inserted in t...`

View more

Problem approach

A typical priority queue supports the following operations:

Insertion

Deletion

top

View more

Problem approach

1) Whether the subtree itself is BST or not

2) If the subtree is left subtree of its parent, then maximum value in it. And if it is right subtree then minimum value in it.

3) Size of this subtree if this subtree is BST

04

Round

Medium

Video Call

Duration40 minutes

Interview date27 Jan 2021

Coding problem1

Timing - 6:00 PM - 6:30 PM

Design Splitwise and change 3 features that you dont like about it.

Problem approach

Tip 1: Be comfortable with all OOPS concepts.

Tip 2: They expected me to code in JAVA though I practiced DS algo in c++. So make sure you know atleast basics of java/python.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Is method overloading possible by changing the return type?

Start a Discussion

Similar interview experiences

Technical Associate

2 rounds | 3 problems

Interviewed by Salesforce

0 views

0 comments

0 upvotes

SDE - 1

3 rounds | 5 problems

Interviewed by Salesforce

640 views

0 comments

0 upvotes

MTS 1

3 rounds | 4 problems

Interviewed by Salesforce

1141 views

0 comments

0 upvotes

MTS 1

3 rounds | 6 problems

Interviewed by Salesforce

423 views

0 comments

0 upvotes

Companies with similar interview experiences

Associate Software Engineer

3 rounds | 10 problems

Interviewed by Amdocs

1631 views

0 comments

0 upvotes

Associate Software Engineer

3 rounds | 4 problems

Interviewed by Amdocs

1124 views

0 comments

0 upvotes

Associate Software Engineer

3 rounds | 5 problems

Interviewed by Optum

1148 views

0 comments

0 upvotes