# Numerify Interview Experience | Set 2 (On-Campus)

Job role: Associate Software Engineer

First Round:
was conducted on cocubes.com. There were two parts.
Part 1: Aptitude
part 2: 30 MCQ technical questions.

Second Round: Around 60 people were shortlisted out of 476 from first round.
These 60 people were mailed an assignment that consisted of 6 questions out of which we had to do any 1. 1st 2 were coding questions and last 4 were database questions. we had around one week to complete the assignment and mail them. I attempted the second question which was a coding one.
The question was:

1.Given is a (mxn) matrix with values comprising of 0 and 1. 1 defines a path while 0 is a
void. By traversing from top (0,0) (top-left) position using up, right, down and left
position, is it feasible to figure out if there is a valid path to the final (m-1, n-1) (bottomright)
position. You cannot step on an already traversed tile more than once. If there is a
valid path, can the same be printed?Print all possible
paths.
Input:

```4,5
1,0,1,1,0
1,1,1,1,1
0,0,1,1,0
1,0,0,1,1```

Output:

```Yes

[{(0,0), (1,0), (1,1), (1,2), (2,2), (2,3), (3,3),(3,4)},
{(0,0), (1,0), (1,1), (1,2), (1,3), (2,3), (3,3),(3,4)},
{(0,0), (1,0), (1,1), (1,2), (0,2), (0,3), (1,3), (2,3), (3,3), (3,4)}]```

for solution, i referred to “the rat in a maze” problem in geeks for geeks.

Third Round (1st technical interview):
Next was the face to face interview round. Around 24 people out of 60 were shortlisted from the assignment round for a one on one interview. The company came in our college for 2 profiles- Software and Database. Those who attempted coding question in their assignment were being interviewed for software profile and those who attempted database were in for a database profile.
Now this was the fun part. I was expecting that he would ask me questions related to my assignment but he didn’t. Infact he didn’t even open my CV. Instead he started testing my general computer science concepts:

He first asked me what subject and language i was comfortable in. I told him C and C++. From there onwards, my whole interview went in that direction.
He first asked me a c++ code, which i was not able to solve fully but i kept on trying (this is very important!). Also i was thinking loudly. Whatever came to my mind, I made sure that he Knew it even if i was not able to solve the full question.

Then he asked me some data structures questions:
1. Detecting a loop in a linked list. ( i first used brute force then came up with floyd warshall algo). He then asked me to prove why fastptr and slowptr will always meet?

2. Find the height of a binary tree.(this was simple)

3. Given a binary tree, Print all nodes who do not have a left child.

4. He extended the 3rd question and asked me to modify the above code to print the total number of nodes. (You just have to make a global variable count that will be incremented with each of the recursive call)

He then gave me a question to write the code to print all the prime factors of a given number n.

Finally he asked me things related to computer networks:
1. How does a LAN work in your college.

2. what happens when you type a url in ur web browser. explain the whole process from sending a request to getting a webpage in response.

This interview lasted for about 45 minutes.

Fourth Round( 2nd technical interview)

Most of the people were rejected in the first round itself and only < 10 people remained for the second the round. Luckily, I got through ðŸ™‚
Because my 1st interview was very good, i didn't have to face much of problems in the second round.

He started from where the first interviewer had left.

He asked me some OOPS concepts first:
1. Difference between pointers and references. which is better?

2. Is call by reference supported in C/C++?

3. Problem with multiple inheritance? (the diamond problem)

Then he told me to write a code to print nth term in fibonacci series. I wrote a simple code using 3 variables. He asked me to write the same using recursion. I wrote it. Then he asked me which one was better and why? I Told him that first one was better because it doesnt take extra stack space like recursion. he then asked me which one was more readable. when i wasnt able to tell, he told me that 2nd one was more readable because in recursion we clearly calculate the number as sum of previous 2 fibonacci calls (Which is what fibonacci series actually is).

In Another question he gave me a string. I had to reverse it word by word.
for example " I am ayush garg" changes to " garg ayush am I". A simple solution to this is reverse the whole string letter by letter. and then again reverse every single word of it.

Then it was puzzle time. He asked me Numerous Puzzles:
1. Given an arbitrary triangle, Divide it into two equal halves of same area and prove that those two areas are actually equal. ( A simple way is to draw a median as a median divides a triangle into two equal halves. prove it using 0.5*b*h)

2. Given a rectangle. another smaller rectangle is cut out of it. Now divide the remaining rectangle into two equal halves. ( Join the mid points of the two rectangles. That line will divide the remaining part into two halves.)

3. Then finally he gave me the most interesting and the most difficult puzzle of all Which Ultimately i was not able to solve.
Given a prison with 16 cells arranged in the form of a grid. Basically you start at (0,0). You have to reach at (3,3) traversing each cell atleast once( The trick to this was that you can traverse the cell from which you started again!! just remember this!)

Finally after one hour of grinding i was through!!

Fifth Round: (HR Interview)
Only 4 people made it till the HR.
She started asking me with normal HR questions. How was my day? Tell me about yourself. my strengths, my weaknesses and what am i doing to improve on them. Then , To my surprise she also gave me a puzzle to solve.
here is the link to the puzzle:
http://puzzles.nigelcoldwell.co.uk/thirtynine.htm
I knew it and answered it correctly

She then asked me a variation of the same. Like what would I do if there were Three types of hats- Say red blue and green. I was not able to answer it . But again, I didn’t give up and kept on trying.
Finally she asked my what would i like to do in the company and what is my passion. She also discussed one of my projects from my CV.

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

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Previous
Next