servicenow logo
ServiceNow· SDE I

ServiceNow | IC2 | Hydrebad | Jan 2025

Result
Offer
Location
Hyderabad
Experience
3 years
Posted
18 Feb 2025
370 reads

Summary

I recently had an interview at ServiceNow for an IC2 role in Hyderabad after receiving a referral. The process involved three rounds focusing on Data Structures & Algorithms, High-Level Design, and a Hiring Manager discussion, ultimately resulting in an offer.

How it went

Round 1: Focus on DSA

The first round concentrated on Data Structures and Algorithms.

  • I was asked to find the Next Greater Element (NGE) for every element in a given array.
  • There was another medium-level problem that involved typical DSA concepts, but I don't recall the exact question.
  • A problem was presented involving trains at a railway station with varying arrival times, some cancelled or delayed. The interviewer asked which data structure would be most suitable for solving this and why.
  • Finally, I was asked for my approach to solving the Coin Change problem.

Round 2: DSA + HLD

The second round combined DSA with High-Level Design.

  • One question involved reconstructing a normal Binary Search Tree (BST) given its postorder traversal.
  • I was also given a High-Level Design problem related to Swiggy, where they wanted to assess my understanding of HLD and its practical application.

Round 3: Hiring Manager

The final round was with the Hiring Manager.

  • I was asked to design a database for a hotel booking system, specifically mentioning OYO DB Design.
  • Additionally, I had to provide an efficient approach to solve the classic Stock Buy and Sell Problem.

I am pleased to share that I was selected for the role.

Questions asked (7)

  1. 01

    Next Greater Element

    Data Structures & Algorithms · Medium

    Given an array, find the Next Greater Element (NGE) for every element in it. The Next Greater Element for an element x is the first greater element on the right side of x in the array. If no such element exists, consider it -1.

  2. 02

    Train Scheduling Data Structure

    Data Structures & Algorithms

    I encountered a problem involving trains at a railway station with varying arrival times, some cancelled or delayed. I was asked to identify the most suitable data structure for solving this problem and provide justification.

  3. 03

    Coin Change Problem

    Data Structures & Algorithms · Medium

    I was asked to describe the approach to solving the classic Coin Change problem, which involves finding the minimum number of coins needed to make a certain amount, given a set of coin denominations.

  4. 04

    Convert Postorder Traversal to BST

    Data Structures & Algorithms · Medium

    Given a postorder traversal sequence of a Binary Search Tree (BST), reconstruct the original BST from it.

  5. 05

    Swiggy HLD Problem

    System Design

    I was presented with a High-Level Design (HLD) problem related to Swiggy, designed to test my understanding of HLD principles and their application in a practical scenario.

  6. 06

    OYO Database Design

    System Design

    I was tasked with designing a database for a hotel booking system, similar to OYO.

  7. 07

    Stock Buy and Sell Problem

    Data Structures & Algorithms · Easy

    I was asked to provide an efficient approach to solve the classic Stock Buy and Sell problem, where the goal is to maximize profit by buying and selling stocks over a period.

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!