Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
LinkedIn interview experience Real time questions & tips from candidates to crack your interview

# SDE - Intern

2 rounds | 2 Coding problems

## Interview preparation journey

Preparation
Duration: 2.5 months
Topics: Data Structures, Pointers, OOPS, Algorithms, Dynamic Programming, DBMS
Tip

Tip 1 : Practice an ample amount of questions from online sites like GeeksforGeeks and HackkerRank on all major topics. Once you are done with topicwise preparation, go on and try out some timed tests too.
Tip 2 : Don't forget to revise OOPS, OS, DBMS too.
Tip 3 : Try out mock interviews with friends, that's the best thing you can do for yourself other than practising questions!!
Tip 4 : During the interview, one thing that is asked for sure is the time complexity of your solution, so always know the complexity of your algorithms.

Application process
Where: Campus
Eligibility: Above 70%
Resume tip

Tip 1 : Have your projects clearly mentioned and well explained
Tip 2 : Make sure that there are no formatting errors
Tip 3 : Mention your LinkedIn profile ;)

## Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date5 Aug 2019
Coding problem0

The test was taken during morning time within the college campus itself. There was proper invigilation done by the college TnP cell. Many students from the college sat for the test.

02
Round
Medium
Video Call
Duration60 minutes
Interview date6 Aug 2019
Coding problem2

6 students from the campus were selected for this round. The interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.

Moderate
35m average time
65% success
0/80

View more

### 2. Median of two sorted arrays

Hard
25m average time
65% success
0/120

#### Find the median of the two sorted arrays.

View more
Problem approach

Step 1 : Tried out a few test cases on my own and checked for the output.
Step 2 : Using the linear approach, merged the sorted arrays by iterating over both of them and finding the mid point of the sorted and merged array.
Note: The time complexity for this solution was O(m+n) This wasn't the most optimised solution, a better solution can be given which solves the question in O(log m+log...

View more

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the result of 4 % 2?

Start a Discussion
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
2727 views
SDE - Intern
2 rounds | 5 problems
0 views
SDE - Intern
2 rounds | 4 problems
647 views
SDE - Intern
2 rounds | 6 problems
823 views
Companies with similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3057 views