Problem Submissions Solution

Search Insert Position

Difficulty: Easy

Acceptance: %

Points: 20.00

You are given a sorted array arr[] of distinct integers in non-decreasing order and an integer k, return true if k is present in the array, otherwise false.

Note: If multiple occurrences are there, please return the smallest index.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(log n)

Expected Auxiliary Space: O(log n)

Constraints:
  • 1 <= arr.size() <= 10^5
  • 1 <= arr[i] <= 10^6
  • 1 <= k <= 10^6
Companies:
Oracle TCS Accenture Infosys Cognizant + 1 more
Topics:
Array Sorting Algorithms
Locked Content
Access Restricted: Please Login to access the code editor and test cases.