# HashedIn Interview Experience for SDE Intern+FTE (On-Campus Jan 2021)

• Difficulty Level : Medium
• Last Updated : 05 Feb, 2021

Round1 (Online coding round) : This round had 3 questions

1) Infix to post fix conversion

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

2) This question was same as level order traversal of tree, but question statement was a bit tricky.(if you are familiar with level order traversal then you can easily do it).

3) In this problem, we have to find the longest common substring of k different strings.

Eg:  for k=4,   str1= abcdabc, str2= sdbcdacb, str2= gucbcsgardsb

Output: bc

I was able to solve first two problems and third one partially.

I think there were 4 sets in this round, almost 50-60 students appeared in this round and 11(approx) were selected for the next round;

Round2 (Technical interview round 1) :

This round started with my introduction.

Interviewer gave me a question and first he explained it and then told me to proceed with it.

Given a binary matrix(n*n) consisting of 0s and 1s(not sorted), return the row number consisting of maximum no of 1s.

Input :

1 1 0 0 0

0 1 0 0 1

1 1 1 1 1

0 0 0 0 0

1 0 1 1 1

Output : 2

I gave him brut force solution O(n^2) and immediately he asked me to optimize it. The interviewer was super friendly and he gave me some hints and finally I was able to solve it in O(N logN) time.

This was the only coding question which he asked me, some of my friend we asked 3 questions also.

After this he asked me many questions on dsa:

Difference b/w linked-list and array, when to use them.

various sorting algorithm like- selection sort, insertions sort, quick sort, merge sort.

After this he asked me few questions on computer networks.

Round3 (Technical interview round 2) :

This started a bit late so interviewer just gave me 2 questions and asked to solve them.

Problem 1: Implement hash map using array.

he wanted me to implement it fully, considering collisions and I was not able to implement it.

Problem2: Rotate a 2d matrix.