Given an array of integers, find the total number of triplets (i, j, k) such that i < j < k and the sum of the elements (arr[i] + arr[j] + arr[k]) is divisible by 3.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.