ServiceNow Associate Software Engineer Intern | Interview Experience

servicenow logo
servicenow
Associate Software Engineer Intern
August 4, 20253 reads

Summary

I interviewed for an Associate Software Engineer Intern position at ServiceNow and was selected. The process included an online assessment and three technical rounds covering data structures, algorithms, and projects, with specific questions on topics like AVL trees, linked lists, and dynamic programming.

Full Experience

Interview Process:

1. Online Assessment:

  • 3 problems: Difficulty was LeetCode Medium, Medium & Hard.

2. Technical Round 1:

  • Introduction & Resume Discussion (5 mins).
  • Asked about AVL Tree.
  • A linked list problem: Reverse two segments of a linked list.
  • A math puzzle.

3. Technical Round 2:

  • Introduction & Project Discussion (10 mins).
  • Basic questions related to ML and JavaScript (5 mins).
  • A DSA problem, a slight modification of Kadane's Algorithm.
  • A DP problem, a variation of the Minimum Sum Path on a grid with 2 follow-ups.

4. Technical Round 3:

  • Project Discussion and Development-related questions (10 mins).
  • A string-related problem (25 mins).
  • I was asked to implement all DSA problems and run them on an online compiler. Interviewers provided edge cases.

Result:

Selected

Compensation:

89K per month for 2 months.

Interview Questions (4)

Q1
AVL Tree Concepts
Data Structures & Algorithms

Discussion on AVL Tree properties, rotations, and operations.

Q2
Reverse Two Segments of a Linked List
Data Structures & AlgorithmsMedium

Given a linked list, reverse two specific segments of it.

Q3
Kadane's Algorithm Variation
Data Structures & AlgorithmsMedium

A DSA problem that was a slight modification of Kadane's Algorithm.

Q4
Minimum Sum Path on Grid Variation
Data Structures & AlgorithmsMedium

A dynamic programming problem, a variation of the Minimum Sum Path on a grid, followed by two follow-up questions.

Preparation Tips

DSA Experience:

  • Had prior knowledge of topics like Stack, Queues, Binary Search, Number Theory, Bit Manipulation, Trees (Generic Trees), Graphs, and DP (excluding advanced concepts like Digit DP and DP with Bitmask).
  • Learned interview-specific topics like Linked Lists and Binary Trees within 15 days before the interview.

Competitive Programming:

  • Peak Specialist on Codeforces.
  • Active in competitive programming for a long time on Codeforces, CodeChef, and occasionally on Atcoder.

Development Experience:

  • Below average in development.
  • Familiar with Python and JavaScript.
  • Created a few ML projects.
  • Developed a web server in C++.
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!