Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

16
  • 2
    \$\begingroup\$ Suggested test case ## (leading 0 bit; some answers currently fail because of that) \$\endgroup\$
    – Luis Mendo
    Commented Jul 10, 2019 at 9:25
  • 4
    \$\begingroup\$ How is this a duplicate of the Manchester encoding challenge? Am I missing something? \$\endgroup\$
    – gastropner
    Commented Jul 10, 2019 at 10:25
  • 2
    \$\begingroup\$ The other challenge says converting an input stream of bits into a double-rate output stream, with each input '1' translated to a '01' and each input '0' translated to a '10'. So not dupe in my opinion. If a large number of people upvote @gastropner's comment above I can un-dupe (or any other user with that ability) \$\endgroup\$
    – Luis Mendo
    Commented Jul 10, 2019 at 11:24
  • 1
    \$\begingroup\$ @Shaggy: Both test cases include a space, which has only a single bit set, and not the 7th. So I don't think the problem statement is guaranteeing that each ascii code will be exactly 7 bits in length. \$\endgroup\$
    – recursive
    Commented Jul 10, 2019 at 15:05
  • 1
    \$\begingroup\$ @SmileAndNod On second thought, I think you don't need to handle empty string. \$\endgroup\$
    – justhalf
    Commented Jul 17, 2019 at 21:47