Any faster way to find the number of “lucky triples”?

Question

I am working on a code challenge problem -- \"find lucky triples\". \"Lucky triple\" is defined as \"In a list lst, for any combination of triple like (ls

Answer 1

A precomputation step to the problem can help reduce time complexity.

Precomputation Step:

For every element(i), iterate the array to find which are the elements(j) such that lst[j]%lst[i]==0

for(i=0;i

This Precomputation Step will take O(n^2) time.

In the Ultimate Step, use the details of the Precomputation Step, to help find the triplets..