codejeet
Blog
Tracker
System Design
Home
/
Companies
/
Tekion
/
Binary Search
Tekion Binary Search Questions
6 binary search problems asked at Tekion interviews
Medium (5)
Hard (1)
Questions
Title
Difficulty
Acceptance
Frequency
Split Array Largest Sum
Hard
59.9%
70.5%
Shortest Subarray to be Removed to Make Array Sorted
Medium
51.3%
60.5%
Ways to Split Array Into Three Subarrays
Medium
34.2%
60.5%
Find First and Last Position of Element in Sorted Array
Medium
48.4%
60.5%
Subarray Product Less Than K
Medium
53.9%
60.5%
Max Consecutive Ones III
Medium
67.3%
60.5%
Showing 6 questions
All Tekion Questions
All Binary Search Questions