AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Salesforce Software Developer Interview Questions, Process, and Tips
Top Salesforce Software Developer Interview Questions and Answers
- Q1. Balanced Parentheses Combinations Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using th ...read more
- 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 c ...read more
- Q3. 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, ...read more
Salesforce Software Developer Interview Experiences
7 interviews found
Anonymous
1 hour , dsa, hackerearth, medim to hard
(2 Questions)
- Q1. Dsa question was asked in it
- Q2. Questions related to resume was asked
Interview Preparation Tips
rahul kumar
Coding test based on OOP and data structure
Coding test based on data structure and algorithm
(2 Questions)
- Q1. Share your past experience
- Q2. Toughest job you have done till date
zen sfdc
Keep learning about salesforce 5 rules and coding
Selected
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Logical reasoning aptitude english maths
Data structure algorithms
Salesforce interview questions for designations
Selected
I applied via Campus Placement and was interviewed in Sep 2023. There was 1 interview round.
Probability related question
Get interview-ready with Top Salesforce Interview Questions
I appeared for an interview in Aug 2021.
(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
Nrepresenting 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.
- Q2.
Longest Happy String Problem Statement
Given three non-negative integers
X,Y, andZ, 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
(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
- 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
nextpoints 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...
(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).
- 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...
- 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...
(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
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.
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.
Skills evaluated in this interview
I appeared for an interview in Feb 2021.
(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...
- Q2.
Zuma Game Problem Statement
You have a string of balls on the table called
BOARDand several balls in your hand represented by the stringhand. 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...
(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...
- 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...
(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
Round duration - 15 Minutes
Round difficulty - Hard
Typical HR interview round. Short and crisp
Interview Preparation Tips
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
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Skills evaluated in this interview
Interview questions from similar companies
Interview Questionnaire
16 Questions
- Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
- Q2. Explain insertion sort,quicksort
- Ans.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
- Q3. Concept of virtual destructors,runtime polymorphism
- Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
- Q5. Merge two sorted linked lists using recursion
- Ans.
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
- Q6. Given an integer(consider 4 bytes) find which byte is zero
- Ans.
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
- Q7. Program to check whether your machine is little endian or big endian
- Ans.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
- Q8. Print something before execution of main()(use static objects)
- Ans.
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
- Q9. Memory allocation for static varibles(when,which segment etc)
- Ans.
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
- Q10. Find space and time complexity for a recursive function(he wrote it)
- Ans.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
- Q11. Some questions on major project
- Q12. Preprocessor directives,volatile keyword
- Q13. Virtual pointer table,operator overloading,friend functions,semaphores
- Q14. Diamond heirarchy problem
- Ans.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
- Q15. Fibonacci series.(:P)
- Q16. Puzzle
Interview Preparation Tips
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.
College Name: NA
Skills evaluated in this interview
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
Interview Questionnaire
12 Questions
- Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
- Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
- Ans.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
- Q3. He then asked me to give test cases for testing this program
- Q4. Given two unsorted arrays of numbers and asked me to find the intersection
- Q5. GetMax() function for a stack in O(1)
- Ans.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
- Q6. GetMax() function for a queue in O(1)
- Ans.
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
- Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
- Q8. Given an array, find the Next Greatest Element to the right for each element
- Ans.
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
- Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
- Ans.
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
- Q10. Given an array of integers, find the maximum product which can be formed by three numbers
- Ans.
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
- Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
- Ans.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
- Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Salesforce Interview FAQs
Tell us how to improve this page.
Salesforce Interviews By Designations
- Salesforce Technical Support Engineer Interview Questions
- Salesforce Software Developer Interview Questions
- Salesforce Mts Software Engineer Interview Questions
- Salesforce Member Technical Staff Interview Questions
- Salesforce Support Engineer Interview Questions
- Salesforce Technical Consultant Interview Questions
- Salesforce Associate Technical Support Engineer Interview Questions
- Salesforce Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Salesforce Software Developer Interview Process
based on 7 interviews
1 Interview rounds
- Coding Test Round
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Salesforce Software Developer Reviews and Ratings
based on 10 reviews
Rating in categories
|
Technical Support Engineer
904
salaries
|  ₹12 L/yr - ₹25 L/yr |
|
Technical Consultant
344
salaries
| ₹13.8 L/yr - ₹32 L/yr |
|
Member Technical Staff
282
salaries
| ₹18.8 L/yr - ₹60 L/yr |
|
Senior Member of Technical Staff
257
salaries
| ₹30 L/yr - ₹98 L/yr |
|
Senior Technical Consultant
247
salaries
| ₹18 L/yr - ₹45.1 L/yr |
SAP
Zoho
Oracle
Adobe
- Home >
- Interviews >
- Salesforce Interview Questions >
- Salesforce Software Developer Interview Questions
