4 added 44 characters in body
source | link

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

fromFrom any given list of words or phrases (inputarbitrary number of inputs, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key, and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> 7, 6 (seven times on the 6 key - nonmonogamous)
  • [tutu],[cat],[mouse] -> 4, 8 (four times on the 8 key - tutu)
  • [cab],[mon],[tin],[tom] -> 3,2 (cab) or 3,6 (mon) - either answer is valid
  • [#],[!!!],[is this valid?] -> any output or error - doesn't fit valid inputs. 2,4 would also be acceptable, for hi in is this valid?
  • bacmon, habitat, fringe, be, test, valid -> 3,2 or 3,6 as it's a tie between those keys
  • 01452301146 -> 2,1 (two in a row on the 1 key)

The output format isn't fixed, so you could also output [3][6] or 3.6 or 6,3 - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of 3,6 you could output 3,m

This is , usual exclusions etc. apply

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> 7, 6 (seven times on the 6 key - nonmonogamous)
  • [tutu],[cat],[mouse] -> 4, 8 (four times on the 8 key - tutu)
  • [cab],[mon],[tin],[tom] -> 3,2 (cab) or 3,6 (mon) - either answer is valid
  • [#],[!!!],[is this valid?] -> any output or error - doesn't fit valid inputs. 2,4 would also be acceptable, for hi in is this valid?
  • bacmon -> 3,2 or 3,6 as it's a tie between those keys
  • 01452301146 -> 2,1 (two in a row on the 1 key)

The output format isn't fixed, so you could also output [3][6] or 3.6 or 6,3 - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of 3,6 you could output 3,m

This is , usual exclusions etc. apply

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

From any given list of words or phrases (arbitrary number of inputs, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key, and output the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> 7, 6 (seven times on the 6 key - nonmonogamous)
  • [tutu],[cat],[mouse] -> 4, 8 (four times on the 8 key - tutu)
  • [cab],[mon],[tin],[tom] -> 3,2 (cab) or 3,6 (mon) - either answer is valid
  • [#],[!!!],[is this valid?] -> any output or error - doesn't fit valid inputs. 2,4 would also be acceptable, for hi in is this valid?
  • bacmon, habitat, fringe, be, test, valid -> 3,2 or 3,6 as it's a tie between those keys
  • 01452301146 -> 2,1 (two in a row on the 1 key)

The output format isn't fixed, so you could also output [3][6] or 3.6 or 6,3 - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of 3,6 you could output 3,m

This is , usual exclusions etc. apply

3 deleted 69 characters in body
source | link

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> nonmonogamous, 7, 6 (seven times on the 6 key - nonmonogamous)
  • [tutu],[cat],[mouse] -> tutu, 4, 8 (four times on the 8 key - tutu)
  • [0 0 0 0 0 ][cab],[2abcdefghi][mon],[9wxyz9wxyz][tin],[5jkl][tom] -> 0 0 0 0 0 ,103,02 (cab) or 9wxyz9wxyz,103,96 (mon) - either answer is valid
  • [#],[?!!!],[![is this valid?] -> any output or error - doesn't fit valid inputs. 2,4 would also be acceptable, for hi in is this valid?
  • bacmon -> 3,2 or 3,6 as it's a tie between those keys
  • 01452301146 -> 2,1 (two in a row on the 1 key)

The output format isn't fixed, so you could also output [3][6] or 3.6 or 6,3 - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of 3,6 you could output 3,m

This is , usual exclusions etc. apply

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> nonmonogamous, 7, 6 (seven times on the 6 key)
  • [tutu],[cat],[mouse] -> tutu, 4, 8 (four times on the 8 key)
  • [0 0 0 0 0 ],[2abcdefghi],[9wxyz9wxyz],[5jkl] -> 0 0 0 0 0 ,10,0 or 9wxyz9wxyz,10,9 - either answer is valid
  • [#],[?],[!] -> any output or error - doesn't fit valid inputs

This is , usual exclusions etc. apply

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> 7, 6 (seven times on the 6 key - nonmonogamous)
  • [tutu],[cat],[mouse] -> 4, 8 (four times on the 8 key - tutu)
  • [cab],[mon],[tin],[tom] -> 3,2 (cab) or 3,6 (mon) - either answer is valid
  • [#],[!!!],[is this valid?] -> any output or error - doesn't fit valid inputs. 2,4 would also be acceptable, for hi in is this valid?
  • bacmon -> 3,2 or 3,6 as it's a tie between those keys
  • 01452301146 -> 2,1 (two in a row on the 1 key)

The output format isn't fixed, so you could also output [3][6] or 3.6 or 6,3 - anything you like, as long as it's consistent which is the key and which the number of repetitions. You could also use one of the letters to represent the key, if you wanted - e.g. instead of 3,6 you could output 3,m

This is , usual exclusions etc. apply

2 deleted 69 characters in body
source | link

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> nonmonogamous, 7, 6 (seven times on the 6 key)
  • [tutu],[cat],[mouse] -> tutu, 4, 8 (four times on the 8 key)
  • [0 0 0 0 0 ],[2abcdefghi],[9wxyz9wxyz],[5jkl] -> 0 0 0 0 0 ,10,0 or 9wxyz9wxyz,10,9 - either answer is valid
  • [#],[?],[!] -> any output or error - doesn't fit valid inputs

This is , usual exclusions etc. apply

Query - how do questions on here tend to deal with wordlists?

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> nonmonogamous, 7, 6 (seven times on the 6 key)
  • [tutu],[cat],[mouse] -> tutu, 4, 8 (four times on the 8 key)
  • [0 0 0 0 0 ],[2abcdefghi],[9wxyz9wxyz],[5jkl] -> 0 0 0 0 0 ,10,0 or 9wxyz9wxyz,10,9 - either answer is valid
  • [#],[?],[!] -> any output or error - doesn't fit valid inputs

This is , usual exclusions etc. apply

Query - how do questions on here tend to deal with wordlists?

Monokeyed Words

(Based on https://what-if.xkcd.com/75/)

Old mobile phones had letters and numbers assigned to the same key, as follows:

  • 1
  • 2abc
  • 3def
  • 4ghi
  • 5jkl
  • 6mno
  • 7pqrs
  • 8tuv
  • 9wxyz
  • 0 [space]

from any given list of words or phrases (input, formed of 0-9 a-z and space), find the word which has the most consecutive characters on the same key and output it; along with the key and the count (in any reasonable format)

for example:

  • [nonmonogamous],[qwerty],[false] -> nonmonogamous, 7, 6 (seven times on the 6 key)
  • [tutu],[cat],[mouse] -> tutu, 4, 8 (four times on the 8 key)
  • [0 0 0 0 0 ],[2abcdefghi],[9wxyz9wxyz],[5jkl] -> 0 0 0 0 0 ,10,0 or 9wxyz9wxyz,10,9 - either answer is valid
  • [#],[?],[!] -> any output or error - doesn't fit valid inputs

This is , usual exclusions etc. apply

1
source | link