Role: Associate Member of Technical Staff
Location: Bangalore
Verdict: Selected
The OA had three coding questions.
System Energy Reduction
Given an integer n (0 < n < 2^60). In one operation you can add or subtract any power of two. The task is to find the minimum number of operations needed to reduce n to 0.
Updating Salesforce Logs
Given an array log of size n and a number called iterations. For each iteration i from 0 to iterations − 1, compute the index as i modulo n. Then update the value at that position by taking the bitwise XOR of the element at that index with the element at the symmetric position in the array (which is n minus index minus 1). Return the final array after all iterations.
Key Salesforce Teams
Given a tree with n nodes representing an organizational hierarchy. Return a binary array where a node is marked 1 if it is an endpoint of any longest path (tree diameter) in the tree, otherwise 0.
This round focused on DSA, C++ concepts, and discussion about projects.
Project discussion
The interviewer asked me to explain the architecture and implementation details of the projects listed on my resume.
DSA questions
C++ / OOP questions
The discussion was around designing a simple Library Management System.
Entities discussed
Library, Book, Author, Transaction
We discussed how the tables would relate to each other and how books could be queried based on author and book name.
API design
Designed a request structure that supports filtering books by name, author and date using a gRPC style request object.
Concurrency discussion
The interviewer asked how trending books could be tracked. I suggested maintaining a thread-safe map that stores the count of reads or checkouts for each book. The top trending books could be obtained using a top-k structure such as a heap.
Base: 18 LPA
Performance Bonus: 1.8 LPA
Sign-on Bonus: 4 LPA
RSUs: 25K USD
Benefits included wellness reimbursement and relocation support.