Skip to content
Related Articles

Related Articles

Turvo Interview Experience for Associate Software Engineer

View Discussion
Improve Article
Save Article
  • Last Updated : 18 May, 2021
View Discussion
Improve Article
Save Article

Written Test: It is a hackerrank based written test.

  1. They have given an array and asked to sort based on a specific condition. We need to slightly modify the partition method of a quick sort and implement the solution
  2. It is a slight variation of the standard LCS problem

Round 1:

  1. Given a binary tree and a sum x. Find whether any two elements belonging to a different level in a binary tree adds to the given sum x.
  2. Find the next greater element in array.

Round 2:

  1. Find the number of distinct islands in a matrix.
  2. Clone a binary tree that has left, right and random pointer in each node.
  3. LRU cache implementation.

Status: selected

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!