We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
"You are given an array and you need to find number of tripets of indices (i,j,k) such that the elements at those indices are in geometric progression for a given common ratio and i < j < k. "
i, j, and k are the indices (positions in the array and they are in ascending order).
Count Triplets
You are viewing a single comment's thread. Return to all comments →
Right at the beggining:
"You are given an array and you need to find number of tripets of indices (i,j,k) such that the elements at those indices are in geometric progression for a given common ratio and i < j < k. "
i, j, and k are the indices (positions in the array and they are in ascending order).