Available question text
Given a list of item prices, a set of available discounts/price adjustments, and a budget, determine the most expensive single item that remains unaffordable even after applying discounts optimally. The problem reduces to testing affordability per item with the best discount and is typically solved with sorting plus greedy checks or binary search for efficiency.
Related questions
Continue with questions that share topics or the same question type.
- All Valid Triplets That Can Represent a Country
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
- Count Artifacts That Can Be Extracted
Coding
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
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 2979. Most Expensive Item That Can Not Be Bought
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source