Recruiter reachedout on linkedin and explained there would be 3 rounds
Out of which last one must be given in person in any location
Every round is an Elimination
Offer Quoted:

Company: SalesForce
Role: MTS
Yoe: 3 years 3 months
Base: 30LPA
RSU: 50k for 4 years Equal Vesting

Round 1: DSA
Q1: Validate an IPv4 Address
Expectation Production ready code with all corner cases to be handled
Like +01 parsing would be a valid parsing but invalid number and ip address with 0's etc
Q2: Given 3 functions design optimised datastructure which runs all these functions optimally
addScore(String id,int score)- can add a new player and score id
updateScore(Sring id, int newScore) - if player exists update score to new score else add his score
int getTopKScoreSum(int k) - get Sum of Scores of top K Players.

Round 2: Initially was told it would be LLD round but just minutes before interview recruiter told it will be a Advanced DSA

3 interviewers joined one after other

Given a number n , You need to return how many BST's can be formed from numbers from 1 to n with each number as a node in BST

As soon as i heard this i remember there is some mathematical formaulae and told the same and tried deriving the formualae but no luck
so thought to write code and count manually and then wrote a backtracking code with maintaining a visited set,passing ranges to childnodes to construct each valid BST , but test cases are failing and iam getting lesser count and added debugs to see why it fails and ended up realising that via backtracking we cant generate all valid BST's.

After that round Didn't hear back again from recruiter and received a rejection email after a week

Google Interview experience:
https://leetcode.com/discuss/post/7240829/google-l4-bangalore-2025-by-anonymous_us-vo8z/

Walmart Experience:
https://leetcode.com/discuss/post/7342438/walmart-swe3-bangalore-august-selected-b-83sb/

Microsoft Experience:https://leetcode.com/discuss/post/7356120/microsoft-l60-select-by-anonymous_user-75hx/