ServiceNow Interview Experience – Software Engineer (IC2) – May 2025

servicenow logo
servicenow
Software Engineer (IC2)Hyderabad2.5 years
May 16, 20252 reads

Summary

I recently interviewed at ServiceNow for a Software Engineer (IC2) role, navigating multiple rounds covering DSA, HLD, and behavioral questions, and ultimately received an offer in May 2025.

Full Experience

Hi everyone, I recently interviewed at ServiceNow for the Software Engineer (IC2) role at their Hyderabad office. Here’s a quick breakdown of the process:

🔹 Round 1: DSA Jump Game II

Minimum Number of Swaps to Make the String Balanced

🔹 Round 2: DSA + HLD Remove K Digits

Merge Two Sorted Lists (without extra space)

One basic high-level design question. Good discussion overall.

🔹 Round 3: Hiring Manager Situation-based and behavioral questions

Discussion on past work

DSA variation of Majority Element (More then 3 distinct elements)

One HLD problem

🔸 Hiring Paused After this round, hiring was paused for the team I was interviewing with. HR contacted me after ~10 days and asked if I’d like to interview for a different team. I agreed.

🔹 Round 4: DSA + DB Design Modified Maximal Square (with coordinates)

One database design question

🔹 Round 5: DB Design + DSA Basic DB schema design

Valid Parentheses

✅ Final Outcome Got the offer in May 2025.

🙋‍♂️ About Me 2.5+ years experience

Tier-1 college

Product-based background

Compensation Detail Let me know if anyone has questions! Happy to help 😊

I don't know how to comment while staying anonymous.

  1. I had applied and forgotten about it, but after a few months, the HR reached out to me, I’d say it was pure luck.
  2. I don't know the exact team.

Interview Questions (7)

Q1
Jump Game II
Data Structures & Algorithms
Q2
Minimum Number of Swaps to Make the String Balanced
Data Structures & Algorithms
Q3
Remove K Digits
Data Structures & Algorithms
Q4
Merge Two Sorted Lists
Data Structures & Algorithms

Merge two sorted linked lists without using extra space.

Q5
Majority Element (More than 3 distinct elements)
Data Structures & Algorithms

A variation of the Majority Element problem where the requirement is to find elements appearing more than N/3 times, or generally, handle more than 3 distinct elements.

Q6
Maximal Square (with coordinates)
Data Structures & Algorithms

A modified version of the Maximal Square problem that involves handling coordinates.

Q7
Valid Parentheses
Data Structures & Algorithms
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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