Juspay Technologies Junior Software Engineer Trainee Interview Questions and Answers

First round 1.1 assessment test consist of total 30 questions in 30 minutes. Apti, technical questions, code snippet related questions.

Q1. There was a question related to array topic in which you have arrrange the no. In ascending order.
Add your answer
Q2. Find the time complexity of binary search of given numbers
Ans. 
Binary search has a time complexity of O(log n) where n is the number of elements in the array.
• Time complexity is O(log n) as it divides the array in half at each step

• Best case is O(1) when the element is found at the middle of the array

• Worst case is O(log n) when the element is not present in the array
Answered by AI
Add your answer