You are given a list houses, which stores the co-ordinates of n houses along a straight line. You have to set up m of flipkart's warehouses somewhere along the line.

A warehouse at co-ordinate x can deliver to houses from x-r to x+r, both inclusive.

Return the smallest r required so that the warehouses can serve all the houses.

Can somebody please help me with this question?