Meesho Interview Experience for SDE-1 (On-Campus)

Round 1(Online Assessment): 3 coding questions 1 ez + 1 medium + 1 hard . And 10 mcqs on computer core concepts (+3 -3) .

• Question 1:- Was an easy array manipulation Question.
• Question 2:- similar to this question:- https://www.geeksforgeeks.org/max-sum-of-m-non-overlapping-subarrays-of-size-k/
• Question 3:- httSimilarps://leetcode.com/discuss/interview-question/124943/dynamic-programming/125712

28 people got shortlisted.

Round 2(Technical): 2 coding questions hackerrank code pair.

• Q1. Extension of number of islands .
• Q2. Given n. Return the number of possible arrays of size n having values in the range 1-n. Where each element in the array follows at least one of the 2 rules. Rule 1 :- arr[idx] is divisible by index . Rule 2 :- index is divisible by num[idx] .

I did both the questions.

Round 3(Technical + HR): Questions on computer networks, DBMS, deep discussion in some of the topics. He simply wanted to pass time with me .

Verdict: Got selected I was the only one selected