Search Results

Python 2, 215 208 bytes This Python solution builds a regex from parts indexed by the command line argument, then tests each word with that (rather large) regex. import re,sys a='[sz] (d|th?) n m r …

Python 2, 100 77 bytes This solution is a Python function that accepts a multi-line string and prints the required counts to stdout. … Note that I use a format string to build a format string (which requires a %% to escape the first format placeholder). Edit: Saved 23 bytes due to print optimisations by Dennis. …

Given a string of letters and a set of words, output an ordering of the words so that they can be found in the string by dropping letters that are not needed. … Your program or function can accept the letter string and words as lists, a string, or from STDIN, and must output all words in a correct order as a list or string output. …

Python 2, 73 bytes i=raw_input() print''.join((c,c.upper())[p==' ']for p,c in zip(' '+i,i)) This program capitalises a letter if preceded by a space (with a kludge for the first character in the string … It relies on the .upper() string method to capitalise correctly. …

Python 2 Efficient to write, and reasonably efficient to run. groups = {} for word in open('/usr/share/dict/words'): word = word.strip() signature = ''.join(sorted(list(word))) if signat …

Python 2, 76 70 bytes This lambda function iteratively compares each sorted substring with the target substring. The matches are counted and returned. lambda a,d:sum(sorted(d[n:n+len(a)])==sorted( …

Now what if I get rid of the function names and rely on string formatting? … Ok, What if I took the obvious way and just printed the string: # 131*60 = 7860 print'Elizabeth obnoxiously quoted (just too rowdy for my peace): "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG," giving …

matching), reob9b.search(matching) print 'Not found:', reob9a.search(nomatch), reob9b.search(nomatch) This set of 2 searches finds 2 vertical and 2 horizontal matches, but cannot find the embedded #.,# string …

Python 2, 353 bytes The parse function steps through the tokens one at a time and builds a tree of the program structure. Invalid programs trigger an exception which causes a zero (Falsy) to be print …

Python 2, score: 1840 2162 This program first finds the best scoring word available with the given tiles (without using wildcards), then makes 10000 attempts to include random words that meet the con …

Python 2, 197 bytes This solution uses string formatting to reduce repetition. Each string component is assembled, then placed within the template. … I used the raw string r'\\' and multi-line '''blah \n blah''' string techniques here. …