Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to solve the problem of counting the number of triangles that can be formed with given points in a 2D plane.

Run the code to see the output here...