OpenGenus/cosmos

Add code for Lonely Integer Problem.

Open

#277 opened on Oct 3, 2017

View on GitHubContributor guide
 (4 comments) (1 reaction) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

The Famous Lonely Integer Problem Given an array in which all the no. are present twice except one, find that lonely integer using bit-manipulation.

Contributor guide

Research direction
Implement the lonely integer function using XOR bit manipulation. Look at existing code examples in the repository for structure and style conventions.
Tech stack
None
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Git
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
80