Software Engineer · Online Assessment · Coding

Salesforce — Software Engineer

Level: Senior-Level

Round: Online Assessment · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Neutral

Topics: Strings, Arrays, Time Windows

Location: San Francisco Bay Area

Interview date: 2026-03-18

Summary

I took an online assessment consisting of two coding questions.

Details

I had a 60-minute online assessment with two questions. Here are the problems:

Question 1: Maximum Number of Palindromic Strings

Problem Statement: You are given an array of n strings arr, where each string consists only of lowercase English letters. In one operation, you may choose two distinct strings in the array and swap one character from one string with one character from the other string. More formally, choose integers x, y, i, and j such that: 1 <= x, y <= n x != y 1 <= i <= length of arr[x] 1 <= j <= length of arr[y] Then swap the characters at those positions. All indexing in the operation description above is 1-based. Return the maximum number of strings in the array that can be made palindromes after performing any number of such operations.

Example: arr = ["pass", "sas", "asps", "df"] Output: 3

Question 2: Maximum Requests in a Time Window

Problem Statement: You are given an array of integers timestamp , where each element represents the time at which a request was received. You are also given an integer windowSize , representing the length of a time window. Your task is to determine the maximum number of requests that occur within any time window of size windowSize . A time window is defined as a continuous interval [start, start + windowSize - 1] (inclusive), and you may choose any valid starting point.

Example: timestamp = [1, 3, 7, 5] windowSize = 4 Output: 2