LaunchED Global interview experience Real time questions & tips from candidates to crack your interview
Associate Software Developer
LaunchED Global
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
My journey toward becoming an Associate Software Developer began with mastering the fundamentals of web development—HTML, CSS, and JavaScript—which laid a strong foundation for building responsive and user-friendly web applications. To expand my expertise, I explored frameworks like React and Node.js, which enabled me to develop robust full-stack applications. Among my notable projects are QuizMaster, a platform for creating and sharing quizzes, and an e-commerce app featuring efficient cart management and smooth navigation.
In addition to web development, I ventured into data science and artificial intelligence, contributing to projects like Brain Tumor Detection using CNNs and Credit Card Fraud Detection with XGBoost. These experiences enhanced my understanding of integrating machine learning models with software systems to solve real-world problems.
My professional growth has been shaped by hands-on experience through platforms like GitHub and internships. A research internship at MAIT allowed me to delve into cutting-edge AI solutions, achieving significant accuracy improvements in MRI-based tumor detection. At Cantilever, I honed my software development and problem-solving skills by building scalable applications and analyzing complex datasets.
Preparing for roles as an Associate Software Developer, I focused on core concepts such as data structures, algorithms, and design patterns, while continuously practicing coding challenges and refining my technical skills. This journey has instilled a strong commitment to consistency, innovation, and collaboration, driving my passion for developing high-quality, scalable software solutions.
Application story
The Launch ED on-campus recruitment process was a valuable learning experience. It began with an online test assessing aptitude and technical skills, followed by a technical interview that allowed me to discuss my technical knowledge and problem-solving abilities. This journey enhanced my confidence and prepared me for future opportunities.
Why selected/rejected for the role?
From my perspective, the rejection after the interview may have also been influenced by my preference not to relocate to Bangalore, where the position was based. While I showcased my technical knowledge and experiences during the process, I realized that accepting an offer that required relocation to a city I wasn’t fully ready to move to wouldn’t align with my personal priorities. Regardless, the experience was a valuable learning opportunity, helping me refine my approach and better prepare for roles that align with both my skills and location preferences.
Preparation
Duration: 1 month
Topics: Arrays, Strings, Linked List, Trees, Hashmaps, OOPS, Dynamic Programming
Tip 1: Practice BFS, DFS, and shortest path techniques like Dijkstra's and A* for solving connectivity and optimization problems.
Tip 2: Learn scalable architecture principles like caching, load balancing, and database sharding.
Tip 3: Break problems into reusable functions or classes for better readability, maintainability, and testing.
Application process
Where: Campus
Eligibility: Above 7.5 CGPA, (Salary Package: 5 LPA)
Tip 1: Add factual information about the projects you’ve made.
Tip 2: State only the skills you possess, not the ones you don’t.
Interview rounds
01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date20 Dec 2024
Coding problem2
1. Maximum Difference
Hard
40m average time
50% success
0/120
Asked in companies
You are given an integer array ‘arr’ of size ‘N’. Your task is to find the maximum difference between two consecutive elements in the sorted form of the array ‘arr’.
If the ‘arr’ contains less than two elements, return 0.
For example:
You are given arr = {1, 3, 8, 6, 7}, then our answer will be 3.
Sorted form of arr = {1, 3, 6, 7, 8}. The maximum absolute difference between two consecutive elements is 6 - 3 = 3, which is the correct answer.
Problem approach
Array: [2, 3, 10, 6, 4, 8, 1]
Start with min_element = 2 (first element) and max_difference = -1.
Compare the next element (3) with min_element. The difference is 3 - 2 = 1. Update max_difference = 1.
Next, compare 10 with min_element. The difference is 10 - 2 = 8. Update max_difference = 8.
Continue with 6, 4, and 8. None of these update min_element, and their differences do not exceed max_difference.
Lastly, 1 becomes the new min_element, but since it's the last element, no further updates occur.
Final Result: The maximum difference is 8.
2. First Missing Positive
Moderate
18m average time
84% success
0/80
Asked in companies
You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.
For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.
Problem approach
Array: [3, 4, -1, 1]
Segregate positive numbers from negatives by swapping. After segregation: [3, 4, 1, -1].
Use index marking to identify present numbers.
Mark the index corresponding to each positive number. For 3, mark index 2 (array[2] = -array[2]). Array becomes [3, 4, -1, -1].
Mark for 4 (out of bounds, skip). Mark for 1: array[0] = -array[0]. Array becomes [-3, 4, -1, -1].
Traverse the array to find the first missing positive.
Index 0 is negative, so 1 is present. Index 1 is positive, indicating 2 is missing.
Final Result: The smallest missing positive integer is 2.
02
Round
Medium
Video Call
Duration10 minutes
Interview date4 Jan 2025
Coding problem1
1. Combination Sum
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array 'ARR' of 'N' distinct positive integers. You are also given a non-negative integer 'B'.
Your task is to return all unique combinations in the array whose sum equals 'B'. A number can be chosen any number of times from the array 'ARR'.
Elements in each combination must be in non-decreasing order.
For example:
Let the array 'ARR' be [1, 2, 3] and 'B' = 5. Then all possible valid combinations are-
(1, 1, 1, 1, 1)
(1, 1, 1, 2)
(1, 1, 3)
(1, 2, 2)
(2, 3)
Problem approach
Array: [1, 2, 2, 3, 4, 4]
Steps:
Create an empty set unique_elements.
Iterate through the array:
Add 1 to the set → unique_elements = {1}.
Add 2 to the set → unique_elements = {1, 2}.
Skip duplicate 2.
Add 3 to the set → unique_elements = {1, 2, 3}.
Add 4 to the set → unique_elements = {1, 2, 3, 4}.
Skip duplicate 4.
Calculate the sum of unique_elements: 1 + 2 + 3 + 4 = 10.
Final Result: The sum of unique elements is 10.
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 - 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
Associate Software Developer
2 rounds | 4 problems
Interviewed by LaunchED Global
Rejected
388 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Developer
5 rounds | 10 problems
Interviewed by SAP Labs
Selected 1202 views
0 comments
0 upvotes
Associate Software Developer
3 rounds | 3 problems
Interviewed by SAP Labs
Selected 788 views
0 comments
0 upvotes
Associate Software Developer
3 rounds | 7 problems
Interviewed by CIS - Cyber Infrastructure
Selected 578 views
0 comments
0 upvotes