The process was straightforward, simple and standard. Multiple problems solving round followed by system design round either by manager or sone senior folk and then HR round. They all seemed to be polite and jolly.
Interview questions [1]
Question 1
Questions related to binary search and few dp questions in problem solving round.
I applied through a recruiter. The process took 1 day. I interviewed at Moonfrog Labs (Bengaluru) in Jun 2022
Interview
They asked for a face-to-face interview on Saturday.
1st round was taken by one genuine person. he asked relevant questions.
then in 2nd round interviewer came just after smoking and asked me how I should not have any issues with it. Just imagine if a candidate comes just after smoking, how will you feel? Is this accepted? I kept looking into his mobile phone throughout the interview, If you are not interested then please don't waste other's time.
Then one more guy took the interview. he gave me one design problem and just gave me a one-liner that you need to implement this. that's it. and he started looking at his phone for the next 15 mins.
Then as soon as I came out of the room, everyone started leaving the place in front of me only.
HRs were literally laughing while telling me that They will get back to me. I felt insulted.
I have a message for the company here, being cool and showing cool are two different things.
And guys be professional and don't show attitude you are not google or Microsoft even though they treat candidates a lot better.
I applied through a recruiter. I interviewed at Moonfrog Labs (Bengaluru)
Interview
I was approached by Moonfrog Labs after being shortlisted.
Total 3 rounds of f2f interviews :
On site interview - couple of algorithm and problem solving questions. Emphasis was on writing clean compilable code which covers 100% test cases.
Last round was mostly based on conceptual knowledge of complexities of algorithms and language specific questions like callbacks in nodejs etc
Interview questions [3]
Question 1
Find a single element in array of repeating elements
A sequence is called Fibbonacci-ish if,
1. The sequence consists of at least two elements
2. f[0] and f[1] are arbitrary
3. f[n + 2] = f[n + 1] + f[n] for all n ≥ 0.
Given an array of integers, you have to rearrange the elements to find the longest possible Fibbonacci-ish sub sequence and return its length.
