7/30/2018 NISSAN INTERVIEW EXPERIENCE

NISSAN INTERVIEW EXPERIENCE

NISSAN INTERVIEW EXPERIENCE

By: Nikunj Goel

Nissan carried out this drive all over india to select in total 100 Engineers.

Mail we received for the off campus recruitment from TnP of Our College :

Kind attn. all students eligible and interested in Nissan Digital off campus drive 2018 batch.

Nissan, a pioneer in the automotive industry and the world’s largest EV manufacturer is opening
applications to new talent for the Nissan Digital Hub in South India.

Nissan Digital, India is the first among the five global hubs and has been institutionalized to spearhead the
comprehensive digital transformation in Nissan. The organization is now opening their positions to freshly
graduated Engineering students from the 2018 batch.

The criteria for application and recruitment is as follows –

Ø The candidate should hold a degree in computer science, IT, MCA, electronics engineering, EEE and
Applied Electronics
Ø The candidate must be a 2018 Engineering graduate having cleared all papers
Ø Candidates who have graduated in 2017 but have relevant work experience and fulfilling the criteria
may also apply
Ø He/She must have scored more than 60% marks in Engineering, Higher Secondary (Class 12) & School
Board Exams (Class 10)

Link given below for registration of application to apply directly latest by 6 pm, 6th June.

www.cocubes.in/nissanhiring-fresher

Please refer to the selection process highlighted below for more clarity-
1. Application Form to be filled and submitted
2. All forms to be screened and candidates shortlisted
3. Aptitude Test (can be taken from home)
4. Coding Test (can be taken from home)
5. Behavioural Assessment (will be done from home)
6. Technical Sessions & Interview with HR (in select locations)

Job Profile-
1. Advanced Software Engineer (Fresher) – CTC: 10 LPA
2. Software Engineer (Fresher) – CTC: 6.25 LPA

Joining in early July 2018.

First Round is an online round hosted by Co Cubes.

But Before that online round there was initial shortlisting from the database. No one can figure out the
exact criteria of rejecting a candidate on this particular stage. Even People with better profile than me
were rejected so basically there can be infinite number of conjectures for ex. College,Salary,Designation.
As it was a off Campus so these anecdotes might have been considered.

Moving on to the 1st Online Round:

Mail Received from Co Cubes

Thank you for applying at Nissan. You have been SHORTLISTED for the Aptitude Assessment (Take from
Home) for which the details are mentioned below:

Test window will remain open from 9th June 2018 (12 PM) to 11th June 2018 (11:59 PM). Please ensure
that you take the online test between the given timelines.
https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 1/6
7/30/2018 NISSAN INTERVIEW EXPERIENCE

You can take

· INTERVIEW
NISSAN the test only ONCE.
EXPERIENCE
· Please make sure you have a web-cam Enabled System and proper INTERNET
CONNECTIVITY before starting the test.
· On 11th June 2018 11:59 PM, the test window will close and you will not be
allowed to login.

Test Pattern – There will be a single test of 60 mins comprising the below sections:

Section No. of Ques

English 20

Analytical 20

Quantitative 20

Total Time 60 Mins

Note: Please make sure you attempt all the sections before submitting the test. Once submitted,
you won’t be able to take the test again.
Also, the test link should be opened in https and not http as the test requires a secure connection.

Test Instructions:
1. Please log in using the above mentioned Username, Password and Passkey.
2. You will be remotely monitored through EYE IN THE SKY technology.
3. Any candidate identified as a case of malpractice will be disqualified from the process.
4. Please ensure you have continuous internet speed while taking up the test.
5. Please do not switch tabs or go outside the test window while taking up the test as that will
lead to auto-logout. If switching of tabs is done, then system will show warning message and then
auto-logout the test.

Important Instructions:

• The Laptop/Desktop/Computer which is being used for the Online test should have a Web-Cam facility.
• The Test has to be taken from Computer/Laptop only. Please do not use your smartphone to take the
Test.
• Before the assessment begins, it will ask you to allow access to the system Web-Cam – you should
allow the access to the Web-Cam.
• Web-Cam should be kept on throughout the examination.
• If in case you do not see your Image in the Web Cam, request you to inform us immediately.

As It is mentioned in the above email

Number of questions 60
Minutes : 60

Section Wise Description

Analytical : Quite easy.Totally manageable in the given amount of time.

English : Quite Tough for me too (PS I am a GRE ASPIRANT)

Quantitative : Mixed Section,time was a factor.

I Passed this round successfully.

CODING ROUND (ROUND 2)

Dear Nikunj Goel

https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 2/6
7/30/2018 NISSAN INTERVIEW EXPERIENCE

Congratulations!
NISSANWeINTERVIEW
are happy to inform you that you have successfully cleared the Aptitude round of
EXPERIENCE
Nissan selection process and qualified for the second round (Coding assessment).

You have been shortlisted based on your performance in the aptitude test and also based on the details
given by you. Please note that the original proofs for your claims shall be verified at the interview stage.
Any deviation from the entered details may result in cancellation of your candidature at any point of time.

Next Step:

You are now required to take the coding assessment.

Test Pattern – There will be two linked tests comprising the below sections:

Section No. of
Questions
Programming 1 1

Programming 2 1

Programming 3 1

Total Time 60 Mins

So Basically there were 3 questions quite manageably for anyone who is in regular Competitive
Programming Practise.Main Issue was time as 2 questions were quite easy third question was quite time
taking.

Question 1:

Given a number.
7839564
Print number placed at the even places only.

Output: 896
Time Taken to Code : 2 mins
Question 2:

Given numbers from 1 to n with 1 number missing.Print the missing number

1 2 3 4 6 7 8 9 10

Output: 5

Time taken to Code: 2 mins

Question 3:

Closest leaf to a given node in Binary Tree

Given a Binary Tree and a node x in it, find distance of the closest leaf to x in Binary Tree. If given node
itself is a leaf, then distance is 0.

Time taken to Code : 30 Minutes.It was quite challenging.

Refer to this link for details

https://www.geeksforgeeks.org/closest-leaf-to-a-given-node-in-binary-tree/

https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 3/6
7/30/2018 NISSAN INTERVIEW EXPERIENCE

Behavioral Assessment Round 3:

NISSAN INTERVIEW EXPERIENCE
Congratulations! We are happy to inform you that you have successfully cleared the Coding round of
Nissan selection process.

You have been shortlisted based on your performance in the aptitude and coding test and also based on
the details given by you. Please note that the original proofs for your claims shall be verified at the
interview stage. Any deviation from the entered details may result in cancellation of your candidature at
any point of time.

Next Step:As a last step before the interview you are required to take the behavioural assessment –
ADEPT. Note that this is not an elimination criterion, but a mandatory requirement to be considered for the
interview call.
FACE TO FACE INTERVIEW VENUE :

AMITY UNIVERSITY NOIDA

ROUND 4 : (First F2F interview)

After General Introduction

Interviewer : A post office is set at a village and it has 5 postmans which can deliver the posts to various
locations in the village cost if each way was given.Even the cost of each postman was given too. I had to
code for minimizing the cost of the post office to distribute all the posts.

Me : Was not able to grasp the exact requirement of the question. Started coding with adjacent list. After
coding for a while Interviewer reviewed my code and explained the problem again.After few more tries and
hint from Interviewer I was able to code as per the requirement using pair and vector.
Concept : Dijktra’s Shortest Path

Interviewer: An Engineer wants to repair all the roads in his city. Weight of every direction was given. Find
the least cost to repair all the roads of the city.

Me : Was able to do it easily. It was a straight question which involved concept of KRUSKAL Algorithm.

Interviewer: There are 4 persons (A, B, C and D) who want to cross a bridge in night.
A takes 1 minute to cross the bridge.

B takes 2 minutes to cross the bridge.

C takes 5 minutes to cross the bridge.

D takes 8 minutes to cross the bridge.

There is only one torch with them and the bridge cannot be crossed without the torch. There cannot be
more than two persons on the bridge at any time, and when two people cross the bridge together, they
must move at the slower person’s pace

Can they all cross the bridge in 15 minutes?

Me: Tried the above puzzle first with A and D pair crossing the bridge initially but it was not the correct
answer.

Interviewer : Are you sure with the answer?

https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 4/6
7/30/2018 NISSAN INTERVIEW EXPERIENCE

Me: i’ll check it once more and let you know.Took me a while to calculate the correct answer.
NISSAN INTERVIEW EXPERIENCE
Refer to this link: https://www.geeksforgeeks.org/puzzle-18-torch-and-bridge/

Interviewer: Can you code the above problem statement

Me : It was very difficult for me.Tried various approaches involving Dynamic Programming too but wasn't
able to provide the exact solution somewhat near to it.

Refer the link: https://www-geeksforgeeks-org.cdn.ampproject.org/v/s/www.geeksforgeeks.org/program-

bridge-torch-problem/amp/?
amp_js_v=a2&amp_gsa=1&usqp=mq331AQCCAE%3D#referrer=https%3A%2F%2Fwww.google.com&am
p_tf=From%20%251%24s&ampshare=https%3A%2F%2Fwww.geeksforgeeks.org%2Fprogram-bridge-
torch-problem%2F

Interviewer : Moved on to trees.Find the Inorder and preorder of a given tree.

Me: Solved easily.

Interviewer : Given a Inorder and preorder traversal of a tree. Can we find that they belong to the same
tree.

Me : Possible by trying to construct the tree from the given traversals. If the tree is constructed we can
conclude that they belong to the same tree.

Interviewer : Can you code?

Me: took me a while but was able to do it with no errors.

Interviewer : Gave me random BST and asked to print it in some kind of pattern.

Me: Initially it was hard for me to recognise the pattern it was printing in. After a while and with a hint I was
able to recognize the pattern.

Interviewer : Code it

Me: Tried my best. Was stuck in the recursive part of the code.

Refer the Link https://www.geeksforgeeks.org/diagonal-traversal-of-binary-tree/

Round Cleared

ROUND 5 :

Interviewer : Tell me about the ongoing job at Octro Inc.

Me: Told him everything from hadoop,big data to Kafka. As my profile in octro is Big data engineer it really
helped me to impress the interviewer with the same.

Interviewer : Asked me more about the use of HBASE and COUCHBASE. Difference and architecture of
the two.

Me: Hbase was configured by me at Octro so it was quite easy to explain in detail.

Interviewer : Gave me a question in which number from a range of m to n is given.(m < n) Find the
smallest number missing from the list.

Me: Solved using Set Data structures took me a while. Was Able to code it too.

Interviewer : Draw an architecture for a Mobile Contacts App.

https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 5/6
7/30/2018 NISSAN INTERVIEW EXPERIENCE

Me: With some help from the Interviewer solved it using Struct and Map.
NISSAN INTERVIEW EXPERIENCE
Interviewer : Given the set of number. Only 2 number are interchanged in order.Find the position with the
most optimized approach.

Me: Solved it using BST insertion Concept

ROUND PASSED SUCCESSFULLY

ROUND 6(HR ROUND)

General Questions.

FINAL VERDICT :
SELECTED

https://docs.google.com/document/d/1DAQWA1gDhTcPs4zC3CN0V_mmju1olPqBoAz-5WjyFLs/mobilebasic 6/6