Given an array $A$ of size $n$, find how many tuple $(i, j, k)$ are there such that $1 ≤ i < j < k ≤…
Click here to read the complete problem statement.
If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.