Find the element that appears once in sorted array | SDE Sheet | Hashing

In this video we will see when given a sorted array in which all elements appear twice (one after one) and one element appears only once. Find that element in O(log n) complexity. Example: Input: arr[] = {1, 1, 3, 3, 4, 5, 5, 7, 7, 8, 8} Output: 4 Check out the video to see how we implement this!! Practice Problem: https://practice.geeksforgeeks.org/problems/find-the-element-that-appears-once-in-sorted-array0624/1 Article: https://www.geeksforgeeks.org/find-the-element-that-appears-once-in-a-sorted-array/ SDE Sheet: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/