Link Details

Link 1062755 thumbnail
User 448255 avatar

By dotCore
via stats.stackexchange.com
Submitted: Nov 08 2013 / 23:36

Suppose you had a bag with n tiles, each with a letter on it. There are nA tiles with letter 'A', nB with 'B', and so on, and n∗ 'wildcard' tiles (we have n=nA+nB+…+nZ+n∗). Suppose you had a dictionary with a finite number of words.
  • 2
  • 0
  • 54
  • 6

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (2)



Voters Against This Link (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java