Short and simple Go solution
\nimport "sort"\n\nfunc minRectanglesToCoverPoints(points [][]int, w int) int {\n\txVals := make([]int, len(points))\n\tfor i, p := range points {\n\t\txVals[i]
```\nimport "sort"\n\nfunc minRectanglesToCoverPoints(points [][]int, w int) int {\n\txVals := make([]int, len(points))\n\tfor i, p := range points {\n\t\txVals[i] = p[0]\n\t}\n\tsort.Ints(xVals)\n\n\tcount := 1\n\tlastX := xVals[0]\n\tfor i := 1; i < len(xVals); i++ {\n\t\tif xVals[i] > lastX+w {\n\t\t\tcount += 1\n\t\t\tlastX = xVals[i]\n\t\t}\n\t}\n\treturn count\n}\n\n```
['Go']