ServiceNow | IC2 | Interview
Summary
I had an interview with ServiceNow for an IC2 role. The first round consisted of a resume discussion followed by two DSA problems, both of which I solved. However, I was later informed that I would not be moving forward with other candidates.
Full Experience
HR reached out to me for an interview opportunity at ServiceNow. The interview process began with a Round 1. This round started with a 15-minute discussion about my resume and previous experience. Following that, for the remaining 45 minutes, I was given two Data Structures and Algorithms (DSA) problems to solve. I successfully solved both problems completely. A week later, I received an email stating that I would not be moving forward with other candidates.
Interview Questions (2)
Split Array Largest Sum
Given an array nums which consists of non-negative integers and an integer k, you need to split the array into k non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these k subarrays.
Degree of an Array
Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. Your task is to find the smallest possible length of a (contiguous) subarray of nums that has the same degree as nums.