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

SDE - 1

Netlink
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
Before cracking any interview you need to prepare your basics. So, I started doing all the vital topics and subjects like DBMS, DSA, Networking, and Operating Systems. After preparing the top 100 or 150 questions on each topic I prepared all my projects and resume which was the most important step.
Application story
This was an on-campus opportunity. I applied through the college placement cell. The first resume shortlisting was performed. After the online test 50 candidates were selected for interviews.
Why selected/rejected for the role?
I think that I was confident and correct at the same moment that made a positive impact of my personality and knowledge on the interviewer. So, he was impressed that's why I was selected.
Preparation
Duration: 3 months
Topics: OOPS, OS, Computer Networks, DSA, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 2 : Do at-least 2 good projects and you must know every bit of them.

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

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date11 Jan 2021
Coding problem2

1. K Largest Element

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

You are given an unsorted array containing ‘N’ integers. You need to find ‘K’ largest elements from the given array. Also, you need to return the elements in non-decreasing order.

Try solving now

2. Keys and Rooms

Moderate
30m average time
70% success
0/80
Asked in companies
WalmartMicrosoftDisney + Hotstar

You are given some information about the rooms of a military camp. The rooms are numbered from 0 to 'N-1'. Each room contains keys to some other rooms. You can visit a room only if you have a key to that room. Your task is to determine whether each room can be visited or not.

Note:

1. Room 0 is the only room that is initially unlocked and doesn’t require any key to enter.

2. Any other room can be visited only if you have the key to that room.

3. More than one room can have keys to the same room.

4. You are allowed to visit rooms in any order.

5. You can visit any room multiple times.
Try solving now
02
Round
Easy
Online Coding Test
Duration50 minutes
Interview date20 Jan 2021
Coding problem2

1. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Try solving now

2. Find All Anagrams in a String

Easy
15m average time
85% success
0/40
Asked in companies
IntuitThought WorksAmerican Express

You have been given a string STR and a non-empty string PTR. Your task is to find all the starting indices of PTR’s anagram in STR.

An anagram of a string is another string which contains the same characters and is obtained by rearranging the characters.

For example: ‘SILENT’ and ‘LISTEN’ are anagrams of each other. ‘ABA’ and ‘ABB’ are not anagram because we can’t convert ‘ABA’ to ‘ABB’ by rearranging the characters of particular strings.

Note:

1. Both STR and PTR consist of English uppercase letters.
2. Length of string 'STR' will always be greater than or equal to the length of string ‘PTR’.
3. In case, there is no anagram substring, then return an empty sequence.
4. In case of more than one anagrams, return the indices in increasing order.
Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date10 Feb 2021
Coding problem1

1. Basic HR Questions

1. Where do you see yourself after 5 years?
2. What are your strengths and weakness?
3. Salary Discussion

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
Software Engineer
3 rounds | 5 problems
Interviewed by Netlink
817 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114578 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34960 views
7 comments
0 upvotes