Lets geek out. The HackerNoon library is now ranked by reading time created. Start learning by what others read most. Lets geek out. The HackerNoon library is now ranked by reading time created. Start ...

Given two arrays: arr1[0..m-1] of size m and arr2[0..n-1] of size n. Task is to check whether arr2[] is a subset of arr1[] or not. Both the arrays can be both unsorted or sorted. It may be assumed ...

less than n, which are co-prime to n, i.e. ETF(n) = frequency of x where gcd(x,n) = 1 and 1<=x<=n. Brute force approach : Iterate over all elements < n and check if it's co-prime to n.