• What is the time complexity of your program?
• What is the space complexity of your program?

Question 4

You are given an array of n integers. Write a program to count the number of triplets (i, j, k) such that arr[i] + arr[j] + arr[k] == 0.

• What is the time complexity of your program?
• What is the space complexity of your program?