Skip to content

Conversation

@Athting
Copy link

@Athting Athting commented Oct 4, 2025

solved #70

dp[t] = number of people who learn the secret on day t.

Time: O(n) — one loop over all days.
Space: O(n) — storing dp array.

Copy link

@github-actions github-actions bot left a comment

Choose a reason for hiding this comment

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

Thanks for raising the PR, the owner will be review it soon' keep patience, keep contributing>>>!!! make sure you have star ⭐ the repo

@SjxSubham
Copy link
Owner

Don't spam PR randomly ...
take reference #64 #63 how they... maintain proper description

Copy link
Owner

Choose a reason for hiding this comment

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

add problem No... at the first of the file name ....
nd the PR name should be also same as File name ...
as well as Star the repo ⭐

Copy link
Owner

Choose a reason for hiding this comment

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

Also modify the PR description...

@SjxSubham SjxSubham linked an issue Oct 8, 2025 that may be closed by this pull request
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2327. Number of People Aware of a Secret

2 participants