feat(algorithms, intervals): can attend meetings

[BrianLusina]

Describe your change:

Can attend meetings interval algorithm challenge

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

Summary by CodeRabbit

• New Features

  • Added an algorithm to check whether a person can attend all meetings without overlaps.

• Documentation

  • Added documentation for the Can Attend Meetings problem, including definition, edge-case notes, and example scenarios.

• Tests

  • Added parameterized unit tests covering multiple interval scenarios to validate correctness and edge cases.

_{✏️ Tip: You can customize this high-level summary in your review settings.}

[coderabbitai]

Caution

Review failed

The pull request is closed.

📝 Walkthrough

Walkthrough

Adds a new "Can Attend Meetings" algorithm under Intervals with documentation, a Python implementation that detects overlapping intervals by sorting, and parameterized unit tests covering edge cases and typical scenarios.

Changes

Cohort / File(s)	Summary
Documentation DIRECTORY.md, algorithms/intervals/can_attend_meetings/README.md	Added directory entry and README describing the problem, function contract, examples, and edge-case notes.
Algorithm Implementation algorithms/intervals/can_attend_meetings/__init__.py	Added can_attend_meetings(intervals: List[List[int]]) -> bool that sorts intervals by start time and checks for overlaps; handles empty input; docstring includes complexity and edge cases.
Unit Tests algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py	Added parameterized test cases covering empty, non-overlapping, overlapping, and boundary scenarios; test class and constant test dataset included.

Estimated code review effort

🎯 3 (Moderate) | ⏱️ ~20 minutes

Possibly related PRs

• feat(algorithms, intervals): can attend meetings #142 — Adds the same algorithms/intervals/can_attend_meetings package (implementation, README, tests, DIRECTORY entry).

Suggested labels

enhancement, Algorithm, Datastructures, Documentation, Sorting, Array, Intervals

Poem

🐰 I sorted my hops from start to end,
No overlaps now, each meeting a friend.
With a skip and a nibble, timelines align—
Calendars peaceful, one carrot at a time! 🥕

Pre-merge checks and finishing touches

❌ Failed checks (1 warning)

Check name	Status	Explanation	Resolution
Docstring Coverage	⚠️ Warning	Docstring coverage is 50.00% which is insufficient. The required threshold is 80.00%.	You can run @coderabbitai generate docstrings to improve docstring coverage.

✅ Passed checks (2 passed)

Check name	Status	Explanation
Title check	✅ Passed	The title clearly summarizes the main change: adding a 'can attend meetings' algorithm to the intervals problem set.
Description check	✅ Passed	The description includes all required sections with the change description and completed checklist items. All critical requirements are checked off and properly addressed.

---

📜 Recent review details

Configuration used: defaults

Review profile: CHILL

Plan: Pro

📥 Commits

Reviewing files that changed from the base of the PR and between ded01ef and 58a6208.

📒 Files selected for processing (1)

• algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py

---

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.}

[coderabbitai]

Actionable comments posted: 2

Fix all issues with AI Agents 🤖

In @algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py:
- Around line 10-11: The test file contains a duplicate test tuple ([[7, 10],
[2, 4]], True) repeated twice; remove one of the identical entries from the test
cases list in test_can_attend_meetings.py so each test case is unique (leave a
single instance of the ([[7, 10], [2, 4]], True) tuple and delete the
duplicate).

In @DIRECTORY.md:
- Around line 134-135: Adjust the "Can Attend Meetings" entry so its list
indentation uses 2 spaces for the parent bullet and 4 spaces for the child link,
and update the link target from
algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py to
tests/algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py to
match the other test entries and maintain consistent directory references.

📜 Review details

Configuration used: defaults

Review profile: CHILL

Plan: Pro

📥 Commits

Reviewing files that changed from the base of the PR and between e983f02 and ded01ef.

📒 Files selected for processing (4)

• DIRECTORY.md
• algorithms/intervals/can_attend_meetings/README.md
• algorithms/intervals/can_attend_meetings/__init__.py
• algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py

🧰 Additional context used

🧬 Code graph analysis (1)

algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py (1)

algorithms/intervals/can_attend_meetings/__init__.py (1)

• can_attend_meetings (4-60)

🪛 markdownlint-cli2 (0.18.1)

DIRECTORY.md

134-134: Unordered list indentation
Expected: 2; Actual: 4

(MD007, ul-indent)

---

135-135: Unordered list indentation
Expected: 4; Actual: 6

(MD007, ul-indent)

🔇 Additional comments (3)

algorithms/intervals/can_attend_meetings/README.md (1)

1-23: LGTM! Clear and well-documented problem statement.

The documentation clearly explains the problem, provides helpful examples, and importantly specifies that meetings ending and starting at the same time do not conflict.

algorithms/intervals/can_attend_meetings/__init__.py (1)

4-60: LGTM! Excellent implementation with comprehensive documentation.

The implementation correctly:

• Handles the edge case of empty input
• Sorts intervals by start time for efficient overlap detection
• Uses strict less-than (<) comparison at line 52, which properly allows adjacent meetings (end == start) to not conflict
• Provides detailed complexity analysis in the docstring
• Uses appropriate type hints

algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py (1)

1-29: Test file location is correct.

The current location algorithms/intervals/can_attend_meetings/test_can_attend_meetings.py is consistent with the project's testing convention. All test files throughout the repository are colocated with their corresponding implementation files within the algorithms/ directory structure (e.g., algorithms/arrays/intersection/test_intersection.py, algorithms/backtracking/combination/test_combination_2.py), not in a separate tests/ directory. The DIRECTORY.md entry correctly documents the test file at its actual location.

Likely an incorrect or invalid review comment.