diff --git a/day-20/internal/one/graph.go b/day-20/internal/one/graph.go
index 86a52e7..5b42daa 100644
--- a/day-20/internal/one/graph.go
+++ b/day-20/internal/one/graph.go
@@ -39,7 +39,7 @@ func (g *graph) isValidCheatPosition(p point.Point) bool {
 		slices.Contains(allowed, g.valueAt(ns[W])) && slices.Contains(allowed, g.valueAt(ns[E]))
 }
 
-func (g *graph) getConnectingpoint(dir direction, p point.Point) point.Point {
+func (g *graph) getConnectingPoint(dir direction, p point.Point) point.Point {
 	ns := neighbours(p)
 
 	return ns[dir]
diff --git a/day-20/internal/one/solve.go b/day-20/internal/one/solve.go
index 5691396..c242bc5 100644
--- a/day-20/internal/one/solve.go
+++ b/day-20/internal/one/solve.go
@@ -45,7 +45,7 @@ func Solve(buf []byte) (int, error) {
 			}
 
 			if graph.isValidCheatPosition(n) {
-				b := graph.getConnectingpoint(direction(dir), n)
+				b := graph.getConnectingPoint(direction(dir), n)
 				graph.set(n, 'X')
 
 				v1, ok := Path.Get(point)