Code Golf
This is a reverse-challenge of [this]( challenge.

Given an input string, check whether the string is blurry.
## What's a blurry string?
Take a non-blurrified string `abc` as an example. You repeat every character of this twice:
And then insert spaces at every odd-even index.
a ab bc c
Then, remove the preceding 2 and succeeding 2 extra characters.
ab bc

As an example, all of these strings are blurry (the empty line stands for an empty string):
"a"   ->
"ab"  ->ab
"abc" ->ab bc
"abcd"->ab bc cd
## Specification
* The input string consists purely of printable ASCII characters. The only whitespace it will contain is the space character.
* You don't have to remove extra characters before the check.
* Your output can consist of any trailing whitespace, as long as it's possible to tell a truthy result from a falsy result.

## Test cases
""        -> True
"ab"      -> True
"ab bc"   -> True
"ab bc cd"-> True

"a"         -> False
"abc"       -> False
"ab  bc  cd"-> False
"ab#bc#cd"  -> False
"abbccd"    -> False
"a ab bc cd"-> False
"a a ab b b"-> False
"ba cb dc"  -> False
"ba bc dc"  -> False
Top Answer Python 3
# ~~82~~ 74 bytes

    lambda s:len(s)//3*' '==s[2::3]and(len(s)%3>1or' '>s)*(s[1:-1:3]==s[3::3])

[Try it online!][TIO-kgnxotgo]

[TIO-kgnxotgo]: "Python 3 – Try It Online"
Answer #2
# [Jelly], 16 bytes


[Try it online!][TIO-khnmmkh4]

[TIO-khnmmkh4]: "Jelly – Try It Online"

## Explanation

    ḲµL=2)ẠaṪ⁼Ḣ}ɗƝẠ$   Main monadic link
    Ḳ                  Split on spaces
     µ                 Use as new argument
         )             Map
      L                  Length
       =2                Equals 2?
          Ạ            All
           a           And [short-circuit]
                   $   (
                 Ɲ       Apply to all pairs of neighboring elements
                ɗ        (
            Ṫ              Last element of left argument
             ⁼             Equals?
              Ḣ}           First element of right argument
                ɗ        )
                  Ạ      All?
                   $   (

This room is for discussion about this question.

Once logged in you can direct comments to any contributor here.

Enter question or answer id or url (and optionally further answer ids/urls from the same question) from

Separate each id/url with a space. No need to list your own answers; they will be imported automatically.