func EqualIfInsert(a []rune, b []rune) bool {
	ib := 0
	for ia := 0; ia < len(a); ia++ {
		if a[ia] != b[ib] {
			if ia != ib {
				return false
			}
			ib++
		}
		ib++
	}
	return true
}
// EqualIfInsert returns true if s1 can be s2 by one insertion
// assume len(a) < len(b)

EqualIfInsert returns true if s1 can be s2 by one insertion
assume len(a) < len(b)
// EqualIfInsert returns true if s1 can be s2 by one insertion // assume len ( a ) < len ( b )
func EqualIfInsert(a []rune, b []rune) bool {
	ib := 0
	for ia := 0; ia < len(a); ia++ {
		if a[ia] != b[ib] {
			if ia != ib {
				return false
			}
			ib++
		}
		ib++
	}
	return true
}
func EqualIfInsert ( a [ ] rune , b [ ] rune ) bool { ib := 0 for ia := 0 ; ia < len ( a ) ; ia ++ { if a [ ia ] != b [ ib ] { if ia != ib { return false } ib ++ } ib ++ } return true }
EqualIfInsert returns true if s1 can be s2 by one insertion
assume len(a) < len(b)
EqualIfInsert returns true if s1 can be s2 by one insertion assume len ( a ) < len ( b )