Given an array of integers, count the triplets of positions i < j < k whose sum is a perfect cube, meaning the sum equals m^3 for some integer m (for example 0, 1, 8, 27 and negative cubes).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.