Number of People Aware of a Secret
Explore how to apply dynamic programming techniques to determine the number of people who know a secret over a given period, accounting for delay and forgetting constraints. This lesson helps you implement efficient solutions for problems involving state tracking and modulo arithmetic.
We'll cover the following...
Statement
On day
Each person who learns the secret will begin sharing it with one new person every day, but only after a waiting period of delay days from when they first discovered it. Additionally, each person completely forgets the secret forget days after discovering it. Once a person has forgotten the secret (on the day of forgetting and all subsequent days), they can no longer share it.
Given an integer n, determine how many people know the secret at the end of day n. Since the result can be very large, return it modulo