# ServiceNow Interview Experience | FTE On-Campus 2019

Last Updated : 05 Aug, 2019

Online round (HackerRank):

This round was of 1 hr 15 mins and consist of 2 sections

section 1: 10 MCQSÂ  time:(15 mins) Topics: (Aptitude, OS, OOPS)

section 2: 1 Coding QuestionÂ  time(1 hr)

Question: Longest Increasing Subsequence.

https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/

Round 1 (Technical):

Nearly 120+ students appeared the Online test out of which 22 people got selected for round 1. This round goes around 40-50 minutes. I was bit nervousÂ  but theÂ interviewer was very cool and supportive. He went through my CV and asked me about my project then he switched to coding . He asked me 3 Coding questions and 1 Puzzle

Q1.Â  Given an array find the Majority Element .Â https://www.geeksforgeeks.org/majority-element/

Q2. Given Two arrayÂ  return a third array which is the intersectionÂ  of both the arrayÂ , Ex. A1={1, 1, 2, 2, 3} A2={1, 2, 2, 2, 3, 4}Â  ans: A3={1, 2, 2, 3}, Â  as in A1 1 occur 2 times and in A2 1 occur 1 time so inÂ  A3 1 will occur 1 time, same for 2 and 3. The interviewer clearly mentioned not to use extra space . The space of third array is not taken into consideration.

Q3.Â  Print all nodes at distance k from a given node No extra space, i came up with a solution and he was quite happy with it. he gave me few corner cases and asked me whether my code will able be to handle itÂ  he was interacting very nicely .Â https://www.geeksforgeeks.org/print-nodes-distance-k-given-node-binary-tree/

My first round went very well andÂ  i was among the 12 students whoÂ  gotÂ  selected for the 2nd round.

Round 2 (Technical):

He started withÂ  my internship project we had a brief discussion on my projectÂ  then asked me 2 Coding qustions

Q1)Â https://www.geeksforgeeks.org/nuts-bolts-problem-lock-key-problem/Â , I gave him two approches one with extraspace and time complexity O(n)Â  anathor with no extraspace and with time complexity (nlogn) he asked me to code the solution.

Q2)Â https://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/Â he asked me to tell the approach and was happy with my approach.

then asked me a debug question:Â

int x=10;

for(int i=0;i<x;i–)

cout<<“hi”;

he asked me to make a smallest possible change that will print 10 times “hi”, he asked me not to change i– to i++ rather come with anathor solution, and when i was unable to answer then he told me the answer thatÂ  in for loop change (i<x ) to (-i<x).

Then he asked me Questions related to OOPsÂ  and asked me to design a cinema hall using oops he was very co-operative and was helping meÂ  when i used to get stuck, he was giving hints,

At last he asked me one puzzle :Â You have 7 balls, equally big, equally heavy – except for one, which is a little heavier. andÂ what is the minimum of weighings necessary to find the ball weighs more .

This round also went wellÂ  and i got selected for 3rd round.

Round 3 (Technical/Managerial) :Â Â

He started with a sql query, he asked me to find all details ofÂ  an employee who isÂ  having 2nd maximum salary. i was bit nervous in this round as this was the last round, i was able to answer partially so he asked me for the approach.

Then he moved to interface in oops, we had a great discussion on interface .

Then he asked me how many people watch high profile india match on hotstar i replied 10 to 15 million, then he asked me howÂ  hotstar handle so many people at the same time? this question was a kind of system design, i gave him solution which i learnt from system design by gaurav sen in youtube.

Then he ended with a puzzle: he asked me the mathematical proof of this puzzleÂ https://www.geeksforgeeks.org/puzzle-6-monty-hall-problem/

This round went avarageÂ  for me. i was more tensed after this round. because this was the last round.

VERDICT: 4 peopleÂ got selectedÂ  and i was one of them ðŸ™‚

Tips:

1. Be thorough with your core subjects like OS, DBMS and OOPs.
2. Interact with you Interviewer, ask as much as questions but questions should be valid.
3. Never try to bluff, they are experienced persons they will catch you easily.
4. you must know each and every thing mentioned in your CV.
5. They are going to judge you on the basis of your approach.

Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â  Â ” ALL THE BEST ”Â  Â  ~SKM

Previous
Next