Status: New grad, B.Tech in Mathematics and Computing
Prior Experience: Intern at Samsung Research Institute Bangalore
Position: Platform Engineer at Directi-Flock
Location: Bangalore, India
Date: June 29 ,2020

Round 1:

• It was a coding round held on Codechef Platform, total-3 questions and time limit was 1.5 hrs. One Question was on MST and 2 were on DP.

Round 2:

• Interview Round: 1hr
• Question: Given NxM grid and a starting and ending co-ordinates and some positions are obstacles and some have gold coins find the shortest path collecting all the gold coins.
• 1<=N,M<=1000
• 1<=num of gold coins <=15

Round 3:

• Interview Round: 1hr

• Question 1: Given a generic tree with N nodes each having a unique number and edges having alphabets and Q queries each having a number (Root has number 1) find whether the path from root to that node forms a pallindrome.

• suppose 1 - 'a' -> 2 -'b'->3 -'a'->4 (where 1 is root) so path is aba which is pallindrome. so answer should be true for Query 4: Ans-true

• 1<=N<=1e5

• 1<=Q<=1e5

• Queston 2:

• Given a game with L levels and N obstacles and each level having some obstacles, clearing a level gives you a score of 2^(number of new obstacles encountered). Find minimum scores a player can gain after completing all the levels. Player can select any level at any time no specific order to be followed. (Each unique obstacle has to be cleared once)

• for eg L=3, N=5,
  Level 1: 1,2
  Level 2: 3,4,5
  Level 3: 1,3,5

• Minimum score : Output : 10

• Explanations- level -1 score = 2^2=4 ---> level 3 score = 4+2^2= 8 --> level-2 score =8 + 2^1= 10 - End

• Only new obstacles encountered will contribute to scores.

Round 4:

• Interview Round: Cs fundamentals

• Very light round with Senior Professional .

• Basic C++ question

• Operating System questions

• DBMS questions on Indexing and B and B+ Trees

• Discussion about my Internship project

• Followed by the Description of the Front-end Role and product Description .

Got the offer after 3 days of my last Interview .