Salesforce General SDE Backend Online Test and Director Interview Experience
Question Details
General SDE backend position The first round was a director interview (I specifically emphasized that this is not an hiring manager, but someone who came to help with the interview...), a deep dive in
Full Details
General SDE backend position The first round was a director interview (I specifically emphasized that this is not an hiring manager, but someone who came to help with the interview...), a deep dive into the resume + a barrage of behavioral questions The second round was an online assessment (OA), the questions weren't difficult, still waiting for news The following content requires a score higher than 88. You can already view it. You are given an array of integers. For each elem, determine if the value appears earlier in the array or appears later in the array. Create 2 binary strings to represent these occurrences, where in the first string 1 represents the number at that location appeared another time earlier in the array and 0 if not, and in the second is the same but for appearing later in the array.
Example: [1, 2, 3, 2, 1]
Output: ["00011", "11000"] You are given a permutation of integers from 1 to n. For each prefix of the array starting from length k, you need to find the k-th largest value.
Example: [4, 2, 1, 3] k = 2 Answer = [2, 2, 3]
About This Question
This is a reported interview question from a salesforce interview for a swe role (director level) during the oa round reported in 2025.
It covers the following topics: Backtracking, Array, Arrays, Strings .
Difficulty rating: Hard