Salesforce interview experience Real time questions & tips from candidates to crack your interview
Technical Associate
Salesforce
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 1 month
Topics: DSA, OOPS, OS, DBMS, Computer Networks
Tip 1 : Be Strong with DSA
Tip 2 : Be Strong with OOPS and Core CS Fundamentals
Application process
Where: Linkedin
Eligibility: 7 CGPA
Tip 1 : One page Resume
Tip 2 : Highlight your coding profiles
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date8 Apr 2021
Coding problem2
Online Assessment round
1. Longest Common Subsequence
Moderate
39m average time
0/80
Asked in companies
Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.
For a string 'str'(per se) of length K, the subsequences are the strings containing characters in the same relative order as they are present in 'str,' but not necessarily contiguous. Subsequences contain all the strings of length varying from 0 to K.
Example :
Subsequences of string "abc" are: ""(empty string), a, b, c, ab, bc, ac, abc.
2. Valid Parentheses
Easy
10m average time
80% success
0/40
Asked in companies
You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .
Return true if the given string 'S' is balanced, else return false.
For example:
'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
02
Round
Easy
Video Call
Duration60 minutes
Interview date12 Apr 2021
Coding problem1
DSA Problem Solving round
1. Subset Sum Equal To K
Moderate
30m average time
65% success
0/80
Asked in companies
You are given an array/list ‘ARR’ of ‘N’ positive integers and an integer ‘K’. Your task is to check if there exists a subset in ‘ARR’ with a sum equal to ‘K’.
Note: Return true if there exists a subset with sum equal to ‘K’. Otherwise, return false.
For Example :
If ‘ARR’ is {1,2,3,4} and ‘K’ = 4, then there exists 2 subsets with sum = 4. These are {1,3} and {4}. Hence, return true.
Problem approach
Approach: A simple approach is to solve this problem by generating all the possible subsets and then checking whether the subset has the required sum. This approach will have exponential time complexity. However, for smaller values of X and array elements, this problem can be solved using dynamic programming.
Let’s look at the recurrence relation first.
This method is valid for all the integers.
dp[i][C] = dp[i – 1][C – arr[i]] + dp[i – 1][C]
Let’s understand the states of the DP now. Here, dp[i][C] stores the number of subsets of the sub-array arr[i…N-1] such that their sum is equal to C.
Thus, the recurrence is very trivial as there are only two choices i.e. either consider the ith element in the subset or don’t.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Salesforce
Rejected
1559 views
0 comments
0 upvotes
MTS 1
3 rounds | 4 problems
Interviewed by Salesforce
Selected 2048 views
0 comments
0 upvotes
MTS 1
3 rounds | 6 problems
Interviewed by Salesforce
Rejected
1817 views
0 comments
0 upvotes
MTS
3 rounds | 3 problems
Interviewed by Salesforce
Selected 1308 views
0 comments
0 upvotes