Salesforce SMTS Onsite Interview Experience and Coding Questions

Round 1 Interview Overview The session began with a brief introduction and immediately transitioned to a Hackerrank assessment containing two coding questions. **1. Remove All Adjacent Duplicates

Round 1 Interview Overview The session began with a brief introduction and immediately transitioned to a Hackerrank assessment containing two coding questions. 1. Remove All Adjacent Duplicates in String II *

Approach: Initially proposed a brute force solution. After approximately 15 minutes, derived the optimal stack-based approach. *

Result: Due to time constraints (30 minutes elapsed), the interviewer moved to the next question before the code could be fully implemented. 2. Binary Tree Maximum Path Sum *

Problem Constraint: While the core logic matched the standard problem, the input format was non-standard. Data was provided as List<Integer> parent and List<Integer> values rather than a standard TreeNode structure, requiring manual tree construction or adjacency logic. *

Result: Identified the correct algorithmic approach for the path sum. However, the complexity of building the tree structure from the raw input lists consumed the remaining time, preventing a complete solution.

Outcome Working code was not completed for either problem, but the correct logic and algorithmic approaches were verbally explained for both.