Upload Button Icon Add office photos

Salesforce

Compare button icon Compare button icon Compare

Filter interviews by

Salesforce Software Developer Interview Questions, Process, and Tips for Freshers

Updated 12 Nov 2024

Salesforce Software Developer Interview Experiences for Freshers

1 interview found

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

Interview questions from similar companies

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Longest Increasing Subsequence Problem Statement

    Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...

  • Ans. 

    Find the length of the longest strictly increasing subsequence of heights of students in a row.

    • Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.

    • Use dynamic programming to keep track of the longest increasing subsequence length for each element.

    • Return the maximum length found as the result.

  • Answered by AI
  • Q2. 

    Overlapping Intervals Problem Statement

    You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.

    Note:

    If an interval ends at time T and anothe...

  • Ans. 

    Given start and end times of intervals, determine if any two intervals overlap.

    • Iterate through intervals and check if any two intervals overlap by comparing their start and end times

    • Sort intervals based on start times for efficient comparison

    • Consider edge cases where intervals end and start at the same time

  • Answered by AI
  • Q3. What SQL queries were asked during your interview?
  • Ans. 

    Various SQL queries related to data manipulation and retrieval were asked during the interview.

    • Basic SELECT queries to retrieve data from a single table

    • JOIN queries to retrieve data from multiple tables based on a common column

    • Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data

    • Subqueries to retrieve data based on the result of another query

    • UPDATE queries to modify existing data in a table

    • DELE...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Zig-Zag String Problem Statement

    Given a string STR of size N and an integer M representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...

  • Ans. 

    Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.

    • Iterate through the string and distribute characters to rows based on zig-zag pattern

    • Concatenate the characters in each row to get the final result

    • Handle edge cases like when number of rows is 1 or equal to the length of the string

  • Answered by AI
  • Q2. 

    Next Permutation Problem Statement

    You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...

  • Ans. 

    The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.

    • Iterate from right to left to find the first element that is smaller than the element to its right.

    • Swap this element with the smallest element to its right that is greater than it.

    • Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Remove Consecutive Duplicates Problem Statement

    Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.

    Input:

    String S

    Output:

    Output string

    Constr...

  • Ans. 

    Recursively remove consecutive duplicate characters from a string.

    • Use recursion to check if the current character is the same as the next character, if so skip the next character

    • Base case: if the string is empty or has only one character, return the string

    • Example: Input: 'aaabcc', Output: 'abc'

  • Answered by AI
  • Q2. 

    Print Permutations - String Problem Statement

    Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.

    Input:

    The first and only line of input ...
  • Ans. 

    Return all possible permutations of a given input string.

    • Use recursion to generate all possible permutations of the input string.

    • Swap characters at different positions to generate permutations.

    • Handle duplicate characters in the input string by using a set to store unique permutations.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. Design an e-commerce website similar to Flipkart or Amazon.
  • Ans. 

    Design an e-commerce website similar to Flipkart or Amazon.

    • Implement user-friendly interface for easy navigation

    • Include search functionality with filters for products

    • Incorporate secure payment gateway for transactions

    • Provide personalized recommendations based on user behavior

    • Include customer reviews and ratings for products

    • Implement order tracking and delivery status updates

    • Offer various payment options like credit/deb

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology, Kurukshetra. I applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 7.5 CGPASAP Labs interview preparation:Topics to prepare for the interview - DSA(Data Structures and Algorithms),Object-Oriented Programming Principles,Operating Systems,Database Management Systems,Web Development,Machine Learning,Projects(Internship/Full-time)Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.

Application resume tips for other job seekers

Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

The round was conducted in day around 3PM.

  • Q1. 

    Partition Equal Subset Sum Problem

    Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...

  • Ans. 

    The problem is to determine if it is possible to partition an array into two subsets with equal sum.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the results of subproblems.

    • Check if the sum of the array is even before attempting to partition it.

    • Iterate through the array and update the 2D array based on the sum of subsets.

    • Return true if a subset with half the sum is found, false ot

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.

  • Q1. 

    Convert Sentence to Pascal Case

    Given a string STR, your task is to remove spaces from STR and convert it to Pascal case format. The function should return the modified STR.

    In Pascal case, words are con...

  • Ans. 

    Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.

    • Iterate through each character in the string

    • If the character is a space, skip it

    • If the character is not a space and the previous character is a space or it is the first character, capitalize it

  • Answered by AI
  • Q2. Write an SQL query to retrieve the Nth highest salary from a database.
  • Ans. 

    SQL query to retrieve the Nth highest salary from a database

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT clause to retrieve the Nth highest salary

    • Consider handling cases where there might be ties for the Nth highest salary

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This round was conducted 15mins after 1st round.

  • Q1. 

    Remove the Kth Node from the End of a Linked List

    You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...

  • Ans. 

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

    • Traverse the list to find the length 'N'.

    • Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

    • Remove the node at the calculated position.

    • Handle edge cases like removing the head or tail of the list.

    • Update the pointers accordingly after removal.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from National Institute of Technology, Raipur. I applied for the job as SDE - 1 in BangaloreEligibility criteria7 CGPAOracle interview preparation:Topics to prepare for the interview - Computer Networks, SQL, DBMS, Data Structures, Algorithms, OS, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers

Application resume tips for other job seekers

Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)

Final outcome of the interviewRejected

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Program for reverse of string in minimum iteration
  • Ans. 

    Program to reverse a string in minimum iteration

    • Use two pointers, one at the start and one at the end of the string

    • Swap the characters at the two pointers and move the pointers towards each other

    • Repeat until the pointers meet in the middle of the string

  • Answered by AI
  • Q2. Project architecture and structure and role you were doing
  • Q3. Core java concepts

Interview Preparation Tips

Interview preparation tips for other job seekers - Be ready with examples of what knowledge you have?

I applied via Naukri.com and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic of core java and project related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - It was good.

Interview Questionnaire 

2 Questions

  • Q1. PATTERN PROBLEMS
  • Q2. CALCULATION OF CHILDREN AND GRANDCHILDREN
  • Ans. 

    Calculate the number of children and grandchildren

    • Count the number of direct children of a person

    • Count the number of grandchildren of a person

    • Use recursion to count all descendants

    • Consider only living descendants

    • Exclude step-children and adopted children

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Understand the logic
Practice

Interview Questionnaire 

1 Question

  • Q1. Simple basic c programing questions

I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Partitioning even and odd numbers in an array
  • Ans. 

    Partition even and odd numbers in an array

    • Iterate through the array and check if each number is even or odd

    • Create two separate arrays for even and odd numbers

    • Combine the two arrays to get the final partitioned array

  • Answered by AI
  • Q2. Leaders in an array
  • Ans. 

    Find leaders in an array of strings

    • Leaders are elements that are greater than all elements to their right

    • Traverse array from right to left and keep track of maximum element

    • Add maximum element to result if it is a leader

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be skilled with advanced data structures (recursion, graph) and dynamic programming

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The test included MCQ questions from SQL, Linux Commands, C/C++ programming, Logical Reasoning, Aptitude questions. The other section was the coding round, where 2 SQL queries and 2 coding questions were there.

  • Q1. 

    Subarray with Equal Occurrences Problem Statement

    You are provided with an array/list ARR of length N containing only 0s and 1s. Your goal is to determine the number of non-empty subarrays where the numbe...

  • Ans. 

    Count the number of subarrays where the number of 0s is equal to the number of 1s in a given array of 0s and 1s.

    • Iterate through the array and keep track of the count of 0s and 1s encountered so far.

    • Use a hashmap to store the count of 0s and 1s encountered at each index.

    • For each index, check if the count of 0s is equal to the count of 1s encountered so far and update the result accordingly.

  • Answered by AI
  • Q2. 

    Pythagorean Triplets Detection

    Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.

    Input:

    The first lin...
  • Ans. 

    Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.

    • Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number for each trip...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This was a standard DSA round where I was asked to solve 2 questions and also code it in a production ready manner . At the end I was also asked some questions related to Linux and SQL . I was tested on some basic commands of Linux .

  • Q1. 

    Palindromic Substrings Problem Statement

    Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.

    Explanation:

    A string is considered a pal...

  • Ans. 

    Return all distinct palindromic substrings of a given string in alphabetical order.

    • Iterate through all possible substrings of the given string.

    • Check if each substring is a palindrome.

    • Store distinct palindromic substrings in alphabetical order.

  • Answered by AI
  • Q2. 

    Swap Two Numbers Problem Statement

    Given two integers a and b, your task is to swap these numbers and output the swapped values.

    Input:

    The first line contains a single integer 't', representing the num...
  • Ans. 

    Swap two integers 'a' and 'b' and output the swapped values.

    • Create a temporary variable to store one of the integers before swapping.

    • Swap the values of 'a' and 'b' using the temporary variable.

    • Output the swapped values of 'a' and 'b'.

  • Answered by AI
  • Q3. What is meant by normalization and denormalization?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally adding redundancy to improve query performance.

    • Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.

    • Denormalization involves combining tables or adding redundant data to...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a DS/Algo + Core round where I was asked questions related to DBMS , SQL queries and Linux Commands . The first question was of DSA and I was able to code it preety fast . I was also asked to execute some SQL queries on my laptop.
Overall , this round went good according to my opinion.

  • Q1. 

    Anagram Pairs Verification Problem

    Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...

  • Ans. 

    Check if two strings are anagrams of each other by comparing their sorted characters.

    • Sort the characters of both strings and compare them.

    • Use a dictionary to count the frequency of characters in each string and compare the dictionaries.

    • Ensure both strings have the same length before proceeding with comparison.

    • Handle edge cases like empty strings or strings with different lengths.

  • Answered by AI
  • Q2. How would you delete duplicate emails from a database using SQL?
  • Ans. 

    Use SQL query with GROUP BY and HAVING clause to delete duplicate emails from a database.

    • Use GROUP BY clause to group emails together

    • Use HAVING clause to filter out groups with more than one email

    • Use DELETE statement to remove duplicate emails

  • Answered by AI
  • Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
  • Ans. 

    DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.

    • DELETE is a DML command, while TRUNCATE is a DDL command.

    • DELETE can be rolled back, while TRUNCATE cannot be rolled back.

    • DELETE triggers ON DELETE triggers, while TRUNCATE does not trigger any triggers.

    • DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.

    • Example: DELETE FRO...

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions .

  • Q1. What is something about you that is not included in your resume?
  • Q2. Why do you want to work at Amdocs?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAmdocs 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 Jul 2021.

Interview Preparation Tips

Interview preparation tips for other job seekers - Do not fake/guess, if you don't know the answer just tell your interviewer that you are not aware about it instead of saying irrelevant stuffs.

Salesforce Interview FAQs

How many rounds are there in Salesforce Software Developer interview for freshers?
Salesforce interview process for freshers usually has 1-2 rounds. The most common rounds in the Salesforce interview process for freshers are Coding Test, Technical and Aptitude Test.
How to prepare for Salesforce Software Developer interview for freshers?
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.

Salesforce Software Developer Salary
based on 116 salaries
₹10 L/yr - ₹41.8 L/yr
179% more than the average Software Developer Salary in India
View more details

Salesforce Software Developer Reviews and Ratings

based on 14 reviews

4.5/5

Rating in categories

4.1

Skill development

4.5

Work-life balance

4.7

Salary

4.3

Job security

4.4

Company culture

4.1

Promotions

4.1

Work satisfaction

Explore 14 Reviews and Ratings
Technical Support Engineer
976 salaries
unlock blur

₹8.5 L/yr - ₹25 L/yr

Technical Consultant
344 salaries
unlock blur

₹13.8 L/yr - ₹32 L/yr

Member Technical Staff
288 salaries
unlock blur

₹18.8 L/yr - ₹60 L/yr

Senior Member of Technical Staff
256 salaries
unlock blur

₹30 L/yr - ₹95 L/yr

Senior Technical Consultant
251 salaries
unlock blur

₹18 L/yr - ₹45 L/yr

Explore more salaries
Compare Salesforce with

SAP

4.2
Compare

Zoho

4.3
Compare

Oracle

3.7
Compare

Adobe

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview