Salesforce Software Engineer Onsite Coding Questions

Salesforce Interview Experience Role: MTS Experience: 2.5 years at an MNC ## Interview Experience (5 Rounds | Virtual + Offline) All rounds were around 45 minutes with 10–15 minutes buffer. Round 1 –

The interview commenced with an overview of my introduction and past projects, followed by a technical assessment involving the "Word Break" problem. This challenge requires determining if a given str

**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

**Role:** Senior MTS **Hiring Manager Screen (45 mins)** * Focus: Work experience, role impact, and extensive behavioral questions. * Duration: The session ran over by 15 minutes (1 hour total). **Onl

Technical Round 1 (60 mins) - Problem 1: Given a string and a number of rows, print the string in zigzag traversal. I provided the most optimized solution and executed it successfully. - Problem 2: Gi

**Mode of apply**: Direct apply on LinkedIn **Experience**: 5 years **OA Round (90 mins)** - 1. Don't remember the two questions. But mostly it was leetcode medium. **Technical Round 1 (DSA) (Virtual)

Older 2 IIT's(CSE) Total Exp: 8+ Years (Mostly startups). Was part of November hiring drive Round 1 - Algo DS Graph medium question. Did it in given time and ran all test cases. Interviewer had diffic

In order to launch an application, we load smaller modules.These modules usually have dependencies on other modules. Print the order in which the application should load the modules given the...

LeetCode #2571: Minimum Operations to Reduce an Integer to 0. Difficulty: Medium. Topics: Dynamic Programming, Greedy, Bit Manipulation. Asked at Salesforce in the last 6 months.

LeetCode #2380: Time Needed to Rearrange a Binary String. Difficulty: Medium. Topics: String, Dynamic Programming, Simulation. Asked at Salesforce in the last 6 months.

LeetCode #443: String Compression. Difficulty: Medium. Topics: Two Pointers, String. Asked at Salesforce in the last 6 months.

LeetCode #3035: Maximum Palindromes After Operations. Difficulty: Medium. Topics: Array, Hash Table, String, Greedy, Sorting, Counting. Asked at Salesforce in the last 6 months.

LeetCode #3634: Minimum Removals to Balance Array. Difficulty: Medium. Topics: Array, Binary Search, Sliding Window, Sorting. Asked at Salesforce in the last 6 months.

LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at Salesforce in the last 6 months.

LeetCode #124: Binary Tree Maximum Path Sum. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Asked at Salesforce in the last 6 months.

LeetCode #740: Delete and Earn. Difficulty: Medium. Topics: Array, Hash Table, Dynamic Programming. Asked at Salesforce in the last 6 months.

LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Salesforce in the last 6 months.

LeetCode #1219: Path with Maximum Gold. Difficulty: Medium. Topics: Array, Backtracking, Matrix. Asked at Salesforce in the last 6 months.

LeetCode #1522: Diameter of N-Ary Tree. Difficulty: Medium. Topics: Tree, Depth-First Search. Asked at Salesforce in the last 6 months.

LeetCode #2603: Collect Coins in a Tree. Difficulty: Hard. Topics: Array, Tree, Graph Theory, Topological Sort. Asked at Salesforce in the last 6 months.