René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"New puzzle inspired by codeforces 266B","articleBody":"```python\r\ndef sat(s: List[int]):\r\n    \"\"\"\r\n    Find a sequence of 0's and 1's so that, after n_steps of swapping each adjacent (0, 1), the target sequence\r\n    is achieved.\r\n\r\n    Inspired by [Codeforces Problem 266 B](https://codeforces.com/problemset/problem/266/B)\r\n    \"\"\"\r\n    for step in range(8):\r\n        for i in range(len(s) - 1):\r\n            if (s[i], s[i + 1]) == (0, 1):\r\n                (s[i], s[i + 1]) = (1, 0)\r\n    return s == [1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\n```\r\n\r\nSolvers, post your solutions in the comments using the following formatting:\r\n````\r\n\u003cdetails\u003e\u003csummary\u003eReveal solution\u003c/summary\u003e\r\n\r\n```python\r\ndef sol():\r\n    return \"world\"  # replace with your solution\r\n```\r\n\u003c/details\u003e\r\n````\r\n","author":{"url":"https://github.com/akalai","@type":"Person","name":"akalai"},"datePublished":"2021-06-20T15:03:15.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/8/PythonProgrammingPuzzles/issues/8"}