Available question text
Given candy counts per type and queries (favoriteType, favoriteDay, dailyCap), determine whether you can eat at least one and at most dailyCap candies per day, consuming types in order, so that you eat a candy of the favorite type on the specified day. Reduce each query to a prefix-sum range-overlap check: compute the minimum and maximum total candies you could have eaten by that day and see if that interval intersects the interval of candy indices for the favorite type.
Related questions
Continue with questions that share topics or the same question type.
- for the technical phone screen both questions were leetcode tagged. You can not run your code on coderpad. You have to dry run your solution.
Coding
- Last Day Where You Can Still Cross
Coding
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1744. Can You Eat Your Favorite Candy on Your Favorite Day?
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source