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

SDE - 1

Netcore cloud
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I was admitted to DTU college in the computer science stream. I was advised by my seniors to practice DSA from the very start of B.Tech, and I did not take that seriously. Honestly speaking, I regretted not taking their advice and in the third year I started coding, and I had to increase practice hours because I started late.
Application story
I applied for the post through the campus drive. After applying, I practiced hard for it, and the hard work paid off in the end.
Why selected/rejected for the role?
I think I was on point with my coding solutions to the questions asked in the interviews. I was not able to provide the optimal solutions, but I did give correct explanations for some theory questions that were asked.
Preparation
Duration: 8 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Even if you are stuck in the problem, just give a try. The interviewer will help you definitely for sure.
Tip 2 : Prepare Data Structures and Algorithms well. They mostly check our Problem-Solving ability to find the solutions for the real-world problems.
Tip 3 : Be enough confident, don't be nervous. Maintain at least 2 projects in your resume

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

Tip 1: Mention at Least 2 Projects
When discussing your experience, make sure to highlight at least two significant projects that showcase your skills and accomplishments. Describe your role, the problem you solved, the technologies used, and the impact of the projects.

Tip 2: Highlight Your Proficient Skills
I excel in several key areas, including:

  • Natural Language Processing (NLP): With my strong foundation in NLP techniques, I can develop applications for sentiment analysis, text generation, language translation, and more.
  • Data Analysis and Visualization: I'm proficient in using Python libraries like Pandas, Matplotlib, and Seaborn to extract insights from data and create informative visualizations.

Tip 3: Concise, Yet Comprehensive
Strike a balance between brevity and comprehensiveness. Your description should provide enough detail to showcase your skills and experience while remaining concise.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date9 Feb 2023
Coding problem2

This was technical mcq round in which mostly questions were on computer networking also of basic electrical and electronics questions.

1. Anagram Pairs

Moderate
30m average time
60% success
0/80
Asked in companies
NearbuyAppleAmerican Express

You are given two strings 'str1' and 'str1'.


You have to tell whether these strings form an anagram pair or not.


The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'
Note:
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 
Problem approach

You are given two strings 'str1' and 'str1'.
You have to tell whether these strings form an anagram pair or not.
The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Try solving now

2. Reverse Stack Using Recursion

Easy
21m average time
80% success
0/40
Asked in companies
AmazonNoBrokerIBM

Reverse a given stack of 'N' integers using recursion. You are required to make changes in the input parameter itself.


Note: You are not allowed to use any extra space other than the internal stack space used due to recursion.


Example:
Input: [1,2,3,4,5] 
Output: [5,4,3,2,1]

add image

Problem approach

Reverse a given stack of N integers using recursion. You are required to make changes in the input parameter itself.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date10 Feb 2023
Coding problem2

1. Leftmost and rightmost nodes in a binary tree

Easy
20m average time
80% success
0/40
Asked in companies
SAP LabsGrabDisney + Hotstar

You are given an arbitrary binary tree with N nodes, whose nodes have their values in the range of integers. You have to print the values of leftmost and rightmost nodes at each level of the given tree. In other words, for every level in the given tree, print the values of corner nodes.

Two nodes are said to be at the same level if they are at the same distance from the root node.

Note:

1. For all such levels where there is only one corner node the leftmost and the rightmost nodes are the same.
2. In the output, you have to print the leftmost and rightmost values in level order fashion i.e, the leftmost node of level1 followed by the rightmost node of level1 followed by the leftmost node of level2 followed by the rightmost node of level2 and so on.
Problem approach

You are given an arbitrary binary tree with N nodes, whose nodes have their values in the range of integers. You have to print the values of leftmost and rightmost nodes at each level of the given tree. In other words, for every level in the given tree, print the values of corner nodes.

Try solving now

2. Detect And Remove Cycle

Easy
10m average time
90% success
0/40
Asked in companies
WalmartOracleGoldman Sachs

You have been given a Singly Linked List of integers, determine if it forms a cycle or not. If there is a cycle, remove the cycle and return the list.

A cycle occurs when a node's ‘next’ points back to a previous node in the list.

Problem approach

You have been given a Singly Linked List of integers, determine if it forms a cycle or not. If there is a cycle, remove the cycle and return the list.

Try solving now
03
Round
Easy
Video Call
Duration60 minutes
Interview date11 Feb 2023
Coding problem2

1. Next Greater Element

Easy
10m average time
90% success
0/40
Asked in companies
IBMInfo Edge India (Naukri.com)Amazon

You are given an array 'a' of size 'n'.



The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.


If no greater elements exist to the right of 'x', consider the next greater element as -1.


For example:
Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.
Problem approach

For each element, find the next greater element to the rightmost index.

Try solving now

2. OS Questions

What is a real-time system? (Learn)
What is the advantage of a multiprocessor system? (Learn)

Problem approach

Tip 1 : Basic OS.
Tip 2 : Fluent English.
Tip 3 : Basic ECE knowledge.

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 | 6 problems
Interviewed by Netcore cloud
970 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Netcore cloud
760 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Netcore cloud
766 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Netcore cloud
1587 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes