Emerson electric co. interview experience Real time questions & tips from candidates to crack your interview

Graduate Engineer Trainee

Emerson electric co.
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Linkedin
Eligibility: Above 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.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date23 Dec 2021
Coding problem2

Technical interview round with questions on DSA

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].
Problem approach

Let us start from the left of the array. We maintain an array curSum[], which keeps track of the maximum sum of the subarray ending at the index we’re at. 
While traversing the array, If the value of curSum[i] becomes negative, we can simply discard this part of the array because it has a negative contribution to the subarray sum. It would be better to just drop that part and have a zero contribution rather than a negative one. Then, we can start anew with the next element. In other words, curSum[i] can be reset to 0.
The maximum value in the curSum array will be our answer.

Try solving now

2. DS based question

Explain the stack structure and a real world example of it?

02
Round
Medium
Video Call
Duration40 minutes
Interview date27 Dec 2021
Coding problem2

Technical interview round with networking questions mainly.

1. Networking question

What is a protocol? What is UDP protocol?

2. OOPs questions

What are the Oops concept in java?

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
Automation Engineer
2 rounds | 4 problems
Interviewed by Emerson electric co.
1318 views
0 comments
0 upvotes
Software Engineer
1 rounds | 2 problems
Interviewed by Emerson electric co.
1510 views
0 comments
0 upvotes
Graduate Engineer Trainee
3 rounds | 3 problems
Interviewed by Emerson electric co.
1692 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Graduate Engineer Trainee
2 rounds | 5 problems
Interviewed by HCL Technologies
13565 views
3 comments
0 upvotes
company logo
Graduate Engineer Trainee
3 rounds | 4 problems
Interviewed by HCL Technologies
2812 views
0 comments
0 upvotes
company logo
Graduate Engineer Trainee
2 rounds | 2 problems
Interviewed by HCL Technologies
3452 views
0 comments
0 upvotes