DEV Community

Abhishek Chaudhary
Abhishek Chaudhary

Posted on

1 1

Single Element in a Sorted Array

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.

Return the single element that appears only once.

Your solution must run in O(log n) time and O(1) space.

Example 1:

Input: nums = [1,1,2,3,3,4,4,8,8]
Output: 2

Example 2:

Input: nums = [3,3,7,7,10,11,11]
Output: 10

Constraints:

  • 1 <= nums.length <= 105
  • 0 <= nums[i] <= 105

SOLUTION:

class Solution:
    def singleNonDuplicate(self, arr: List[int]) -> int:
        n = len(arr)
        beg = 0
        end = n
        while beg <= end:
            mid = (beg + end) // 2
            if mid < n - 1 and arr[mid] == arr[mid + 1]:
                i = mid
                j = mid + 1
            elif mid >  0 and arr[mid] == arr[mid - 1]:
                i = mid - 1
                j = mid
            else:
                return arr[mid]
            if i % 2 == 0:
                beg = i + 1
            else:
                end = i
Enter fullscreen mode Exit fullscreen mode

Image of Datadog

Create and maintain end-to-end frontend tests

Learn best practices on creating frontend tests, testing on-premise apps, integrating tests into your CI/CD pipeline, and using Datadog’s testing tunnel.

Download The Guide

Top comments (0)

Image of Datadog

Create and maintain end-to-end frontend tests

Learn best practices on creating frontend tests, testing on-premise apps, integrating tests into your CI/CD pipeline, and using Datadog’s testing tunnel.

Download The Guide

👋 Kindness is contagious

Immerse yourself in a wealth of knowledge with this piece, supported by the inclusive DEV Community—every developer, no matter where they are in their journey, is invited to contribute to our collective wisdom.

A simple “thank you” goes a long way—express your gratitude below in the comments!

Gathering insights enriches our journey on DEV and fortifies our community ties. Did you find this article valuable? Taking a moment to thank the author can have a significant impact.

Okay