Yahoo India Web Search

Sign In

Search results

  1. People also ask

  2. Videos

    View all

  3. leetcode.com › problems › find-missing-and-repeatedFind Missing and Repeated Values - LeetCode

    Find Missing and Repeated Values - You are given a 0-indexed 2D integer matrix grid of size n * n with values in the range [1, n2]. Each integer appears exactly once except a which appears twice and b which is missing. The task is to find the repeating and missing numbers a and b.

  4. leetcode.com › problems › find-the-duplicate-numberFind the Duplicate Number - LeetCode

    Find the Duplicate Number - Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number.

  5. 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.

  6. www.youtube.com › watchFind Missing & Repeating Number | Leetcode | Array - YouTube

    In this insightful video tutorial, we delve into the fascinating world of array manipulation as we crack the code to reveal the missing and repeating numbers...

    • 40 min
    • 23
    • Javascript Engineer

  7. algo.monster › liteproblems › 287287. Find the Duplicate Number - In-Depth Explanation

    In-depth solution and explanation for LeetCode 287. Find the Duplicate Number in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis. Better than official and forum solutions.

  8. dev.to › speaklouder › cracking-the-code-finding-theCracking the Code: Finding the Duplicate Number in LeetCode 287

    Sep 20, 2023 · Learn how to solve LeetCode 287, a medium-level challenge that involves finding a duplicate number in an array. Use a clever cycle detection algorithm with two pointers to achieve a time complexity of O (n).

  9. hoseacodes.github.io › Leetcode › docsMissing Number · LeetCode - GitHub Pages

    Missing Number · LeetCode. Description. 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.