Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
GE (General Electric) interview experience Real time questions & tips from candidates to crack your interview

Digital Technology Intern

GE (General Electric)
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, Dynamic Programming, Operating Systems, OOPS, DBMS, SQL
Tip
Tip

Tip 1 : Practice Strings, Arrays, Dynamic Programming for coding test
Tip 2 : Practice Data Structures, OOPS, SQL for interviews

Tip 3 : Practice questions from Codezen, GFG and Leetcode on a daily basis.
 

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

Tip 1:Mention only genuine things in the resume
Tip 2:Be ready for questioning for the skills and projects you have mentioned in resume.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date1 Sep 2020
Coding problem1

Round 1 was a coding round consisting of 3 easy questions.

1. Maximize the sum of selected numbers from an array to make it empty.

Moderate
35m average time
70% success
0/80
Asked in companies
CognizantArcesiumPaytm (One97 Communications Limited)

You are given an array “ARR” of N integers. You are required to perform an operation on the array each time until it becomes empty. The operation is to select an element from the array(let’s say at ith index i.e ARR[i]) and remove one occurrence of the selected element from the array and remove all the occurrences of (ARR[i]-1) and (ARR[i]+1) from the array(if present). Your task is to maximize the sum of selected elements from the array.

For example, let’s say the given array is [2, 3, 3, 3, 4, 5].

The maximum possible sum for the given array would be 14. Because if we select one of the 3’s from the array, then one 3 and all occurrences of (3-1) and (3+1) i.e 2 and 4 will be deleted from the array. Now we left with {3,3,5} elements in the array. Then again we select 3 in the next two steps and in both steps 3 will be deleted also (3-1) and (3+1) doesn't exist in the array so nothing extra to delete in both steps. Now we left with only {5} and in the next step, we select the 5 and delete it. Then the array becomes empty. Thus the sum of selected elements will be 3+3+3+5 = 14.

Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date6 Sep 2020
Coding problem1

Interviewer asked every a number of question from OOPS and data structures.

1. Queue using stack.

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

Implement a queue data structure which follows FIFO(First In First Out) property, using only the instances of the stack data structure.


Note:
1. To implement means you need to complete some predefined functions, which are supported by a normal queue such that it can efficiently handle the given input queries which are defined below.


2. The implemented queue must support the following operations of a normal queue: 

a. enQueue(data) : This function should take one argument of type integer and place the integer to the back of the queue.

b. deQueue(): This function should remove an integer from the front of the queue and also return that integer. If the queue is empty, it should return -1.

c. peek(): This function returns the element present in the front of the queue. If the queue is empty, it should return -1.

d. isEmpty(): This function should return true if the queue is empty and false otherwise.


3. You will be given q queries of 4 types:

a. 1 val - For this type of query, you need to insert the integer val to the back of the queue.

b. 2 - For this type of query, you need to remove the element from the front of the queue, and also return it.

c. 3 - For this type of query, you need to return the element present at the front of the queue(No need to remove it from the queue).

d. 4 - For this type of query, you need to return true if the queue is empty and false otherwise.


4. For every query of type:

a. 1, you do not need to return anything.

b. 2, return the integer being deQueued from the queue.

c. 3, return the integer present in the front of the queue.

d. 4, return “true” if the queue is empty, “false” otherwise.
Example
Operations: 
1 5
1 10
2
3
4

Enqueue operation 1 5: We insert 5 at the back of the queue.
Queue: [5]

Enqueue operation 1 10: We insert 10 at the back of the queue.
Queue: [5, 10]

Dequeue operation 2: We remove the element from the front of the queue, which is 5, and print it.
Output: 5
Queue: [10]

Peek operation 3: We return the element present at the front of the queue, which is 10, without removing it.
Output: 10
Queue: [10]

IsEmpty operation 4: We check if the queue is empty.
Output: False
Queue: [10]
Try solving now
03
Round
Easy
Face to Face
Duration30 minutes
Interview date6 Sep 2020
Coding problem1

He asked me about my projects and extra-curriculars that I have done in college.

1. Project Questions

He asked me about my project details and overall functionality of my projects.

04
Round
Easy
Face to Face
Duration15 minutes
Interview date7 Sep 2020
Coding problem1

1. HR Round

She asked me about latest technology, about the company, general HR questions.

Here's your problem of the day

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

Skill covered: Programming

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice
Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 6 problems
Interviewed by GE (General Electric)
1582 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 11 problems
Interviewed by GE (General Electric)
547 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
457 views
0 comments
0 upvotes
company logo
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
258 views
0 comments
0 upvotes