Public Forums Talk Boxes Private Messages Live Chat
Personal Links
More Community

Usenet Newsgroups : rec.puzzles Hall of Fame


The rec.puzzles Hall of Fame is a compilation of over 500 of the most popular puzzles that have been posted and discussed in the rec.puzzles newsgroup. In most cases a detailed solution has been provided.

Many of these puzzles also appear in Braingle's own collection.

   
rec.puzzles
Newsgroup
FAQ
Hall of Fame
alt.brain.teasers
Newsgroup
FAQ
Categories : combinatorics : full.p

Consider a string that contains all substrings of length n.  For
example, for binary strings with n=2, a shortest string is 00110 -- it
contains 00, 01, 10 and 11 as substrings.  Find the shortest such
strings for all n.


Solution

Online Now
10 users and 644 guests

Users In Chat
autumn
Follow Braingle!
Tap into all 20,000+ of our brain teasers, riddles and puzzles on your iPhone or iPad.
Braingle in the iTunes App Store
Copyright © 1999-2017 | FAQ | Widgets | Links | Green | Subscribe | Contact | Privacy | Conditions | Advertise | Braingle Time: 5:38 pm
Sign In Create a free account