Single element in a sorted array | Leetcode #540

This video explains a very important programming interview  question which is to find the unique element in a sorted array in just O(logN) time and O(1) extra space. This problem would have been extremely easy to solve provided we were allowed O(N) time. This can be solved by simple linear search  or XOR operation. In order to take benefit of sorted array property, we can use binary search algorithm  with some observations to find the unique element in just O(logN). I have shown 4 observations and used them to solve the problem in O(logN) time using binary search algorithm.At the end of the video, i have explained the CODE. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)


CODE LINK: https://gist.github.com/SuryaPratapK/...

• #education
• #programming_interview_questions
• #coding_interview_questions
• #programming_tutorials
• #computer_science
• #codeforces
• #geeksforgeeks
• #information_technology
• #programming
• #single_element_in_a_sorted_array
• #leetcode_540
• #unique_element_in_array
• #binary_search
• #day_12
• #leetcode_may_challenge
• #log_n
• #sorted_array
• #search_element
• #searching_algorithm
• #binary_search_interview_question
• #leetcode_interview_question
• #leetcode_solution
• #array_interview_question
• #tech_dose