servicenow logo
ServiceNow· SDE I

ServiceNow IC2 Offer

Result
Offer
Posted
19 Jun 2022
363 reads

Summary

I successfully navigated four rounds of interviews for an IC2 position at ServiceNow, which included technical DSA, system design, and managerial discussions, ultimately leading to an offer.

How it went

I went through a comprehensive interview process at ServiceNow for an IC2 role, which consisted of four distinct rounds.

Round 1: Data Structures & Algorithms

My first technical round focused on data structures and algorithms. I was presented with two problems: searching for a target in a rotated sorted array and recovering a binary search tree where two nodes had been swapped.

Round 2: Data Structures & Algorithms

The second technical round continued with more DSA challenges. I had to tackle problems related to finding the maximum element in a sliding window and making a deep copy of a linked list with random pointers.

Round 3: System Design

The third round was a dedicated system design interview. I was asked to design a parking lot system, covering both its Low-Level Design (LLD) and High-Level Design (HLD) aspects.

Round 4: Managerial Round

The final round was a managerial discussion, primarily centered around my past projects and professional experiences.

I am pleased to share that following these rounds, I received an offer for the position.

Questions asked (5)

  1. 01

    Search in Rotated Sorted Array

    Data Structures & Algorithms · Medium

    Given a sorted array that has been rotated at some pivot unknown to you beforehand, search for a given target value. If the target is found in the array, return its index, otherwise return -1.

  2. 02

    Recover Binary Search Tree

    Data Structures & Algorithms · Medium

    Two nodes of a Binary Search Tree (BST) are swapped by mistake. Recover the tree without changing its structure.

  3. 03

    Sliding Window Maximum

    Data Structures & Algorithms · Hard

    Given an array of integers nums and an integer k, return the maximum sliding window. You can assume k is always valid, 1 <= k <= nums.length.

  4. 04

    Copy List with Random Pointer

    Data Structures & Algorithms · Medium

    A linked list is given such that each node contains an additional random pointer, which could point to any node in the list, or to null. Construct a deep copy of the list.

  5. 05

    Design Parking Lot

    System Design · Hard

    Design a parking lot system, including both Low-Level Design (LLD) and High-Level Design (HLD) aspects. Consider features such as multiple entry/exit points, different vehicle types (e.g., car, motorcycle, bus), capacity management, and payment processing.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at ServiceNow recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!