Constraints
Input n=4,m=2
Output =1
Exponentiation = triplet is (2,2,2)
Please send me the code
Find the number of triplet array pairs
plz send complete question
make a map
and count the no of occurrences of each element
at last just count those whose occurrence is greater than 3
I cant made the logic please send me the code
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.