Golang : Detect words using using consecutive letters in a given string

Tags : golang string words consecutive-letters repeat-alphabets

Got an interesting question asked by a member of Go Programming Language Facebook group. He is asking how to return words that have consecutive letters in it. I'm assuming that he is referring to words such as Bookkeeper,toot-toot, veneer-room, and wood-deer.

Below is my answer. Hope this helps.

 package main

 import (

 func main() {

  textString := "Bookkeeper and bookkeeping and sweet-toothed have three consecutive sets of double letters.Others are deer-reeve, feed-door, heel-loop, hoof-footed, hoot-toot, keek-keek, Soonnee, toot-toot, veneer-room, and wood-deer."

  words := strings.Split(textString, " ")

  // there could be more, but let's start with aa ee oo first.
  doubleLetters := []string{"aa", "ee", "oo"}


  for i := 0; i < len(doubleLetters); i++ {

 for _, word := range words {
 if strings.Contains(word, doubleLetters[i]) {
 fmt.Println("["+word+"] using consecutive letters")


You can see the output at https://play.golang.org/p/_MyPC7cJlN8




  See also : Golang : Extract part of string with regular expression

Tags : golang string words consecutive-letters repeat-alphabets

By Adam Ng(黃武俊)

IF you gain some knowledge or the information here solved your programming problem. Please consider donating to the less fortunate or some charities that you like. Apart from donation, planting trees, volunteering or reducing your carbon footprint will be great too.