Efficient algorithm to find max points on a line given a collection of Vector3 points?

Question

I am trying to figure out an efficient algorithm to detect the most points on the same line given a collection of N Vector3 points. This is a 3D version of this problem: https:/