Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Cost Path with Alternating Directions III
Coding · Array · Graph Theory · Heap (Priority Queue)
- Minimum Cost Path With At Most K Turns
Coding · Array · Graph Theory · Heap
- Cheapest Flights Within K Stops
Coding · Breadth-First Search · Depth-First Search · Dynamic Programming
- Evaluate Division
Coding · Array · Bellman–Ford Algorithm · Breadth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Minimum Cost to Buy Apples II
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source
LeetCode company tags · 1 record
Amazon
Archived company tags
Minimum Cost to Buy Apples II
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View source