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

SDE - 1

Launch IT
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
In the lockdown period, I started my journey to where I am today. When the first lockdown prevailed I started to learn DSA, and I think that was the best time to learn DSA because no pressure from college was there for its useless assignments and all. In the lockdown of around 6 months, I learnt the basic algorithms and at the end I started practising on leetcode and codechef like platforms, they helped me a lot during my journey.
Application story
I was practising DSA on a regular day when I saw a small advertisement kind of on leetcode. I opened it and I got to find that company is looking for some fresher graduates to serve as SDE-1. I applied to it and after three rounds, I was selected.
Why selected/rejected for the role?
I think I had the appropriate skills and a good amount of knowledge to prove that I was the right man for the post. I also solved coding questions in the optimal manner.
Preparation
Duration: 4 months
Topics: Computer Networks, Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

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

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date2 Jul 2022
Coding problem2

1. Best Time to Buy and Sell Stock

Moderate
20m average time
80% success
0/80
Asked in companies
IntuitOptumOYO

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.
For Example:
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Try solving now

2. Wildcard Pattern Matching

Hard
50m average time
30% success
0/120
Asked in companies
FreshworksWalmartSamsung R&D Institute

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.

The wildcard pattern can include the characters ‘?’ and ‘*’

 ‘?’ – matches any single character 
 ‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Try solving now
02
Round
Medium
Online Coding Test
Duration60 minutes
Interview date15 Jul 2022
Coding problem2

1. N Queens

Hard
55m average time
35% success
0/120
Asked in companies
Thought WorksTwitterAdobe

You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Try solving now

2. Clone Graph

Moderate
25m average time
75% success
0/80
Asked in companies
MicrosoftGrabUber

You are given a reference/address of a node in a connected undirected graph containing N nodes and M edges. You are supposed to return a clone of the given graph which is nothing but a deep copy. Each node in the graph contains an integer “data” and an array/list of its neighbours.

The structure of the graphNode class is as follows:

class graphNode 
{  
    public:
        int data;
        vector<graphNode*> neighbours;
}
Note :
1. Nodes are numbered from 1 to N.

2. Your solution will run on multiple test cases. If you are using global variables make sure to clear them.
Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date25 Jul 2022
Coding problem1

1. Basic HR Questions

Introduce yourself.
Why do you want to join us?
What are your hobbies?
What do you think makes you a better choice than the other candidates?
What are your strengths and weaknesses?
Are you willing to relocate?
What do you know about the work culture here in our organization?

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 | 5 problems
Interviewed by Launch IT
644 views
0 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Launch IT
605 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Launch IT
726 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Launch IT
615 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114578 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
34960 views
7 comments
0 upvotes