Salesforce Senior Software Engineer Interview Questions and Answers

The first round was a coding test on HackerRank that lasted 75 minutes and included three medium-level questions. The second round involved pair coding; a CoderPad link was shared, and you were required to solve a coding question within 45 minutes. The third and fourth rounds were focused on High-Level Design (HLD) and Low-Level Design (LLD), which I was unable to experience as I was rejected in the second round.

Q1. In a given a matrix n*m find the optimized path from 0 to n-1 and m-1 to n-1
Ans. 
Find the optimized path in an n*m matrix from top-left to bottom-right using dynamic programming.
• Use dynamic programming to store the minimum cost to reach each cell.

• Initialize a 2D array 'dp' where dp[i][j] represents the minimum cost to reach cell (i, j).

• Base case: dp[0][0] = matrix[0][0].

• For each cell, calculate dp[i][j] as the minimum of dp[i-1][j] and dp[i][j-1] plus the current cell's cost.

• Example: For a matrix [...read more
Answered by AI
Add your answer

Full stack question with java and angular and sql

Case study on project

2 questions on arrays