Ho presentato la mia candidatura online. La procedura ha richiesto 5 giorni. Ho sostenuto un colloquio presso InterviewVector (Meerut) nel mese di ago 2022
Colloquio
first we had a discussion about all previous projects and after that we started coding round .
All the interview questions were average and write a code with minimum time complexity .
Binary search tree
Domande di colloquio [1]
Domanda 1
Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [1,3,5,6], target = 5
Output: 2
