LeetCode-128: Longest Consecutive Sequence

[WazedKhan]

Summary by CodeRabbit

• New Features

  • Added solution for the Longest Consecutive Sequence problem, identifying the longest consecutive sequence within an array of integers.

• Tests

  • Added comprehensive test suite covering edge cases including empty lists, single elements, duplicates, negative numbers, and mixed arrays.

[coderabbitai]

No actionable comments were generated in the recent review. 🎉

ℹ️ Recent review info

⚙️ Run configuration

Configuration used: defaults

Review profile: CHILL

Plan: Pro

Run ID: 4fd1e3e9-4774-481a-8da4-476968a0ba52

📥 Commits

Reviewing files that changed from the base of the PR and between 50e054a and b0420d7.

📒 Files selected for processing (2)

• LeetCode/medium/longest_consecutive_128.py
• tests/test_leetcode_medium.py

---

📝 Walkthrough

Walkthrough

Adds a new file LeetCode/medium/longest_consecutive_128.py with a Solution class implementing longestConsecutive using a set for O(1) lookups, identifying sequence starts and counting consecutive runs. A parametrized pytest function covering edge cases is appended to the existing medium test file.

Changes

Longest Consecutive Sequence (LeetCode 128)

Layer / File(s)	Summary
Solution implementation and parametrized tests LeetCode/medium/longest_consecutive_128.py, tests/test_leetcode_medium.py	Solution.longestConsecutive converts nums to a set, identifies sequence starts by checking (num - 1) not in num_set, walks forward to count each run, and returns the maximum. Tests cover empty list, single element, sorted/unsorted, duplicates, negatives, and larger mixed arrays.

Estimated code review effort

🎯 1 (Trivial) | ⏱️ ~3 minutes

Poem

🐇 Hop, hop, through numbers I run,
No predecessor? A new streak's begun!
I build a set, then walk ahead,
Counting each step till the sequence is dead.
The longest run is found — hooray!
This bunny solved 128 today! 🥕

🚥 Pre-merge checks | ✅ 4 | ❌ 1

❌ Failed checks (1 warning)

Check name	Status	Explanation	Resolution
Docstring Coverage	⚠️ Warning	Docstring coverage is 0.00% which is insufficient. The required threshold is 80.00%.	Write docstrings for the functions missing them to satisfy the coverage threshold.

✅ Passed checks (4 passed)

Check name	Status	Explanation
Description Check	✅ Passed	Check skipped - CodeRabbit’s high-level summary is enabled.
Title check	✅ Passed	The title clearly and specifically identifies the implementation of LeetCode problem 128 (Longest Consecutive Sequence), which matches the main changes in the pull request.
Linked Issues check	✅ Passed	Check skipped because no linked issues were found for this pull request.
Out of Scope Changes check	✅ Passed	Check skipped because no linked issues were found for this pull request.

_{✏️ Tip: You can configure your own custom pre-merge checks in the settings.}

✨ Finishing Touches

📝 Generate docstrings

• Create stacked PR
• Commit on current branch

🧪 Generate unit tests (beta)

• Create PR with unit tests
• Commit unit tests in branch leetcode-128

---

Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out.

❤️ Share

• X
• Mastodon
• Reddit
• LinkedIn

_{Comment @coderabbitai help to get the list of available commands and usage tips.}