Service Now - SSE
Summary
I interviewed for a Software Staff Engineer (SSE) role at ServiceNow and unfortunately faced rejection after the second round. The interview process focused heavily on Data Structures and Algorithms, covering both well-known problems and a custom array partitioning challenge.
Full Experience
I recently interviewed for the SSE position at ServiceNow, which consisted of two rounds, primarily focusing on Data Structures and Algorithms.
Round 1: This round involved solving two DSA questions. I was asked to implement solutions for Spiral Matrix and Number of Islands. I successfully solved both problems and was advanced to the next round.
Round 2: In this round, I was presented with a custom array partitioning problem. Despite my efforts, I was not able to clear this round and received a rejection. A key takeaway from my experience is that they place a significant emphasis on the correctness and output of solutions in each round.
Interview Questions (3)
You are given an array of integers. You need to partition the array into three subarrays such that the sum of each subarray is equal. An important constraint is that the elements at the partition points should not be considered part of any subarray.
Example: If the input array is [1,2,1,2,1,2,1] and you partition at indices 1, 3, and 5, you would get three subarrays whose sums are 1 each ([1], [1], [1]). In such a case, you should return true. Otherwise, return false.