Skip to content
Programming101
Programmingoneonone

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programmingoneonone

Learn everything about programming

Leetcode Find the Duplicate Number problem solution

YASH PAL, 31 July 2024

In this Leetcode Find the Duplicate Number problem solution we have 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. You must solve the problem without modifying the array nums and uses only constant extra space.

Leetcode Find the Duplicate Number problem solution

Topics we are covering

Toggle
  • Problem solution in Python.
  • Problem solution in Java.
  • Problem solution in C++.
  • Problem solution in C.

Problem solution in Python.

d = dict(collections.Counter(nums))
        print(d)
        for k in d:
            if d[k] > 1:
                return k

Problem solution in Java.

if(nums == null || nums.length == 0) {
            return 0;
        }
        int l = 1, r = nums.length;
        while(l < r){
            int cnt = 0;
            int mid = l + (r-l)/2;
            for(int num : nums) {
                if(num <= mid) cnt++;
            }
            if(cnt <= mid) {
                l = mid+1;
            } else {
                r = mid;
            }
        }
        return l;

Problem solution in C++.

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        
        vector<int> map(nums.size(), 0 );
        
        for(int i = 0; i < nums.size(); i++)
        {
            if(++map[nums[i]] > 1)
                return nums[i];
        }
        return 0;
    }
};

Problem solution in C.

int findDuplicate(int* a, int numsSize) {

int i=0;

while(i<numsSize)
{
    while(a[i] != (i+1))
    {
        if(a[a[i]-1] == a[i])
            return a[i];
        else
        {
            //swap a[a[i]-1] and a[i]
            a[a[i]-1] = a[i] + a[a[i]-1] - (a[i] = a[a[i]-1]);
        }
    }
    i++;
}
}

coding problems solutions

Post navigation

Previous post
Next post
  • Automating Image Format Conversion with Python: A Complete Guide
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes