SDE - Intern
2 rounds | 4 Coding problems
119 views
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Regarding DSA preparation, I have a theory. 20 percent of the questions will be asked in 80 percent of the interview and 80 percent of the questions will be asked in 20 percent of the interviews. In short, some questions have a very high chance of coming up during the interviews and some have very low chance. We should focus more on the questions that have more chance of coming up in the interview. You can find these questions on Striver SDE Sheet, InterviewBit, Leetcode 100 most liked, Leetcode 100 most important.
Tip 2 : Try to find patterns in the questions. Group them according to a pattern for better understanding. Make notes in Excel, word or hand written and revise them.
Tip 3 : Try to solve the questions that have more chance of coming up in the interview with many different approaches.

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

Tip 1 : Make Sure that your resume is simple and also try to fit all the information in only one page.
Tip 2 : Have at least 2 projects with the latest technologies,Github link of projects should be provided

Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date14 Aug 2021
Problems2
Overlapping Intervals

#### You have been given the start and end times of 'N' intervals. Write a function to check if any two intervals overlap with each other.

##### Note :
view more
Problem approach

Check if any two intervals overlap among a given set of intervals. An interval is given in form of start and end time. Given a set of intervals, check if any two intervals overlap or not.

Implementation: Hashmap

#### Design a data structure that stores a mapping of a key to a given value and supports the following operations in constant time.

``1. INSERT(key, value): I...``
view more
Problem approach

Implement the data structure which takes constant time for insertion, deletion and find operations.

02
Round
Easy
Video Call
Duration45 minutes
Interview date14 Aug 2021
Problems2
Water Droplet Mixing
view more
Problem approach

Consider a pipe of length L. The pipe has N water droplets at N different positions within it. Each water droplet is moving towards the end of the pipe(x=L) at different rates.

When a water droplet mixes with another water droplet, it assumes the speed of the water droplet it is mixing with. Determine the no of droplets that come out of the end of the pipe.

Find Duplicate

#### You have been given an integer array/list(ARR) of s...

view more
Problem approach

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ranging from 0 to 3 and among these, there is a single integer value that is present twice. You need to find and return that duplicate number present in the array.

Start a Discussion
Similar interview experiences
Software Quality Engineer
6 rounds | 19 problems
431 views
Member of Technical Staff
3 rounds | 10 problems
279 views
Technical Consultant Intern
2 rounds | 2 problems
102 views
SDE - 1
3 rounds | 6 problems
60 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16839 views