Salesforce | Gurgaon Drive | 26th Nov

Result
Rejected
Location
Gurgaon
Experience
5 years
Posted
14 Dec 2023
345 reads

Summary

I recently underwent a multi-round interview process with Salesforce in Gurgaon, which included an online assessment, two DS/Algo rounds, an LLD+DSA round, an HLD+Behavioral round, and a Hiring Manager discussion. Despite receiving initial positive feedback, the recruiter eventually ghosted me, leading to an ultimate rejection.

How it went

I recently got a call from a Salesforce recruiter who reached out to me via LinkedIn. I showed my interest, and with over 5 years of experience, I was asked to go through an Online Assessment first.

The test was conducted on HackerRank and lasted 60 minutes. Two questions were asked:

  1. Find the Kth Factor of N
  2. Search Suggestions System
I managed to solve both questions with all test cases passing in about 20-25 minutes.

Following the OA, I was invited to the onsite rounds for face-to-face interviews in Gurgaon on November 26, 2023. Salesforce even sent an Uber voucher worth ₹2000, which was valid for one day.

Round 1: DS/Algo

The interviewer presented two challenging problems:
  1. MAXPARTY
  2. Count pairs: Given an array arr[] of length N and an integer K, the task is to count the number of pairs (i, j) such that i < j and arr[i] > K * arr[j]. This problem was similar to count inversion, like Count of Smaller Numbers After Self.
I successfully cracked the first question by identifying that it could be solved using Binary Search and a greedy approach. The interviewer asked me to write down the condition to check, which I did. For the second question, I explained that it could be solved using merge sort and detailed the logic to count such pairs. Overall, I felt I could have written the code more confidently; otherwise, I would rate my performance as average in this round.

Round 2: LLD + DSA

This round started with discussions on OOPs concepts, specifically Abstraction vs. Encapsulation, SOLID principles, and commonly used design patterns. Following that, we moved to DSA questions:
  1. Count the number of distinct contiguous substrings that are palindromes.
  2. Max Path Sum in a Binary Tree
To be honest, I wasn't prepared at all for the LLD questions. I genuinely didn't realize it was an LLD round, and I answered more in the style of a discussion rather than an interview. I don't believe the interviewer rated me higher than average here. For the first DSA question, I asked many clarifying questions, and then for some reason, the interviewer changed the question and asked the second one. I solved it quickly, and then they asked a follow-up: what if we wanted to return the path of the longest sum as well? We discussed the solution, and the interview ended there. Again, this round wasn't satisfactory; the HR had sent many folks home by this time, and I thought I would be next. However, HR called me for the next round.

Round 3: HLD + Behavioural

This round included general behavioral questions, which I cannot recall specifically. The HLD question was: How would you ensure a multi-master system with high consistency? We discussed a few solutions, and I felt this round was more of a collaborative discussion. For me, this round went well.

Round 4: HM (Hiring Manager)

This round began with introductions. The interviewer then asked 'Why Salesforce?' for which I struggled to provide a strong justification, as I come from a MAANG background. The discussion then moved to my projects and other behavioral questions, specifically focusing on what was one of the most impactful projects I had worked on and how I contributed to it.

After this round, my interviews for the day were complete. I was informed that I would receive the results within a week. I had a feeling I wouldn't make it, but I gained valuable experience from the face-to-face interviews. This experience boosted my confidence, showing that if I just brush up on my concepts more, I can crack senior-level role interviews.

[Edit 1]: I received a call after two days stating that I had positive feedback. They inquired about my current and expected compensation.

[Edit 2]: As of December 14, 2023, I was still waiting for the recruiter to follow up. I tried contacting them once but received no positive response.

[Edit 3]: By January 24, 2024, the recruiter had ghosted me and never got back.

Questions asked (8)

  1. 01

    The Kth Factor of N

    Data Structures & Algorithms · Medium

    I was asked to find the k-th factor of a given integer n.

    Open the problem
  2. 02

    Search Suggestions System

    Data Structures & Algorithms · Medium

    The problem involved implementing a search suggestions system where, given a list of products and a search word, I needed to return three most relevant product suggestions for each character typed in the search word.

    Open the problem
  3. 03

    MAXPARTY

    Data Structures & Algorithms · Hard

    I was presented with the MAXPARTY problem from Codeforces, which asks to find the maximum number of participants for a party given their required number of people less or equal than them, and people greater or equal than them.

    Open the problem
  4. 04

    Count Pairs with arr[i] > K * arr[j]

    Data Structures & Algorithms · Hard

    Given an array arr[] of length N and an integer K, the task is to count the number of pairs (i, j) such that i < j and arr[i] > K * arr[j]. The interviewer mentioned it's similar to a count inversion problem.

    Open the problem
  5. 05

    OOPs Concepts & LLD Principles

    System Design

    I was asked about fundamental OOPs concepts, specifically distinguishing between Abstraction and Encapsulation, discussing SOLID principles, and mentioning design patterns in use.

  6. 06

    Count Distinct Palindromic Substrings

    Data Structures & Algorithms

    I was initially asked to count the number of distinct contiguous substrings that are palindromes. After I asked several clarifying questions, the interviewer changed the problem.

  7. 07

    Binary Tree Maximum Path Sum

    Data Structures & Algorithms · Hard

    I had to find the maximum path sum in a binary tree. A follow-up question asked how to return the actual path corresponding to the longest sum.

    Open the problem
  8. 08

    High Consistency in Multi-Master Systems

    System Design

    I was asked how to ensure high consistency in a multi-master system. The discussion revolved around various architectural approaches and trade-offs.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Salesforce recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!