GE Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Easy

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

Q1. 
Maximize Sum from Array
Given an integer array ARR of size N, your objective is to perform a series of operations to maximize the sum of selected elements from the array. During each operation, you should...read more
Ans. 
Maximize sum by selecting elements from array and removing adjacent elements.
• Select element 'i' and remove 'i-1' and 'i+1' from array during each operation.

• Continue until array is empty to maximize sum of selected elements.

• Focus on maximizing sum rather than printing results.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

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

Q1. 
Queue Using Stack Problem Statement
Implement a queue data structure that follows the FIFO (First In First Out) property, using only instances of the stack data structure.
Note:
• Complete predefined f...read more
Ans. 
Implement a queue using only stack data structure with predefined functions for FIFO operations.
• Use two stacks to simulate a queue - one for enqueue and one for dequeue operations.

• For enQueue operation, push elements onto the enqueue stack.

• For deQueue operation, if the dequeue stack is empty, transfer elements from enqueue stack to dequeue stack.

• For peek operation, return the top element of the dequeue stack.

• For isEmpt...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

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

Q1. Can you provide details about your project and explain its overall functionality?
Add your answer

Round duration - 15 minutes
Round difficulty - Easy