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. Priyanka and Toys
  5. Discussions

Priyanka and Toys

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/Es5l0jbSH9I

    int toys(vector<int> w) {
    sort(w.begin(), w.end());
    int result = 1, mi = w[0];
    for(int item: w){
        if(item > mi + 4){
            mi = item;
            result++;
        }
    }
    return result;
}