-
Notifications
You must be signed in to change notification settings - Fork 1
LeetCode 961: N-Repeated Element in Size 2N Array #114
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
Merged
Merged
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
45bedce
leetcode 961: N-Repeated Element in Size 2N Array
WazedKhan 47e2b88
leecode 961: n repeated element with set()
WazedKhan 2ebaf67
📝 Add docstrings to `961-n-repeated-element`
coderabbitai[bot] 09dc02d
Merge pull request #115 from WazedKhan/coderabbitai/docstrings/47e2b88
WazedKhan File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,21 @@ | ||
| # 961. N-Repeated Element in Size 2N Array | ||
| # Link: https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/?envType=daily-question&envId=2026-01-02 | ||
| from typing import List | ||
|
|
||
| class Solution: | ||
| def repeatedNTimes(self, nums: List[int]) -> int: | ||
| """ | ||
| Finds the element that appears N times in an array of length 2N. | ||
|
|
||
| Parameters: | ||
| nums (List[int]): An array of length 2N containing exactly one value repeated N times and the remaining N values distinct. | ||
|
|
||
| Returns: | ||
| int: The value that appears N times in `nums`. | ||
| """ | ||
| seen_hash = {} # this can solved with set as well | ||
|
|
||
| for num in nums: | ||
| if num in seen_hash: | ||
| return num | ||
| seen_hash[num] = 1 | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Fix grammatical error in comment.
The comment has a grammar issue: "this can solved" should be "this can be solved".
🔎 Proposed fix
📝 Committable suggestion
🤖 Prompt for AI Agents