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

SDE - Intern

GeeksforGeeks
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I applied for this position on their careers page. They contacted me, and my interviews were scheduled. I had three rounds of interviews and was given the offer letter at the end.
Application story
I applied on the careers page of their website. My resume was shortlisted, and I was called for an online interview. I had two technical rounds and 1 HR round, clearing which I was offered the internship.
Why selected/rejected for the role?
I was selected firstly because I could answer all the questions and secondly because of my attitude and confidence.
Preparation
Duration: 8 months
Topics: HTML,CSS,Javascript,React,DSA,C++,DBMS,OOPS,OS
Tip
Tip

Tip 1: Be thorough with your resume
Tip 2: Prepare DSA very well
Tip 3: Have decent projects

Application process
Where: Company Website
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1: Have decent projects on the resume
Tip 2: Try to add as many skills as possible

Interview rounds

01
Round
Medium
Video Call
Duration70 minutes
Interview date12 Apr 2023
Coding problem2

I had my interview in the afternoon. The interviewer was very friendly and made me feel comfortable. He asked me some generic questions like why you want to join us, etc., and then came straight to DSA.

1. Partition Equal Subset Sum

Moderate
25m average time
65% success
0/80
Asked in companies
ShareChatAdobeAmazon

You are given an array 'ARR' of 'N' positive integers. Your task is to find if we can partition the given array into two subsets such that the sum of elements in both subsets is equal.

For example, let’s say the given array is [2, 3, 3, 3, 4, 5], then the array can be partitioned as [2, 3, 5], and [3, 3, 4] with equal sum 10.

Follow Up:

Can you solve this using not more than O(S) extra space, where S is the sum of all elements of the given array?
Problem approach

First, I did the sum of all elements and checked if it was even; if odd, I returned false; else, I divided it by two and passed it in a recursive function, which checked if a subsequence exists that has a sum equal to that value. Then, I optimized it by adding 1-D DP.

Try solving now

2. Implement Deque

Easy
15m average time
85% success
0/40
Asked in companies
AdobeGoldman SachsTata Consultancy Services (TCS)

Design a data structure to implement deque of size ‘N’. It should support the following operations:

pushFront(X): Inserts an element X in the front of the deque. Returns true if the element is inserted, otherwise false.

pushRear(X): Inserts an element X in the back of the deque. Returns true if the element is inserted, otherwise false.

popFront(): Pops an element from the front of the deque. Returns -1 if the deque is empty, otherwise returns the popped element.

popRear(): Pops an element from the back of the deque. Returns -1 if the deque is empty, otherwise returns the popped element.

getFront(): Returns the first element of the deque. If the deque is empty, it returns -1.

getRear(): Returns the last element of the deque. If the deque is empty, it returns -1.

isEmpty(): Returns true if the deque is empty, otherwise false.

isFull(): Returns true if the deque is full, otherwise false.

Following types of queries denote these operations:

Type 1: for pushFront(X) operation.
Type 2: for pushRear(X) operation.
Type 3: for popFront() operation.
Type 4: for popRear() operation.
Type 5: for getFront() operation.
Type 6: for getRear() operation.
Type 7: for isEmpty() operation.
Type 8: for isFull() operation.
Try solving now
02
Round
Medium
Video Call
Duration40 minutes
Interview date15 Apr 2023
Coding problem2

This round happened immediately afterward. The interview took my intro and went straight for the questions.

1. DBMS questions

What are the ACID properties? (Learn)

What are the different types of keys? (Learn)

Explain 3-tier architecture and Belady's anomaly. (Learn)

Problem approach

Tip 1: Just be thorough with your subjects.
Tip 2: Revise them before test.

2. Sliding Maximum

Moderate
25m average time
85% success
0/80
Asked in companies
AmazonCognizantInfosys

You are given an array 'ARR' of integers of length 'N' and a positive integer 'K'. You need to find the maximum elements for each and every contiguous subarray of size K of the array.

For example
'ARR' =  [3, 4, -1, 1, 5] and 'K' = 3
Output =  [4, 4, 5]

Since the maximum element of the first subarray of length three ([3, 4, -1]) is 4, the maximum element of the second subarray of length three ([4, -1, 1]) is also 4 and the maximum element of the last subarray of length three ([-1, 1, 5]) is 5, so you need to return [4, 4, 5]. 
Try solving now
03
Round
Easy
HR Round
Duration30 minutes
Interview date20 Aug 2023
Coding problem1

The HR round was the last one. I was asked to introduce myself and directly asked basic HR questions.

1. Basic HR Questions

Why do you want to join our company?

How will you increase user retention?

Problem approach

Tip 1: Be Polite
Tip 2: Be genuine.

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by GeeksforGeeks
1429 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 6 problems
Interviewed by GeeksforGeeks
798 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 8 problems
Interviewed by GeeksforGeeks
15200 views
1 comments
0 upvotes
company logo
Intern
2 rounds | 3 problems
Interviewed by GeeksforGeeks
1201 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13919 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
13231 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9230 views
2 comments
0 upvotes