# Service Now Interview Experience (On-Campus)

Service Now visited our college this year. They started off with an online test followed by a ppt about their company for an hour and then by 5 rounds of the interview process. The number of technical rounds, however, varied from person to person.

Round 1 :
This was a 30-minute online test which had 30 questions in it. The questions were on C, C++ and Java concepts, Applications of OOP concepts in the real world, Data structures(Linked List, Heaps) and Algorithms(Edit-distance algorithm), Time complexities. There was a question on A.R. in which we were asked to identify the technology used in an image given. There were also 2 code snippets for which we were asked to predict the output. These questions also constituted 2 aptitude questions on the whole 1 from mixtures and other was a maze problem. Most of these questions were really basic.

Round 2 (Technical Round):
It was a technical face-to-face interview. In this round, the interviewer asked me only 2 questions one was a programming question while the other was a brainteaser.

The first question was something as follows:-

He gave an array of positive and negative elements and asked me to compute the largest sum contiguous subarray. I initially explained to him the whole algorithm orally but I was unable to code it properly and was missing a few edge cases. But after two or three failed trials and a little help from the interviewer I was finally able to write the code for it.

The algorithm can found in the following link
https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/

The puzzle is in the link below:

https://www.cut-the-knot.org/blue/EightCoins.shtml

I already knew the answer for this beforehand so I gave the answer in 30 seconds or so.

Round 3 (Technical Round) :
https://www.geeksforgeeks.org/find-a-pair-with-given-sum-in-bst/

I gave him two different solutions initially whose time complexities were O(n), O(nlogn) respectively but the former was taking a space equivalent to O(max element) and latter O(1). So he asked me to reduce the space complexity to O(n) and time complexity to O(n) only. I did this with the help of the clues given by the interviewer.

Round 4 (Technical Round):

Round 5(Technical Round) :

This was also a technical round. In this round, the interviewer asked me only 2 questions one was a programming question while the other was a brainteaser.

The first question was something as follows:

In a typical stock market scenario, he asked to devise an algorithm such that the profit gained by a day trader is maximum. He also provided me with the stock prices of the company.

The puzzle is in the following link

http://www.crazyforcode.com/3-mislabeled-jars/

I answered this puzzle with the help of some clues given by him in 3 trials.

Round 6(HR Round):

In this round, he first asked me about my final year project, and then few questions about the company and why I wanted to get into it, few other questions about my failures and achievements and at last he asked to solve a puzzle which I didn’t understand but I tried my best to answer it.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.