Software Engineer Intern at ServiceNow

How it went

What they would tell you

How to prepare

Their background

Round by round

1. 1

   Online Assessment60 min

   The first two were familiar one on arrays, the other on trees. but the third was a classic Hard.

2. 2

   TI 160 min

   The interview started with a friendly chat about my background and projects. I kept it concise but personal, sharing where I grew up, my favorite languages, and why I love building things from scratch. AVL Trees: I was asked to explain what makes AVL trees special, how rotations work, and why they’re useful over standard BSTs. The follow-up was about real-world applications, I mentioned databases and file systems. Linked List Reversal: Reverse two segments in a linked list for example, reverse the first k nodes and then the next m nodes. I walked through my logic using dummy nodes, iterating, and reversing in place and coded it live. The interviewer gave me a few test cases, including the dreaded empty list and “k > list length. Math Puzzle: One of those classic “estimate how many golf balls fit in a bus” brain teasers. The secret is to show your work, break it down into steps, and make reasonable assumptions.

   • Linked List Reversal
   • AVL Tree Problem

What came up