1 comment (1 comment)1 reaction (1 reaction)1 assignee (1 assignee)C++3,724 forks (3,724 forks)batch import
Hacktoberfestadd codenew algorithm
Repository metrics
- Stars
- 13,462 stars (13,462 stars)
- PR merge metrics
- No merged PRs in 30d (No merged PRs in 30d)
Description
Find 2 unique Numbers in an array where every number occours twice except 2 numbers.find those two Numbers using bit manupilation
Contributor guide
- Research direction
- Learn XOR bit manipulation to find two numbers that appear once in an array where all other numbers appear twice. Implement the solution in C++ following the repository's coding standards.
- Tech stack
- cpp
- Domain
- backend
- Issue type
- Feature
- Prerequisites
- GitC++