Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

10. Find the Duplicate Number (BIT-MANIPULATION) #208

Open
ujju20 opened this issue Jul 25, 2021 · 4 comments · Fixed by #238 or #298
Open

10. Find the Duplicate Number (BIT-MANIPULATION) #208

ujju20 opened this issue Jul 25, 2021 · 4 comments · Fixed by #238 or #298
Assignees
Labels
🟨 Level2 This issue will be considered as level 2 issue for LGM-SOC 21.Points will be 15 LGMSOC21 This issue will be considered for LGM-SOC 21

Comments

@ujju20
Copy link
Collaborator

ujju20 commented Jul 25, 2021

Contribution Guidelines for this question-

  • Languages available: C++, Java, Python
  • Well Commented Code
  • In the starting, add a brief explanation of the algorithm
  • if possible, add time and space complexity
  • kindly upload your code in Bit-Manipulation -> Language (C++, Java, Python) Folder
  • NO PLAGIARISM

Also, watch this video and the README section before contributing to the project.
https://youtu.be/qXeaN_ZVVIc

@ujju20 ujju20 added 🟨 Level2 This issue will be considered as level 2 issue for LGM-SOC 21.Points will be 15 LGMSOC21 This issue will be considered for LGM-SOC 21 labels Jul 25, 2021
@2000shivam659
Copy link
Contributor

Please assign me this in java language.

@ujju20
Copy link
Collaborator Author

ujju20 commented Jul 27, 2021

Please assign me this in java language.

Sure, Do follow the guidelines and complete your work in 2 days.

@ShwetKhatri2001
Copy link
Contributor

@ujju20 Can I work on this issue in C++ ?

@vilsijain
Copy link
Member

Yes @ShwetKhatri2001

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
🟨 Level2 This issue will be considered as level 2 issue for LGM-SOC 21.Points will be 15 LGMSOC21 This issue will be considered for LGM-SOC 21
Projects
None yet
5 participants