public static int toys(List<int> w)
    {
        if (w == null || !w.Any()) return 0;
        var result = 1;
        var current = 0;
        w.Sort();
        for (var i = 1; i < w.Count; i++)
        {
            if (w[i] - w[current] > 4)
            {
                result++;
                current = i;
            }
        }
        return result;
    }

def toys(w):
    currentlist = list(sorted(w))

    cnt = 0
    while len(currentlist) > 0:
        maxweight = currentlist[0]+4
        currentlist = [x for x in currentlist if x > maxweight]
        # print(currentlist)
        cnt += 1
        if cnt > 1000000:
            break

    return cnt

def toys(w):
    # Write your code here
    count=1
    w.sort()
    k=w[0]+4
    i=0
    while i<len(w):
       if w[i]<=k:
        i+=1
       else: 
        k=w[i]+4
        count+=1
        i+=1
    return count

def toys(mylist):
    weights = sorted(list(set(mylist)))
    
    # The smallest element will be the first pivot
    cur = weights[0]
    containerCount = int(len(weights) > 0)
    
    # Time: O(n) as we are iterating over each element of the collection
    # Space: O(n) as we are storing a sorted set list of similar size as input
    for elem in weights:
        if elem > cur + 4:
            containerCount += 1
            cur = elem # Update the pivot
            
    return containerCount