✅💯🔥Simple Code🚀📌|| 🔥✔️Easy to understand🎯 || 🎓🧠Beats 100%🔥|| Beginner friendly💀💯
Solution tuntun mosi ki photo ke baad hai. Scroll Down\n\n# Code\njava []\nclass Solution {\n    public int singleNonDuplicate(int[] nums) {\n        int i=0; i
Solution tuntun mosi ki photo ke baad hai. Scroll Down\n![fd9d3417-20fb-4e19-98fa-3dd39eeedf43_1723794694.932518.png](https://assets.leetcode.com/users/images/a492c0ef-bde0-4447-81e6-2ded326cd877_1724187540.6168394.png)\n# Code\n```java []\nclass Solution {\n    public int singleNonDuplicate(int[] nums) {\n        int i=0; int j=nums.length-1;\n        while(i<j){\n            int mid=i+(j-i)/2;\n            if(mid%2==1){\n                mid--;\n            }\n            if(nums[mid]==nums[mid+1]){\n                i=mid+2;\n            }else{\n                j=mid;\n            }\n        }\n        return nums[i];\n    }\n}\n```\n![7be995b4-0cf4-4fa3-b48b-8086738ea4ba_1699897744.9062278.jpeg](https://assets.leetcode.com/users/images/fe5117c9-43b1-4ec8-8979-20c4c7f78d98_1721303757.4674635.jpeg)
['Array', 'Binary Search', 'C', 'Python', 'C++', 'Java', 'JavaScript']