Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

feat: add solutions to lc problem: No.3770 #4890

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
yanglbme merged 1 commit into main from dev
Dec 7, 2025
Merged

feat: add solutions to lc problem: No.3770 #4890

yanglbme merged 1 commit into main from dev
Dec 7, 2025

Conversation

@yanglbme
Copy link
Member

@yanglbme yanglbme commented Dec 7, 2025

No description provided.

Copilot AI review requested due to automatic review settings December 7, 2025 23:54
@idoocs idoocs added core team Issues or pull requests from core team cpp Issues or Pull requests relate to .cpp code go Issues or Pull requests relate to .go code java Issues or Pull requests relate to .java code md Issues or Pull requests relate to .md files py Issues or Pull requests relate to .py code ts Issues or Pull requests relate to .ts code labels Dec 7, 2025
@yanglbme yanglbme merged commit 0aa24a7 into main Dec 7, 2025
13 of 14 checks passed
@yanglbme yanglbme deleted the dev branch December 7, 2025 23:54
Copy link

Copilot AI left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull request overview

This PR adds solutions for LeetCode problem 3770 "Largest Prime from Consecutive Prime Sum" across multiple programming languages.

Summary: The problem asks to find the largest prime number ≤ n that can be expressed as the sum of one or more consecutive primes starting from 2. The solution uses preprocessing with the Sieve of Eratosthenes to generate all primes up to 500,000, computes consecutive prime sums, stores those that are prime, and uses binary search for queries.

Key Changes:

  • Implements a preprocessing + binary search approach with O(M log log M) preprocessing and O(log k) query time
  • Provides solutions in Python, Java, C++, Go, and TypeScript
  • Includes comprehensive problem descriptions and explanations in both Chinese and English

Reviewed changes

Copilot reviewed 7 out of 7 changed files in this pull request and generated no comments.

Show a summary per file
File Description
Solution.py Python implementation using Sieve of Eratosthenes and bisect_right for binary search
Solution.java Java implementation with static initialization and Collections.binarySearch
Solution.cpp C++ implementation using lambda initialization and upper_bound
Solution.go Go implementation with init function and sort.SearchInts
Solution.ts TypeScript implementation using IIFE initialization and lodash's sortedIndex
README.md Chinese problem description, examples, constraints, and solution explanation
README_EN.md English problem description, examples, constraints, and solution explanation

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

Copilot code review Copilot Copilot left review comments

Assignees

No one assigned

Labels

core team Issues or pull requests from core team cpp Issues or Pull requests relate to .cpp code go Issues or Pull requests relate to .go code java Issues or Pull requests relate to .java code md Issues or Pull requests relate to .md files py Issues or Pull requests relate to .py code ts Issues or Pull requests relate to .ts code

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

AltStyle によって変換されたページ (->オリジナル) /