Skip to main content

May-12 2020 Challenge

leetcode leetcode may challenge leetcode premium leetcode premium for free leetcode problems leetcode 200 leetcode dynamic programming leetcode login leetcode array leetcode amazon leetcode anagrams leetcode app leetcode api leetcode april challenge leetcode asteroid collision leetcode atoi leetcode binary search leetcode backtracking leetcode burst balloons leetcode bfs leetcode biweekly contest leetcode bst leetcode binary tree camera leetcode bipartite graph
leetcode contest leetcode course schedule leetcode coin change leetcode company wise questions leetcode counting bits leetcode container with most water leetcode 
12. 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. Find this single element that appears only once.

Example 1:
Input: [1,1,2,3,3,4,4,8,8]
Output: 2
Example 2:
Input: [3,3,7,7,10,11,11]
Output: 10

Note: Your solution should run in O(log n) time and O(1) space.                                                      Solution in C++:
                  

class Solution {

public:
    int singleNonDuplicate(vector<int>& nums) {
 int ans = 0;
 for(int i = 0;i < nums.size(); i++)ans ^= nums[i];
      return ans;
    }};

Leetcode day 12
leetcode funding leetcode free premium leetcode friend circle leetcode graph leetcode google leetcode group anagrams leetcode github leetcode google interview questions lis 
leetcode google interview leetcode greedy leetcode gas station leetcode house robber leetcode happy number leetcode hashmap leetcode help center leetcode heap leetcode hard problems leetcode history
leetcode happy number solution leetcode ide leetcode interview questions leetcode internship leetcode island perimeter leetcode india leetcode intersection of two linked lists leetcode implement trie leetcode interview experience leetcode java leetcode javascript leetcode jump game leetcode java solutions leetcode jump game ii leetcode javascript solutions leetcode java questions leetcode jobs leetcode knapsack leetcode knapsack problem leetcode kth smallest element leetcode kmp leetcode k closest points leetcode kth smallest element in a bst leetcode kadane leetcode keys and rooml




Labels:

Comments

Post a Comment

Popular posts from this blog

Leetcode 371. Sum of Two Integers. C++ / Java

371 .  Sum of Two Integers   Given two integers  a  and  b , return  the sum of the two integers without using the operators   +   and   - .   Example 1: Input: a = 1, b = 2 Output: 3 Example 2: Input: a = 2, b = 3 Output: 5   Constraints: -1000 <= a, b <= 1000 Solution :  C++ : class Solution { public: int getSum(int a, int b) { if (b==0) return a; int sum = a ^ b; int cr = (unsigned int) (a & b) << 1; return getSum(sum, cr); } }; Java :  class Solution { public int getSum(int a, int b) { while(b != 0){ int tmp = (a & b) << 1; a = a ^ b; b = tmp; } return a; } } Explaination :
Post a Comment
Read more

Leetcode 217. Contains Duplicate. Python (Easiest Approach ✅)

217 .  Contains Duplicate   Given an integer array  nums , return  true  if any value appears  at least twice  in the array, and return  false  if every element is distinct.   Example 1: Input: nums = [1,2,3,1] Output: true Example 2: Input: nums = [1,2,3,4] Output: false Example 3: Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true   Constraints: 1 <= nums.length <= 10 5 -10 9  <= nums[i] <= 10 9 class Solution: def containsDuplicate(self, nums: List[int]) -> bool: hs = set() for n in nums: if n in hs: return True hs.add(n) return False Explaination :
Post a Comment
Read more

Number of Connected Components in an Undirected Graph (Python)

66.  Number of Connected Components in an Undirected Graph Question Link :  check here Givennnodes labeled from0ton - 1and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected graph. Example 1:      0          3      |          |      1 --- 2    4 Givenn = 5andedges = [[0, 1], [1, 2], [3, 4]], return2. Example 2:      0           4      |           |      1 --- 2 --- 3 Givenn = 5andedges = [[0, 1], [1, 2], [2, 3], [3, 4]], return1. Note: You can assume that no duplicate edges will appear inedges. Since all edges are undirected,[0, 1]is the same as[1, 0]and thus will not appear together inedges. Solution : class Solution: def counComponents(self, n: int, edges : List[List[int]]) -> i...
Post a Comment
Read more