[ch-082/jeongoon] ch-2.go typo

1 files changed, 8 insertions, 8 deletions

diff --git a/challenge-082/jeongoon/go/ch-2.go b/challenge-082/jeongoon/go/ch-2.go
index 74fd4f4619..a0246c7b2e 100644
--- a/challenge-082/jeongoon/go/ch-2.go
+++ b/challenge-082/jeongoon/go/ch-2.go
@@ -19,24 +19,24 @@ import (
 
 type MaybeIntereaved string
 
-func (C MaybeIntereaved) isInterleavingFrom (A string, B string) bool {
+func (C MaybeIntereaved) IsInterleavedFrom (A string, B string) bool {
 	Alen, Blen, Clen := len(A), len(B), len(C)
 	if Alen + Blen != Clen {
 		return false
 	}
 
 	Apin, Bpin := -1, -1 // if * >= 0, we have plan B
-	checkpingPlanB := false
+	checkingPlanB := false
 
 	for Ai, Bi, Ci := 0, 0, 0 ;; Ci = Ai + Bi {
-		if checkpingPlanB {
+		if checkingPlanB {
 			if Bpin > -1 {
 				// note: it was A[Ai] == B[Bi] == C[Ci]
 				// and tried A already.
 				Bi = Bpin + 1
 				Ai = Apin
 				Apin, Bpin = -1, -1
-				checkpingPlanB = false
+				checkingPlanB = false
 				Ci = Ai + Bi
 			} else {
 				// there is no plan B ...
@@ -52,7 +52,7 @@ func (C MaybeIntereaved) isInterleavingFrom (A string, B string) bool {
 			if B[Bi:] == string(C[Ci:]) {
 				return true
 			} else {
-				checkpingPlanB = true
+				checkingPlanB = true
 				continue
 			}
 		} else if Bi == Blen {
@@ -60,7 +60,7 @@ func (C MaybeIntereaved) isInterleavingFrom (A string, B string) bool {
 		}
 		if A[Ai] == B[Bi] {
 			if A[Ai] != C[Ci] {
-				checkpingPlanB = true
+				checkingPlanB = true
 			}  else {
 				// remember this node
 				Apin, Bpin = Ai, Bi
@@ -73,7 +73,7 @@ func (C MaybeIntereaved) isInterleavingFrom (A string, B string) bool {
 			} else if B[Bi] == C[Ci] {
 				Bi++
 			} else {
-				checkpingPlanB = true
+				checkingPlanB = true
 			}
 		}
 	}
@@ -91,7 +91,7 @@ func main() {
 	}
 	A, B, C := os.Args[1], os.Args[2], os.Args[3]
 
-	if MaybeIntereaved(C).isInterleavingFrom(A, B) {
+	if MaybeIntereaved(C).IsInterleavedFrom(A, B) {
 		fmt.Println( "1" )
 	} else {
 		fmt.Println( "0" )