AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Salesforce Associate Software Engineer Interview Questions and Answers
7 Interview questions
Largest BST Subtree Problem
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
Input:
The first line contains an integer 'T', represent...The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.
Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve the problem efficiently.
Consider edge cases like empty tree or single node tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -...
Reverse Linked List Problem Statement
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 ->...
To reverse a singly linked list of integers, return the head of the reversed linked list.
Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.
Keep track of the previous, current, and next nodes while traversing the list.
Update the head of the reversed linked list to be the last element of the original list.
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested you...
Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().
Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.
Implement a heap data structure to maintain the priority queue.
Handle different types of queries based on th...
Design a system similar to Splitwise and suggest three features for improvement.
Implement a real-time notification system for updates on shared expenses
Integrate a feature for automatic currency conversion for international transactions
Enhance the user interface with data visualization tools for better expense tracking
Factorial Trailing Zeros Problem
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
Example:
Input:
N = 1
Output:
...
Find the smallest number whose factorial has at least N trailing zeros.
Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.
Use binary search to find the smallest number with at least N trailing zeros.
Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.
Combination Sum Problem Statement
Given three integers X, Y, and Z, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X, Y, and Z t...
Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.
Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.
Calculate the sum of each combination and add them up.
Return the final sum modulo 10^9 + 7.
Longest Path In Directed Graph Problem Statement
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'. ...
The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.
Implement a function that takes the number of nodes, edges, source node, and edge weights as input.
Use a topological sorting algorithm to traverse the graph and calculate the longest distances.
Return an array of integers where each element represents the longest distance from the source node to the corres...
Salesforce Associate Software Engineer Interview Experiences
1 interview found
Anonymous
I appeared for an interview before May 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored
- Q1.
Combination Sum Problem Statement
Given three integers
X,Y, andZ, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum ofX,Y, andZ... - Ans.
Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.
Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.
Calculate the sum of each combination and add them up.
Return the final sum modulo 10^9 + 7.
- Q2.
Longest Path In Directed Graph Problem Statement
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....
- Ans.
The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.
Implement a function that takes the number of nodes, edges, source node, and edge weights as input.
Use a topological sorting algorithm to traverse the graph and calculate the longest distances.
Return an array of integers where each element represents the longest distance from the source node to the correspondi...
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
Timing - 9:00 AM - 9:40 AM
- Q1.
Factorial Trailing Zeros Problem
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
Example:
Input:
N = 1
Output:
... - Ans.
Find the smallest number whose factorial has at least N trailing zeros.
Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.
Use binary search to find the smallest number with at least N trailing zeros.
Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.
- Q2.
Reverse Linked List Problem Statement
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 -&g...
- Ans.
To reverse a singly linked list of integers, return the head of the reversed linked list.
Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.
Keep track of the previous, current, and next nodes while traversing the list.
Update the head of the reversed linked list to be the last element of the original list.
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
Timing - 12:00 Pm to 12:40 PM
- Q1.
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
- Ans.
Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().
Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.
Implement a heap data structure to maintain the priority queue.
Handle different types of queries based on the inp...
- Q2.
Largest BST Subtree Problem
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
Input:
The first line contains an integer 'T', represen... - Ans.
The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.
Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve the problem efficiently.
Consider edge cases like empty tree or single node tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 ...
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
Timing - 6:00 PM - 6:30 PM
- Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
- Ans.
Design a system similar to Splitwise and suggest three features for improvement.
Implement a real-time notification system for updates on shared expenses
Integrate a feature for automatic currency conversion for international transactions
Enhance the user interface with data visualization tools for better expense tracking
Interview Preparation Tips
Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Basic java
Interview Preparation Tips
Interview Questionnaire
8 Questions
- Q1. WRITE A GENERIC SWAP FUNCTION
- Ans.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
- Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
- Ans.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
- Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
- Ans.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
- Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
- Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
- Ans.
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
- Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
- Ans.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
- Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
- Ans.
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
- Q8. Convert a binary number into base 64 integer
- Ans.
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Interview Preparation Tips
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3
Skills: Analytics And Coding
College Name: IIT Guwahati
Skills evaluated in this interview
Interview Questionnaire
6 Questions
- Q1. Solving puzzles(25 horses,ant and sweets,height of a building..) try as many as possible before appearing for interview
- Q2. If experienced , then project details of previous companies a must prepare question
- Q3. Writing test cases for random scenarios
- Ans.
Creating test cases for random scenarios ensures software reliability and robustness through diverse input validation.
Identify edge cases: Test with minimum and maximum input values, e.g., an empty array vs. a large array.
Use random data: Generate random inputs to simulate real-world usage, e.g., random user names or passwords.
Test invalid inputs: Ensure the system handles unexpected inputs gracefully, e.g., negative n...
- Q4. Programming in whatsoever language you r comfortable with, basic coding problems of DS,Algos. eg. Zigzag tree traversal algo,random linked list copy
- Q5. Some people asked me questions related to the work i will do if hired in the project
- Q6. Be genuine in ur CV, and be prepared with everything you write there.
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(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
- 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.
(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.
- 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.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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
Interview Preparation Tips
College Name: NIT SURATHKAL
Interview Preparation Tips
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
NITIN SAMANTA
Interview Preparation Tips
Experience: The sections were Quantitative, Logical, Verbal and Computer Science.The three sections contained very basic questions of general aptitude while the Computer Science section contained questions on Database Management, OS, SQL and Programming Aptitude.
Round: Test
Experience: The question was to program a logic to test the correctness of a solved sudoku. We were allowed to code in C++, Java, C or pseudo code.
Round: Technical Interview
Experience: Were asked simple questions and program them like reversing string without temporary variables, finding the earlier date when entered as string and finding the difference in number of days between them.
I was asked to explain him my internship project in great detail and above all one should be prepared to answer the question 'Why IT?' if from a non IT background. Then I was asked to program a logic for 'Search and replace" tool of MS Word.
Round: HR Interview
Experience: Was asked about my background in detail and stressed again and again on 'Why IT?'. Then he asked me to prepare a summary on the merits and demerits of various Employee Data Management techniques for an organisation. For the end of the interview you should have a question which you would ask to the interviewer.
General Tips: Don't try to over emphasize the correctness of your logic if the interviewer finds a glitch. It irritates him. Be interactive in your HR round. In our case it was the VP of Oracle India who took the final round. So I asked him about his experience in the company. He was very happy to share it with me. But asses your interviewer before you put forth these queries cause your interviewer might not be as jolly as mine was.
Skills:
College Name: NIT Surathkal
Interview Preparation Tips
Tips: If you think it is worth it, write it in the resume.
Round: Technical Interview
Experience: I discussed a political party in one such interview in another company. He was impressed rather inspired.
Tips: All they are looking for in this interview is that you have a basic aptitude
Round: HR Interview
Tips: Try to be as real as possible. They know people and have great deal of experience. You cannot fake it.
General Tips: Peace yoo
College Name: IIT BOMBAY
Interview Questionnaire
2 Questions
- Q1. Ques on SQL,puzzles, C
- Q2. Basic family background, hobbies, academics, why interest in software field, questions from the ppt they presentec earlier
Interview Preparation Tips
Experience: apti and logical reasoning ques were not tough and with basic knowledge on C and SQL I could easily solve the questions
Tips: Just try to maintain a good speed while solving
Round: Technical Interview
Experience: mostly they focus their questions based on the form that we had to fill. it had details about our extracurricular activities, main courses of interest, training and project work, software languages known, academics.
Tips: the form was to be filled with accuracy and only those points about which one is confident enough should be added
Round: HR Interview
Experience: it was just a normal interaction. they wanted to know the kind of person i am, my strengths and weakness. any impressive qualities unique of me. my favourite author. it lasted no longer than 10 minutes . and try to acquire as much background information as you about the company.
Tips: try to be honest with your answers. do not fake since they can easily catch you. do not give any such answers about which you are not confident or any view where you cannot defend yourself.
Skill Tips: I learned sql from w3school.com.
Skills: confidence, amicable nature, leadership qualities, participation in extracurricular activities, puzzle solving, Aptitude
College Name: NIT ROURKELA
Motivation: Its quite simple, I wanted to land with good job before i leave nit.
Funny Moments: Since it was the first time i was facing an interview, so i asked my interviewer how were my answers.
Tell us how to improve this page.
Salesforce Interviews By Designations
- Salesforce Technical Support Engineer Interview Questions
- Salesforce Member Technical Staff Interview Questions
- Salesforce Software Developer Interview Questions
- Salesforce Mts Software Engineer Interview Questions
- Salesforce Support Engineer Interview Questions
- Salesforce Salesforce Developer Interview Questions
- Salesforce Technical Consultant Interview Questions
- Salesforce Associate Technical Support Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Project Engineer Interview Questions
- Associate Consultant Interview Questions
- Senior Software Developer Interview Questions
- Show more
Associate Software Engineer Interview Questions from Similar Companies
|
Technical Support Engineer
983
salaries
|  ₹14.3 L/yr - ₹26 L/yr |
|
Technical Consultant
408
salaries
| ₹17.6 L/yr - ₹29 L/yr |
|
Member Technical Staff
341
salaries
| ₹31.2 L/yr - ₹57.3 L/yr |
|
Senior Technical Consultant
315
salaries
| ₹23 L/yr - ₹46.2 L/yr |
|
Senior Member of Technical Staff
312
salaries
| ₹48 L/yr - ₹81.1 L/yr |
SAP
Zoho
Oracle
Adobe
- Home >
- Interviews >
- Salesforce Interview Questions
