Upload Button Icon Add office photos

Salesforce

Compare button icon Compare button icon Compare

Filter interviews by

Salesforce Software Developer Interview Questions and Answers

Updated 12 Nov 2024

12 Interview questions

A Software Developer was asked
Q. 

Pair with Given Sum in a Balanced BST Problem Statement

You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such t...

Ans. 

Given a Balanced BST and a target integer, determine if there exists a pair of nodes with sum equal to the target.

  • Traverse the BST in-order to get a sorted array of values.

  • Use two pointers approach to find the pair with sum equal to target.

  • Consider edge cases like negative numbers and duplicates.

  • Time complexity should be O(n) and space complexity O(n).

A Software Developer was asked
Q. What is the difference between Early Binding and Late Binding in C++?
Ans. 

Early binding is resolved at compile time while late binding is resolved at runtime in C++.

  • Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

  • Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

  • Early binding is faster as the function call is directly linke...

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Rakuten
Q2. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Amazon
Q3. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
asked in PhonePe
Q5. Form a Triangle Problem Statement You are given an array of integ ... read more
A Software Developer was asked
Q. What is meant by multitasking and multithreading in operating systems?
Ans. 

Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.

  • Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly.

  • Multithreading enables a single process to execute multiple threads concurrently, improving performance and responsiveness.

  • Mult...

A Software Developer was asked
Q. 

Problem Description

Given a graph with 'N' nodes and 'M' unidirectional edges, along with two integers 'S' and 'D' representing the source and destination respectively, your task is to find all possible pa...

Ans. 

Find all possible paths from a source node to a destination node in a graph with unique nodes.

  • Create a graph using the given nodes and edges

  • Implement a depth-first search (DFS) algorithm to find all paths from source to destination

  • Ensure that the nodes in the paths are unique and print them in lexicographically sorted order

🔥 Asked by recruiter 2 times
A Software Developer was asked
Q. 

Cycle Detection in a Singly Linked List

Determine if a given singly linked list of integers forms a cycle or not.

A cycle in a linked list occurs when a node's next points back to a previous node in the l...

Ans. 

Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

  • Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

  • Start with two pointers, slow and fast, moving at different speeds. If they meet at some point, there is a cycle.

  • If the fast pointer reaches the end of the list (null), there is no cycle.

  • Example: ...

🔥 Asked by recruiter 2 times
A Software Developer was asked
Q. 

Longest Happy String Problem Statement

Given three non-negative integers X, Y, and Z, determine the longest happy string. A happy string is defined as a string that contains only the letters 'a', 'b', and ...

Ans. 

The problem involves constructing the longest happy string with given constraints on the frequency of 'a', 'b', and 'c'.

  • Iterate through the characters 'a', 'b', 'c' in decreasing order of their frequencies

  • Append the character with the highest frequency that does not create a substring of 3 same characters

  • Repeat until all characters are used up or the string reaches the desired length

A Software Developer was asked
Q. 

Balanced Parentheses Combinations

Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

Explanatio...

Ans. 

Generate all possible combinations of balanced parentheses for a given number of pairs.

  • Use recursion to generate all possible combinations of balanced parentheses.

  • Keep track of the number of open and close parentheses used in each combination.

  • Terminate recursion when the number of open and close parentheses used equals the given number of pairs.

Are these interview questions helpful?
A Software Developer was asked
Q. What is the difference between a virtual function and an abstract class in Object-Oriented Programming?
Ans. 

Virtual functions can be overridden in derived classes, while abstract classes cannot be instantiated directly.

  • Virtual functions are declared using the 'virtual' keyword and can be overridden in derived classes.

  • Abstract classes cannot be instantiated and may contain one or more pure virtual functions.

  • An abstract class can have virtual functions, but a virtual function does not make a class abstract.

  • Example: Shape ...

A Software Developer was asked
Q. 

Ninja and Chocolates Problem Statement

Ninja is hungry and wants to eat his favorite chocolates, but his mother won't let him because he has already eaten enough. There are 'N' jars filled with chocolates....

Ans. 

Find the minimum eating speed required for a ninja to consume all chocolates within a given time limit.

  • Iterate through possible eating speeds to find the minimum speed that allows the ninja to consume all chocolates within the given time limit.

  • Calculate the total number of chocolates to be consumed and divide it by the time limit to get the minimum eating speed.

  • Handle cases where a jar has fewer chocolates than th...

A Software Developer was asked
Q. 

Zuma Game Problem Statement

You have a string of balls on the table called BOARD and several balls in your hand represented by the string hand. The balls can be of the colors red(R), blue(B), green(G), whi...

Ans. 

Determine the minimum number of insertions required to empty the board in Zuma game problem.

  • Check if it's possible to empty the board by trying all possible combinations of inserting balls from hand.

  • Use backtracking algorithm to simulate the game and find the minimum number of insertions required.

  • Handle edge cases like when the board cannot be emptied or when the hand is empty.

  • Consider optimizing the algorithm by ...

Salesforce Software Developer Interview Experiences

7 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1 hour , dsa, hackerearth, medim to hard

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa question was asked in it
  • Q2. Questions related to resume was asked

Interview Preparation Tips

Interview preparation tips for other job seekers - study
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding test based on OOP and data structure

Round 2 - Coding Test 

Coding test based on data structure and algorithm

Round 3 - Technical 

(2 Questions)

  • Q1. Share your past experience
  • Q2. Toughest job you have done till date
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Keep learning about salesforce 5 rules and coding

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Logical reasoning aptitude english maths

Round 2 - Coding Test 

Data structure algorithms

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - Coding Test 

Probability related question

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 75 minutes. The questions were of Medium to Hard level of difficulty and I found the problem statements to be a bit tricky.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Terminate recursion when the number of open and close parentheses used equals the given number of pairs.

  • Answered by AI
  • Q2. 

    Longest Happy String Problem Statement

    Given three non-negative integers X, Y, and Z, determine the longest happy string. A happy string is defined as a string that contains only the letters 'a', 'b', and...

  • Ans. 

    The problem involves constructing the longest happy string with given constraints on the frequency of 'a', 'b', and 'c'.

    • Iterate through the characters 'a', 'b', 'c' in decreasing order of their frequencies

    • Append the character with the highest frequency that does not create a substring of 3 same characters

    • Repeat until all characters are used up or the string reaches the desired length

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 preety decent questions of DSA . The interviewer was also quite freindly and helpful. I was able to solve both the questions under the given time frame and also discussed their respective time and space complexites.

  • Q1. 

    Problem Description

    Given a graph with 'N' nodes and 'M' unidirectional edges, along with two integers 'S' and 'D' representing the source and destination respectively, your task is to find all possible p...

  • Ans. 

    Find all possible paths from a source node to a destination node in a graph with unique nodes.

    • Create a graph using the given nodes and edges

    • Implement a depth-first search (DFS) algorithm to find all paths from source to destination

    • Ensure that the nodes in the paths are unique and print them in lexicographically sorted order

  • Answered by AI
  • Q2. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

    • Start with two pointers, slow and fast, moving at different speeds. If they meet at some point, there is a cycle.

    • If the fast pointer reaches the end of the list (null), there is no cycle.

    • Example: For i...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 question related to BST followed by some standard questions from OOPS and Operating Systems.

  • Q1. 

    Pair with Given Sum in a Balanced BST Problem Statement

    You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such ...

  • Ans. 

    Given a Balanced BST and a target integer, determine if there exists a pair of nodes with sum equal to the target.

    • Traverse the BST in-order to get a sorted array of values.

    • Use two pointers approach to find the pair with sum equal to target.

    • Consider edge cases like negative numbers and duplicates.

    • Time complexity should be O(n) and space complexity O(n).

  • Answered by AI
  • Q2. What is the difference between Early Binding and Late Binding in C++?
  • Ans. 

    Early binding is resolved at compile time while late binding is resolved at runtime in C++.

    • Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

    • Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

    • Early binding is faster as the function call is directly linked dur...

  • Answered by AI
  • Q3. What is meant by multitasking and multithreading in operating systems?
  • Ans. 

    Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.

    • Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly.

    • Multithreading enables a single process to execute multiple threads concurrently, improving performance and responsiveness.

    • Multitask...

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

  • Q1. What is something about you that is not included in your resume?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASalesforce interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

Online Round - 2 questions. 
75 minutes

  • Q1. 

    Construct the Lexicographically Largest Valid Sequence

    You are provided with a positive integer N. The goal is to generate the lexicographically largest sequence of length 2*N - 1, containing integers ran...

  • Ans. 

    Generate lexicographically largest valid sequence of length 2*N - 1 with specific constraints.

    • Start with the largest numbers and place them at the ends to maximize lexicographical order.

    • Place the number 1 in the middle to satisfy the condition of appearing exactly once.

    • Determine the positions of other numbers based on their distance requirements.

    • Iterate through the sequence and fill in the numbers based on the constrai...

  • Answered by AI
  • Q2. 

    Zuma Game Problem Statement

    You have a string of balls on the table called BOARD and several balls in your hand represented by the string hand. The balls can be of the colors red(R), blue(B), green(G), wh...

  • Ans. 

    Determine the minimum number of insertions required to empty the board in Zuma game problem.

    • Check if it's possible to empty the board by trying all possible combinations of inserting balls from hand.

    • Use backtracking algorithm to simulate the game and find the minimum number of insertions required.

    • Handle edge cases like when the board cannot be emptied or when the hand is empty.

    • Consider optimizing the algorithm by pruni...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Hard

1 Coding problem and 1 OOP problem

  • Q1. 

    Ninja and Chocolates Problem Statement

    Ninja is hungry and wants to eat his favorite chocolates, but his mother won't let him because he has already eaten enough. There are 'N' jars filled with chocolates...

  • Ans. 

    Find the minimum eating speed required for a ninja to consume all chocolates within a given time limit.

    • Iterate through possible eating speeds to find the minimum speed that allows the ninja to consume all chocolates within the given time limit.

    • Calculate the total number of chocolates to be consumed and divide it by the time limit to get the minimum eating speed.

    • Handle cases where a jar has fewer chocolates than the eat...

  • Answered by AI
  • Q2. What is the difference between a virtual function and an abstract class in Object-Oriented Programming?
  • Ans. 

    Virtual functions can be overridden in derived classes, while abstract classes cannot be instantiated directly.

    • Virtual functions are declared using the 'virtual' keyword and can be overridden in derived classes.

    • Abstract classes cannot be instantiated and may contain one or more pure virtual functions.

    • An abstract class can have virtual functions, but a virtual function does not make a class abstract.

    • Example: Shape is an...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Hard

Resume based problems, OOPs, DBMS, OS problems

  • Q1. Design a platform similar to LinkedIn. What are the key features and architecture you would implement?
  • Ans. 

    Design a platform similar to LinkedIn with key features and architecture

    • Key Features: user profiles, connections, job postings, messaging, news feed, groups

    • Architecture: microservices, cloud storage, scalable database, AI for recommendations

    • Security: encryption, secure authentication, data privacy controls

    • User Experience: intuitive UI/UX, mobile app support, notifications

    • Monetization: premium subscriptions, advertising...

  • Answered by AI
Round 4 - HR 

Round duration - 15 Minutes
Round difficulty - Hard

Typical HR interview round. Short and crisp

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Delhi Technological University. Eligibility criteriaNo criteriaSalesforce interview preparation:Topics to prepare for the interview - DBMS, Data Structures and Algorithms , OOP, Maths puzzles, Aptitude , CN, OSTime required to prepare for the interview - 9 MonthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about Salesforce?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading, trailing, and multiple spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

    • Handle leading, trailing, and multiple spaces appropriately

  • Answered by AI
  • Q2. 

    Reverse a Stack Using Recursion

    You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...

  • Ans. 

    Reverse a stack using recursion without using any extra space other than the internal stack space.

    • Use recursion to pop all elements from the original stack and store them in function call stack.

    • Once the stack is empty, push the elements back in reverse order.

    • Base case of recursion should be when the original stack is empty.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Convert a Binary Tree to its Mirror Tree

    Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...

  • Ans. 

    Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.

    • Traverse the binary tree in a recursive manner.

    • Swap the left and right children of each non-leaf node.

    • Continue this process until all nodes have been processed.

  • Answered by AI
  • Q2. 

    Remove Nth Node from End of Linked List

    You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...

  • Ans. 

    Remove the Kth node from the end of a singly linked list.

    • Use two pointers approach to find the Kth node from the end.

    • Handle edge cases like removing the head node or removing the last node.

    • Update the pointers to remove the Kth node and reconnect the list.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical Managerial round.

Interview Preparation Tips

Eligibility criteriaAbove 6 months of experience24/7 customer private limited interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

General Tips: I asked my seniors about the interview process. Their guidelines were very helpful. Always try to bring the interviewer into your comfort zone. Also be confident and expressive while explaining. Explain your thought process while solving. Even though you don't get the solution the thought process might be very important for your selection.
College Name: NIT SURATHKAL

Interview Preparation Tips

Round: Test
Experience: Oracle had an online test which includes 3
Sections:
1. Programming: basic C++/java programming + data structure. One need to have good hand over oops
to score well in this section.

2. Aptitude: General Aptitude Questions

3. General Maths: Very simple maths problem (+2 level) but needs very very good speed.
Tips: Individual cutoff was not declared, but different cutoff for different profile is expected.
Oracle has no GD round.

Round: Interview
Experience: In 2nd round of interview, there was more programming, less resume based question and more emphasis on will I be comfortable in an IT sector. Some apti questions were also asked.

Round: Interview
Experience: 1st round was completely on resume based. Each and every project and intern is discussed in detail. Most of the extracurricular activities were also discussed. In the 1st interview, some basic program like fibonacci series by recursion, star pattern by loop etc were asked.

Round: Interview
Experience: Next round was HR. I was asked about the earlier 2 interviews and some basic HR questions.

College Name: IIT Roorkee

Salesforce Interview FAQs

How many rounds are there in Salesforce Software Developer interview?
Salesforce interview process usually has 1-2 rounds. The most common rounds in the Salesforce interview process are Coding Test, Technical and Aptitude Test.
How to prepare for Salesforce Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Salesforce. The most common topics and skills that interviewers at Salesforce expect are Analytical, CRM, Computer science, MIS and MTS.

Tell us how to improve this page.

Overall Interview Experience Rating

4.4/5

based on 7 interview experiences

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more
Salesforce Software Developer Salary
based on 133 salaries
₹10 L/yr - ₹40 L/yr
136% more than the average Software Developer Salary in India
View more details

Salesforce Software Developer Reviews and Ratings

based on 16 reviews

4.5/5

Rating in categories

4.1

Skill development

4.5

Work-life balance

4.7

Salary

4.4

Job security

4.3

Company culture

4.1

Promotions

4.0

Work satisfaction

Explore 16 Reviews and Ratings
Technical Support Engineer
983 salaries
unlock blur

₹15 L/yr - ₹26 L/yr

Technical Consultant
417 salaries
unlock blur

₹17.6 L/yr - ₹30 L/yr

Member Technical Staff
344 salaries
unlock blur

₹31.4 L/yr - ₹57.3 L/yr

Senior Technical Consultant
321 salaries
unlock blur

₹26.8 L/yr - ₹46.2 L/yr

Senior Member of Technical Staff
313 salaries
unlock blur

₹48 L/yr - ₹81 L/yr

Explore more salaries
Compare Salesforce with

SAP

4.2
Compare

Zoho

4.2
Compare

Oracle

3.7
Compare

Adobe

3.9
Compare
write
Share an Interview