Find the Single Element in a Sorted Array
You are given a sorted array where every element appears exactly twice, except for one element which appears only once.
Your task is to find and return the element that appears only once.
You must write an efficient solution with O(log n) time complexity and O(1) space complexity.
Example
Input: [1, 1, 2, 2, 3, 4, 4] Output: 3 Input: [1, 1, 2] Output: 2 Input: [7] Output: 7
Companies:
Solve Similar questions 🔥
Want to upskill? Explore our courses!
Namaste AI
Learn to build modern AI applications with real-world projects.
Namaste DSA
Master DSA from scratch with numerous problems, and expert guidance.
Namaste React
Wanna dive deep into React and become Frontend Expert? Learn with me now!
Namaste Frontend System Design
The most comprehensive and detailed course for frontend system design.
Namaste Node.js
Wanna dive deep into Node.js? Enroll into `Namaste Node.js` now!