Netcore cloud interview experience Real time questions & tips from candidates to crack your interview
Backend Developer
Netcore cloud
3 rounds | 5 Coding
problems
Rejected
Interview preparation journey
Journey
During my college days, I pursued a degree in computer science, which marked the beginning of my journey to become a backend developer. The introductory programming courses exposed me to languages like Python, Java, and C++, sparking my passion for coding and technology.
As I progressed in my academic journey, I took various courses in data structures, algorithms, web development, and software engineering. These subjects gave me a solid foundation for backend development. I eagerly worked on college projects that involved backend work, gaining practical experience in the process.
Application story
I was in college in my third year when I came to know about this company open for hiring students for backend development, I thought I was a perfect candidate for the company as I have many projects in the same field, so I applied for this company off campus.
Why selected/rejected for the role?
I was rejected because companies often look for candidates who align well with their values and work culture, the hiring team felt that I might not fit well within their team or work environment,
Preparation
Duration: 6 months
Topics: Arrays, Linked List, Networking, Operating Systems, Web Security
Tip 1 : Be confident in your skills
Tip 2 : Explain the projects in interview
Tip 3 : Have a good resume mentioning good projects
Application process
Where: Other
Eligibility: Above 6 CGPA, No active backlogs
Tip 1 : Make it concise
Tip 2 : Should primarily focus on showcasing the projects done
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date8 Jan 2023
Coding problem2
1. Chess Tournament
Easy
20m average time
80% success
0/40
Asked in companies
Chess tournament is going to be organized in Ninjaland. There will be C chess players going to attend the tournament. All the players will be staying in a hotel. The hotel has N free rooms available for the players, where one player will choose one room to live in. The ith room is at position[i] in the hotel. All rooms are in distinct positions.
Focus level of a chess player is defined as the minimum distance between his room and the room of another player. The overall focus of a tournament is defined as the minimum focus level among all players. You as an organizer obviously want the overall focus as high as possible so you assign the rooms to players such that the overall focus is as high as possible.
For example,
let say we have 3 players and 5 rooms available and the rooms are at positions: 1 2 3 4 6
Here the optimal allocation is in rooms 1 3 6 and the overall focus level is 2.
Problem approach
Step 1 : Let the number of free rooms N in the hotel and the number of chess players C attending the tournament
Step 2 : Create a vector named position to store the positions of the rooms. Read C integers from the user and store them in the vector.
Step 3 : Sort the positions in ascending order using the std::sort function from the library. This is done to facilitate the calculation of focus levels between adjacent rooms.
Step 4 : Use a loop to iterate through the positions vector from index 0 to C - 2. Calculate the focus level for each player as half of the distance between the adjacent rooms: focus = (position[i + 1] - position[i]) / 2.
Step 5 : Run test cases
2. Missing number in Arithmetic progression
Easy
15m average time
85% success
0/40
Asked in companies
You are given a sorted array of ‘N’ distinct integers that are in the Arithmetic Progression sequence except for one element which is missing from the sequence. You have to find that missing number from the given sequence.
Note:
1. A sequence [arr0, arr1,…, arr(n-1)] is called an Arithmetic progression if for each 'i' ( 0 ≤ i < n - 1) the value arr[i+1] − arr[i] is the same.
2. There is exactly one missing number in the given sequence.
3. All the numbers present in the sequence are distinct.
4. It is the guarantee that the first and last elements of the sequence are not missing elements.
Follow Up
The overall run time complexity should be O(log(N)).
Problem approach
Step 1 : Input the size of the array 'N' and then read the sorted array of 'N-1' distinct integers that form the arithmetic progression sequence.
Step 2 : Since the given array is in an arithmetic progression, calculate the common difference (d) using the first two elements of the array. The common difference remains constant in an arithmetic progression.
Step 3 : Use a binary search algorithm to find the missing element. Set two pointers, 'left' and 'right,' initially pointing to the first and last elements of the array, respectively.
Step 4 : Run test cases
02
Round
Easy
Face to Face
Duration30 minutes
Interview date22 Jan 2023
Coding problem2
1. Puzzle
A birthday cake has to be cut into eight equal pieces in exactly three cuts. Find a way to make this cut possible.
Problem approach
Tip 1 : Make the first cut horizontally through the center of the cake to create two equal halves.
Tip 2 : Stack the two halves on top of each other, aligning them perfectly.
Make the second cut vertically through the center of the cake to create four equal quarters.
Tip 3 : Take two of the quarters and stack them together, aligning them perfectly.
Make the third cut diagonally from one corner of the stacked quarters to the opposite corner.
2. Puzzle
A man buys Rs. 20 shares, paying 9% dividend. The man wants to have an interest of 12% on his money. The market value of each share is?
03
Round
Easy
HR Round
Duration30 minutes
Interview date29 Jan 2023
Coding problem1
1. Salary Discussion
How much Salary I was expecting?
Problem approach
Tip 1 : Before the interview, research the industry standards, average salaries for similar positions, and the company's compensation practices. This will give you a reasonable range to work with.
Tip 2 : If possible, try to delay discussing specific salary figures until you clearly understand the job requirements and responsibilities.
Tip 3 : Show willingness to consider the entire compensation package, including benefits, bonuses, and other perks.
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
Software Development
2 rounds | 4 problems
Interviewed by Netcore cloud
Rejected
872 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Netcore cloud
Rejected
759 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Netcore cloud
Rejected
765 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Netcore cloud
Rejected
1587 views
0 comments
0 upvotes