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.
public static int maximumToys(List<Integer> prices, int k) {
// Write your code here
Collections.sort(prices);
int count=0;
int sum=0;
for(int i=0;i<prices.size();i++){
sum +=prices.get(i);
if(sum<=k){
count++;
}else{
break;
}
}
return count;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mark and Toys
You are viewing a single comment's thread. Return to all comments →
Java