在长度l的平方内包含最大的无点

What would be the algorithm for given problem statement? Given n points in 2D plain you need to find square(sides parallel to axes) of side length l which cover maximum no of points from given n points?What would be the algorithm for given problem s