Answers for "hackerrank active traders solution"

unexpected demand hackerrank solution

def filledOrders(order, k):
  total = 0
  for i, v in enumerate(sorted(order)):
    if total + v <= k:
      total += v       # total stays <= k
    else:
      return i         # provides the count
  else:
    return len(order)  # was able to place all orders

print(filledOrders([3, 2, 1], 3))  # Out: 2
print(filledOrders([3, 2, 1], 1))  # Out: 1
print(filledOrders([3, 2, 1], 10)) # Out: 3
print(filledOrders([3, 2, 1], 0))  # Out: 0

hackerrank active traders solution

public static List<string> mostActive(List<string> customers)
        {
            List<string> res = new List<string>();
            foreach (var c in customers)
            {
                double count = customers.Count(a => a.Contains(c));
                double per = (count / customers.Count()) * 100;
                if (!res.Contains(c) && per>=5)
                {
                    res.Add(c);
                }
            }
            return res.OrderBy(r=>r).ToList();
        }