Timeline - May 22nd, 2026 (Virtual Hiring Drive)
YOE : 8.5+ Years
Current (Most Recent Company) : SMTS(IC3) at Oracle (Laid off in September 2025)
College - IITK

Recruiter reached out on LinkedIn. Appeared for the Salesforce Hiring drive on May 22nd and here's my interview experience -

R1 (DSA Coding Hackerrank) -
In a Rock Paper Scissors tournament, players stand in a line and each consecutive pair competes in a round. If there is an odd number of players, the last one automatically advances. They each choose a hand formation, either Rock (R), Paper (P), or Scissors (S). Outcomes are based on these rules:
•⁠ ⁠Paper beats Rock (P > R)
•⁠ ⁠Scissors beat Paper (S> P)
•⁠ ⁠Rock beats Scissors (R> S)
Winners proceed to the next round while losers are eliminated. If there is a tie, both players are out.
A player, the person of interest (POl), wants to win while changing their hand formation as few times as possible.
All other players must continue with their first choice. Determine the minimum number of changes the POl must make to win the tournament.

Example 1
Input: n= 3 players, poi = 2 player of
interest, formations= "PS"
Output: 0

• Was able to come up with the approach on how to solve it effciently but couldn't code up the working solution in given time. Coded up the basic algo but a lot of edge cases as well as the lengthy logic to decide winner was left.

Final Verdict - No Hire, second round was not scheduled which was supposed to be scheduled on the same day had I cleared it. Hope this helps someone interviewing at Salesforce. I really felt this was a pretty hard and lengthy question to solve if you haven't done it earlier.

Note :- The recruiter mentioned in advance that the max comp they can offer is 70 LPA for this role. I already had a better offer with better title role as well but I gave the interview just for practice, hope this can help someone.