Find two indices in an array whose sum is closest to 0.

• Sort the array to simplify the process.

• Use two pointers approach starting from both ends towards the middle.

• Keep track of the closest sum found s...read more