nVent Interview Experience

nVent was the first company to visit our campus this year for placements. Almost 200 candidates applied for nVent, from which only 60 were shortlisted based on resume and i was one of them.

Tip : Make a one page resume and the information should be crisp and clear on the resume ,also highlight your achievements.

The whole recruitment process lasted 2 days.

Technical Test

On day 1, orientation program and Technical test were conducted.

The technical test consisted of 40 MCQ’s and had weightage 1 mark each ,there were 2 coding questions .The first question was of medium level and the other one was of hard level.

• Asteroid Collision
  As i practiced regularly on leetcode, this question seemed to be a question of easy level for me ,It was mentioned to solved this problem in O(n) time ans space complexity.
• This question was related to graph and could be solved by either BFS or DFS.
• At around 11 pm i received the mail that i have been selected for next round which was on day 2.

Group Activity

The first round was a group activity , we played a game in which 15 candidates selected from yesterday’s elimination round were divided into 3 teams and were given the task to build a structure of maximum height from paper and cello tape on which you can place a ball and the structure should be stable.

The main motive of this activity was to test logical thinking, time management and team bonding. As this was not an elimination round so all the candidates were allowed to sit for the next round.

Round 1

The round 1 was all about DSA and core subjects of CS. They asked me 3-4 questions of DSA. Also asked me to explain the four pillars of OOP. There were 5-6 questions on DBMS related to queries and concepts.

The DSA questions were :-

• Reverse Linked List
• This question was of printing a given pattern
• Question based on insertion sort

Results were declared of this round and 7 candidates proceeded to Round 2 .

Round 2

This Round was heavily focused on DSA and resume. I was asked 4 questions ( 3 based on DSA and 1 based on logical thinking)

1.) Binary Tree Right Side View

I told a solution which uses queue, but the interviewer asked me to solved this question by using stack and after little thinking i was able to solve it with stack .The time ans space complexity of solution i gave was O(N),

The interviewer further asked if we can optimise this time complexity to O(logN), i tried but couldn’t find a solution for O(logN) time complexity ,as it is not possible to traverse all nodes in O(logN) which is required in this question.

so interviewer was satisfied with my approach and solution.

2.) Pattern Printing

1

* *

2 3. 5

* *. *. *

8 13 21 34 65

* *. *. *

9. 6. 3

*. *

1

3.) Spiral Matrix

4.) this was not a DSA question, it involved maths and logical thinking.

I solved all the questions with the most optimised solution , we had to write code for all the DSA questions and the dry run this code for a given test case.

The interviewers were friendly in every round and made me feel comfortable.

4 Students were selected for the HR round and 3 of them were hired .

Verdict :- Selected