Fix #74: Optimize ConflictDetector._checkAttendeeConflicts O(n*m) → O(n+m)#132
Merged
thedhanawada merged 1 commit intomasterfrom Mar 20, 2026
Merged
Conversation
Replaced nested for-loops comparing attendee emails with a Set-based lookup. For enterprise events with 50+ attendees, this reduces comparisons from O(n*m) to O(n+m). Fixes #74
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Fix
Replaced nested for-loops with Set-based lookup in
_checkAttendeeConflicts()(ConflictDetector.js:323-328).Previously used O(n*m) nested loops to find overlapping attendees. For enterprise events with 50-100 attendees each, this meant 2500-10000 comparisons per event pair. Now uses a Set for O(1) email lookup, reducing overall complexity to O(n+m).
Files Changed
core/conflicts/ConflictDetector.js— 5 lines added, 10 removedFixes #74