Gradeup (Gradestack Learning Pvt Ltd) interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Gradeup (Gradestack Learning Pvt Ltd)
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data structure, Pointers, OOPS ,MySQL, Dynamic Programming
Tip
Tip

Tip 1 : Practice at least 450 coding questions of mid-level difficulty 
Tip 2 : Work more on practicals and explanation of code

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

Tip 1 : Mention all the skills which you have according to the requirement of the job
Tip 2 : Focus more on the project and extracurricular activities

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date20 Aug 2021
Coding problem1

1. Count Inversions

Moderate
40m average time
55% success
0/80
Asked in companies
MicrosoftAdobeSamsung R&D Institute

Inversion count in array

Problem approach

Tip 1 : Practice array
Tip 2 : Data structure command 

Try solving now
02
Round
Hard
Online Coding Interview
Duration90 minutes
Interview date30 Aug 2022
Coding problem1

Slot based round with different set of question in each round this round had mcq based on SQL

1. Total area of overlapping rectangles

Easy
10m average time
90% success
0/40
Asked in companies
QualcommMicrosoftSAP Labs

It may be assumed that the rectangles are parallel to the coordinate axis.

Problem approach

Tip 1 : C++ made it easy for me as I simply used doOverlap
Tip 2 : Follow online tutorials

Try solving now
03
Round
Hard
Video Call
Duration70 minutes
Interview date2 Sep 2022
Coding problem1

It was on call interview in which the camera was on. It started with a basic introduction first his than mine and later he discussed projects of my resume and then gave me the problem

1. Combination Sum

Hard
45m average time
55% success
0/120
Asked in companies
SalesforceMorgan StanleyAmazon

Given a number k, find all the possible combinations of k-bit numbers with n-bits set where 1 <= n <= k. The solution should print all numbers with one set bit first, followed by numbers with two bits set,.. up to the numbers whose all k-bits are set. If two numbers have the same number of set bits, then smaller number should come first.

Problem approach

Tip 1 : Focus on Dynamic programming 
Tip 2 : Be confident 
Tip 3 : Practice at least 100 questions

Try solving now

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
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by Gradeup (Gradestack Learning Pvt Ltd)
481 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 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
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes