LaunchX interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
LaunchX
2 rounds | 1 Coding
problems
Selected Interview preparation journey
Application story
I applied via the Google Form provided by our college's placement cell. I filled in basic details, including my 10th and 12th percentages, graduation details, and resume.
Preparation
Duration: 0.5 month
Topics: DSA was necessary to clear the interview round. I also prepared basic system design and SQL questions.
Tip 1: Practice DSA problem sets.
Tip 2: Build projects to showcase the skills mentioned in your resume.
Tip 3: Include only those skills in your resume that you have actually worked on.
Application process
Where: Campus
Eligibility: Above 7 CGPA, (Salary Package: 7 LPA)
Tip 1: List work experience in bullet points and keep the resume concise.
Tip 2: Clearly mention your role in group projects and include individual projects in your resume.
Interview rounds
01
Round
Easy
Online Coding Test
Duration60 minutes
Interview date2 Jan 2025
Coding problem0
Quantitative Ability - 25 ques
Logical Reasoning - 15 ques
Code debugging - 15 ques
Code completion - 5 ques
English Comprehension - 15 ques
02
Round
Hard
Face to Face
Duration45 minutes
Interview date5 Jan 2025
Coding problem1
1. Split Array Largest Sum
Hard
15m average time
85% success
0/120
Asked in companies
You’re given an array 'arr' of size 'n' and an integer 'k'.
Your task is to split 'arr' into 'k' sub-arrays such that the maximum sum achieved from the 'k' subarrays formed must be the minimum possible.
A subarray is a contiguous part of the array.
Return the minimum possible value of the maximum sum obtained after splitting the array into 'k' partitions.
Example:
Input: ‘arr’ = [1, 1, 2] and ‘k’ = 2
Output: 2
Explanation: If we want to make two subarrays, there are two possibilities: [[1], [1, 2]] and [[1, 1], [2]]. We can see that the maximum sum of any subarray is minimized in the second case. Hence, the answer is 2, which is the maximum sum of any subarray in [[1, 1], [2]].
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
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
961 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15480 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15338 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10142 views
2 comments
0 upvotes