In a string S of lowercase letters, these letters form consecutive groups of the same character.

For example, a string like S = "abbxxxxzyy" has the groups "a", "bb", "xxxx", "z" and "yy".

Call a group large if it has 3 or more characters. We would like the starting and ending positions of every large group.

The final answer should be in lexicographic order.

**Example 1:**

**Example 2:**

**Example 3:**

package Solution

funcSolution(xbool)bool {

funcSolution(Sstring) [][]int {

n:=len(S)

ifn<3 {

return [][]int{}

}

res:=make([][]int,0)

c,l,r:=1,-1,-1

fori:=1;i<n;i++ {

ifS[i]==S[i-1] {

ifl==-1 {

}

ifc>=3 {

}

}else {

ifc>=3 {

res=append(res, []int{l,r})

}

c,l=1,-1

}

}

ifc>=3 {

res=append(res, []int{l,r})

}

}

cases:= []struct {

}{

{"TestCase",true,true},

{"TestCase",true,true},

{"TestCase",false,false},

{"TestCase","abbxxxxzzy", [][]int{{3,6}}},

{"TestCase","abcdddeeeeaabbbcd", [][]int{{3,5}, {6,9}, {12,14}}},

{"TestCase","ab", [][]int{}},

{"TestCase","xxxaaaa", [][]int{{0,2}, {3,6}}},

}