Netlink interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Netlink
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
When I was in my school days I was not that much fond of technology but at that stage I didn't knew that I am going to choose my career in this field of study. But anyhow in a cycle of happenings, I ended up being here. I started my programming journey from the second year of my engineering, I practised DSA from leetcode and codestudio. I also learned Web Development in the third year, I started applying for jobs from linkedin and several other platforms. Luckily, I got a chance to work at NetLinks.
Application story
It was an On-Campus Offer. I got to know about this by a whatsapp group. IBM was offering post of SDE-1. There were two technical rounds before the HR Round.
Why selected/rejected for the role?
I would say that the way I answered the questions really helped me clearing all the rounds. I was thinking out loud and this is one of the most important quality one should always carry for the interview rounds.
Preparation
Duration: 3 months
Topics: OS, OOPS, DBMS, SQL, DSA, System Design, Computer Networks
Tip
Tip

Tip 1 : Have Patience 
Tip 2 : Make your fundamentals strong 
Tip 3 : Practice varieties of problems as much as you can. 
Tip 4 : Participate in various contests

Application process
Where: Campus
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1: Have Couple of Projects 
Tip 2: Be confident about your project
Tip 3: Highlight the tech stack used in your project. 
Tip 4: Keep your Resume classic and simple

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date22 Jul 2022
Coding problem2

Two coding questions of moderate level difficulty were asked in this round.

1. Duplicate Subtrees

Moderate
30m average time
70% success
0/80
Asked in companies
MathworksOlaNetlink

You have been given a binary tree, you are supposed to return the root values of all the duplicate subtrees. For each duplicate subtree, you only need to return the root value of any one of them.

Two subtrees are duplicate if and only if they have the same structure with the same node values.

For example:
In the below binary tree :

alt text

The duplicate subtrees are {{2, 3}, {3}} and we have to just return the root values of each duplicate subtree, so the output is {2, 3}.
Try solving now

2. Left Rotations of An Array

Moderate
10m average time
90% success
0/80
Asked in companies
IBMIBMThought Works

You are given an array consisting of 'N' elements and you need to perform 'Q' queries on the given array. Each query consists of an integer which tells the number of elements by which you need to left rotate the given array. For each query return the final array obtained after performing the left rotations.

Note:

Perform each query on the original array only i.e. every output should be according to the original order of elements.

Example:

Let the array be [1, 2, 3, 4, 5, 6] and the queries be {2, 4, 1}. For every query, we’ll perform the required number of left rotations on the array.

For the first query, rotate the given array to the left by 2 elements, so the resultant array is: [3, 4, 5, 6, 1, 2].

For the second query, rotate the given array to the left by 4 elements, so the resultant array is: [5, 6, 1, 2, 3, 4].

For the third query, rotate the given array to the left by 1 element, so the resultant array is: [2, 3, 4, 5, 6, 1].
Try solving now
02
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date30 Jul 2022
Coding problem2

This was second technical round but it was comparatively easy round to the first one.

1. Possible Bipartition

Moderate
20m average time
80% success
0/80
Asked in companies
SprinklrAppleAmazon

You are given an integer ‘N’ which denotes a set of N people numbered from 1 to N and a matrix ‘DISLIKE’ with M rows and 2 columns. Each row in the matrix denotes two people who dislike each other i.e. for any valid row i, DISLIKE[i][0] dislikes DISLIKE[i][1] and vice versa.

Your task is to split the set of N people into two groups under the conditions:

1. It is not allowed to put two persons in the same group who dislike each other.

2. The size of the two groups may or may not be equal.

3. Each person from the set belongs to exactly one group.

Try solving now

2. Puzzle

Given are ten balls, the task is to place these 10 balls in five lines such that each line contains exactly 4 balls.

03
Round
Easy
HR Round
Duration20 minutes
Interview date10 Aug 2022
Coding problem1

1. Basic HR Questions

Tell me about yourself.
What are your salary expectations?
What is your family background?
Share details of your projects.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Netlink
794 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Netlink
731 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Netlink
689 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Netlink
729 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7873 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9972 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4309 views
1 comments
0 upvotes