This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Jaro_distance | |
d = 0 if no matching characters | |
otherwise d = (1/3) * (m/len(s1) + m/len(s2) + (m-(transpose/2))/m ) | |
characters match if distance >= (max(len(s1), len(s2))/2)-1 | |
if distance != 0, counts as a transpose | |
''' | |
def JaroDistance(s1, s2): |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
Take the following inputs in shorthand range, and translate them to longhand range. | |
1,6,4,9,1,6 => [1, 6, 14, 19, 21, 26] | |
2,9..9,9 => [2, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 29] | |
5,7,0,1,9,4 => [5, 7, 10, 11, 19, 24] | |
''' |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Hash_join | |
Implement the "hash join" algorithm, and demonstrate that it passes the test-case listed below. | |
You should represent the tables as data structures that feel natural in your programming language. | |
Guidance | |
The "hash join" algorithm consists of two steps: | |
Hash phase: Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Knapsack_problem/0-1 | |
Knapsack problem/0-1 | |
A tourist wants to make a good trip at the weekend with his friends. | |
They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. | |
He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it, and it will have to last the whole day. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Ethiopian_multiplication | |
Take two numbers to be multiplied and write them down at the top of two columns. | |
In the left-hand column repeatedly halve the last number, discarding any remainders, and write the result below the last in the same column, until you write a value of 1. | |
In the right-hand column repeatedly double the last number and write the result below. stop when you add a result in the same row as where the left hand column shows 1. | |
Examine the table produced and discard any row where the value in the left column is even. | |
Sum the values in the right-hand column that remain to produce the result of multiplying the original two numbers together | |
''' |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Count_in_factors | |
Write a program which counts up from 1, displaying each number as the multiplication of its prime factors. | |
For the purpose of this task, 1 (unity) may be shown as itself. | |
Example |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
Write a program that takes input text from standard input and outputs the text -- transposed. | |
Roughly explained, the transpose of a matrix | |
A B C | |
D E F | |
is given by |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
http://rosettacode.org/wiki/Sudoku | |
''' | |
import copy | |
square_ranges = { | |
0: [0, 1, 2], | |
1: [0, 1, 2], |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
On console input you will be given a string that represents the abbreviated chat message. | |
Output. Output should consist of the expanded sentence.Wordlist | |
lol - laugh out loud | |
dw - don't worry | |
hf - have fun | |
gg - good game | |
brb - be right back | |
g2g - got to go |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
A pangram is a sentence that contains all the letters of the English alphabet at least once. | |
For example: The quick brown fox jumps over the lazy dog. | |
Task | |
Write a function or method to check a sentence to see if it is a pangram (or not) and show its use. | |
''' |