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

[NEW ALGORITHM]: Find the Only Non-repeating Element in an Array #1637

Closed
2 tasks done
Jivanjamadar opened this issue Nov 4, 2024 · 1 comment
Closed
2 tasks done

Comments

@Jivanjamadar
Copy link

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name: Find the Only Non-repeating Element in an Array

[NEW ALGORITHM]

About:

Given an array of integers where every element appears twice except for one element that appears only once, your task is to find that unique element.

Example:
Input: arr = [4, 1, 2, 1, 2]
Output: 4
Propose a new algorithm to be added to the repository


Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
@Jivanjamadar
Copy link
Author

@pankaj-bind assign this issue to me

@Jivanjamadar Jivanjamadar closed this as not planned Won't fix, can't repro, duplicate, stale Nov 4, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant