[ INFO ]category: Behavioral · Onsite difficulty: average freq: first seen: 2023-09-16
[AVERAGE][ONSITE]OnsiteSWE II (Mid-Level)Rejected
$catproblem.md
I was invited to the Salesforce office for their hiring event on September 10th after clearing a HackerRank assessment, which was of easy-medium difficulty.
Questions in HackerRank Assessment:
Given an array of integers, return the largest integer that can be formed with the numbers in the array.
Given a 2D array, return a sub-array which is having the maximum sum out of all sub-arrays. If two sub-arrays have the same sum, return the smaller sub-array.
Questions asked in the F2F Round:
Find the first non-repeating character in a string (Expected Time Complexity: O(n)).
Given an integer array, keep all the zeroes at the end of the array and maintain the order of other elements with respect to the original array. Expected Time Complexity O(n) Space Complexity O(1).
I provided the optimal approaches for both questions, but I was not able to implement the code correctly as I was not well prepared.
Result: Rejected.