Turvo Interview Experience for ASE (Off-Campus)

Online Test Assessment 

Hackerrank coding test need to solve 2 out of 3 questions to qualify.

Round 1: (1 hour)

• Can Place Flowers
• Longest Common Prefix using Trie

Round 2 (1 hour)

Basic discussion about the project and your role in the current company, OOPS concept, etc.

• The K Weakest Rows in a Matrix
•  You have given a consecutive difference array of length n-1 you need to find out the original array which is the permutation of the first n natural number

Input 
let say = 4
[-1,-1,-1,-1] equilvalent to  [A2-A1,A3-A2,A4-A3] 
Output:
[5,4,3,2,1]

Need to solve in O(N) time complexity 

first I provided him O(N^2) time complexity approach then tried reduced time complexity till then time was up.

Round 3. (Leadership Round) (45 minutes)

This interview was with the Director of Engineering of Turvo Ramakanth M S he was just asking about projects and other basic leadership questions why you want to switch etc.

Only went 30 minutes as he already told me it will not be a long discussion.

Verdict – Rejected 

Suggestion: Just provide them a directly optimized approach 25-30 minutes will just be of projects discussion and some other basic related tech stack questions and you need to solve 2 DSA questions in under 30 minutes.