Mark and Toys Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Mark and Toys
  5. Discussions

Mark and Toys

  • Phortran
     + 0 comments

    I've added a little optimisation to filter out elements above the budget, that we don't need spending time ordering.

    public static int maximumToys(List<Integer> prices, int k) {
        var sorted = prices.stream()
                           .filter(p -> p <= k)
                           .sorted()
                           .collect(Collectors.toList());
        
        var i = 0;
        var budget = k;
        
        while(i < sorted.size() && budget >= sorted.get(i)) {
            budget -= sorted.get(i);
            ++i;
        }
        
        return i;
    }