# Ivanti Interview Experience (On-Campus) 2022

• Last Updated : 16 Sep, 2022

Ivanti Visited our campus (VIT) in the month of August 2022 for the role of Software Developer. A total of 384 Students who appeared were shortlisted for the Online Assessment Exam.

Round 1: OA (1 hour): The first round was held on the Hackerearth platform. It consisted of 2 coding questions and 4 aptitudes MCQs, the time duration was 1 hour. The coding questions were:

• The first coding question was a slight variation of the maximum number of meeting rooms required. I was able to do it completely. All test cases passed.
• The second question was like this. We were given (i) an array ARR of length N and (ii) M queries of the form [L, R, K]. We have to find a number of elements greater than a given number K between range [L, R]. I did it using brute force solution O(M*N). 8/12 test cases passed. Rest 4 got TLE. I think there exists a solution with O(M log N) using the Segment Tree Approach.

After 4 days the list came and around 50 students were shortlisted from this around.

Round 2: Technical Interview 1 (30 minutes): The round started with the interviewer asking me to Introduce myself then we had a brief discussion about my projects and past internships. He asked me some basic DSA questions the question was:

• Question 1. Find unique elements in an array. I did it using unordered_map:  T.C O(n)  S.C O(n). I used two passes. First, the pass is to count frequencies, and the second pass is to print elements having a frequency equal to 1. He asked me to do it one pass only. I wasn’t able to figure it out. Maybe he was expecting first to sort the array and then compare adjacent elements: T.C. O(nlogn) S.C: O(1)
• Question 2. Find a subarray in a given array having a sum equal to K. Print the starting and ending index of that subarray. Return -1 if it doesn’t exist. First I told him about the brute force approach O(n2). Then I told him about the optimized approach using unordered_map O(n). I was able to fully solve this question.

We had to share our screen and write the code in our compiler and pass the Test Cases given by the interviewer

Finally, he asked me if I knew Java and ReactNative. I told Yes to Java and No to ReactNative. But I also mentioned that I am a React Developer so it will be easier for me to learn ReactNative. He then asked me about my preferred domain. I told him FrontEnd and DataAnalyst. 40 out of 50 students were shortlisted in this round.

Round 3: Technical Interview (60 minutes): The interviewer started by asking me about my previous rounds. He then asked me to explain my work in my past internships.

• Finally asked me to solve the second coding question of my OA by sharing the screen. I solved it using the same brute force method as I did previously. He then gave me some slight variations about the same.
•  I was able to implement them. He then asked me if I can optimize my approach. I thought for a couple of minutes then told him that it can be optimized by segment tree maybe.
• He also asked me a second question  : Reverse all the words in a sentence without altering the positions of special characters.
Input :  ” Let’s  go*  to  a  M?ana-li  Tri!p ”  Output : ” ste’L  og*  ot  a  i?lan-aM  pir!T “.  It was an easy question so I was able to solve it completely.
• Then he asked me some basic DBMS and OOPS questions. They were relatively very easy-level questions. I answered them all.
• Then he asked me about the steps of what happens when we run a Program. I told him the steps in some random manner, and he corrected me and explained to me clearly how it works.
• In the end, he asked me if I wanted to ask something. I asked him about the role I will be working on if I get selected and also if we can switch it. He answered it depends upon the interest and the team you are assigned.

30 out of 40 students were shortlisted in this round.

Round 4: Technical + HR (90 minutes): This round lasted for 90 minutes first 70 minutes were technical and the last 20 minutes were HR.

Firstly the introduction then my work experience discussion. Then he asked me a lot about OOPS and some scenario-based questions on inheritance and polymorphism. He also asked me to explain the 4 pillars of OOPS and their real-world examples. Nothing from OS or DBMS or any other subject was asked.

He also asked me 2 coding questions which I had to solve on the online Compiler by sharing the screen.

• Question 1:  Given 2 sorted arrays, merge them into a third array which is sorted completely. First I told brute force coping both the arrays into a third array and sorting the final array. T.C O(n log n). He then asked me to optimize it. I used two pointers O(n) and was able to do it. I got stuck at last as I was getting wrong answers but I was able to debug it in a few minutes.
• Question 2: Implement Linked List from Scratch. Also, Implement a function to insert a node in the linked list at a given position. This was the question I took 30+ minutes to solve. I got stuck several times. The interviewer asked me to debug the code which I started doing using cout statements. The interview taught me how to use the debugger option in the compiler. He was telling me each and every step to use the debugger. (Thanks to him I now knew how to use the debugger.)  Finally, I was able to do the question at last.

In HR questions he discussed my future plans. I told him I wanted to pursue Management Degree in upcoming 3-4 years. We had a lot of discussions on the same topic. He then also asked me about my favorite domains I would like to work upon if I get selected.  No more HR questions were asked.

The next day the final list came. Around 20 students got the super dream internship offer luckily I was one of them.

My Personal Notes arrow_drop_up
Related Articles