Yahoo India Web Search

Sign In

Search results

  1. leetcode.com › problems › missing-numberMissing Number - LeetCode

    Missing Number - Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example 1: Input: nums = [3,0,1] Output: 2 Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear ...

    • Solution

      Solution - Missing Number - LeetCode

    • Submissions

      Submissions - Missing Number - LeetCode

  2. Videos

    View all

  3. leetcode.com › problems › find-all-numbersFind All Numbers Disappeared in an Array - LeetCode

    Find All Numbers Disappeared in an Array - Given an array nums of n integers where nums [i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.

  4. tutorialcup.com › leetcode-solutions › find-allFind All Numbers Disappeared in an Array Leetcode Solution

    We can mark every element in the array and then loop in the range: [1, N] to check which elements have disappeared or are missing in the array. We use a hash set to store whether an integer has been marked or not.

  5. leetcode.ca › 2018/10/25-1060-Missing-Element-in1060 - Missing Element in Sorted Array - Leetcode

    Oct 25, 2018 · Missing Element in Sorted Array. Description. Given an integer array nums which is sorted in ascending order and all of its elements are unique and given also an integer k, return the k th missing number starting from the leftmost number of the array. Example 1: Input: nums = [4,7,9,10], k = 1. Output: 5.

  6. stackoverflow.com › questions › 67851954LeetCode Find All Numbers Disappeared in an Array Question

    Jun 5, 2021 · The problem I am doing is stated as follows: Given an array nums of n integers where nums [i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.

  7. leetcodethehardway.com › missing-number-easy0268 - Missing Number (Easy) | LeetCode The Hard Way

    Problem Statement. Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example 1: Input: nums = [3,0,1] Output: 2.

  8. People also ask

  9. www.geeksforgeeks.org › find-the-missing-numberFind the Missing Number - GeeksforGeeks

    Sep 21, 2024 · Given a sorted array arr[] of N integers, The task is to find the multiple missing elements in the array between the ranges [arr[0], arr[N-1]]. Examples: Input: arr[] = {6, 7, 10, 11, 13}Output: 8 9 12 Explanation: The elements of the array are present in the range of the maximum and minimum array element [6, 13].