I think something like this: A.filterNot(a => B.exists(b => a._3.exists(str => str.contains(b)))) or A.filterNot(a => a._3.exists(str => B.exists(b => str.contains(b)))) or shorter, but less readable A.filterNot(_._3 exists (B exists _.contains))
We can start by generating ranges required, and then map count function onto ranges to get list of partial functions, which finally can be applied on the given list. ranges lim n = takeWhile (\(x,y) -> x < lim) [(k*n, (k+1)*n – 1) | k <- [0..]] count (l,r) = length.filter (\x -> l <= … Read more
I would give you some hints to get you started up: Use filter function to get the odd members of the given list. Cube the resultant list using map function. Find the mean of them by summing the list and dividing it by the length of the list.