diff options
| author | drclaw1394 <drclaw@mac.com> | 2019-06-10 20:56:34 +1000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-06-10 20:56:34 +1000 |
| commit | 5c1663e3f7a4bf8767cd62c4e7db03186561edb2 (patch) | |
| tree | 2a0fa3af0f3b0fd5a71a9ae67984f4fa2adb8aa1 /challenge-010/duncan-c-white/README | |
| parent | b577c5e4a0a63be26d335cb74580c1ae721105c0 (diff) | |
| parent | e874646e75a09fbe9c9f248e2071bc4182973b7f (diff) | |
| download | perlweeklychallenge-club-5c1663e3f7a4bf8767cd62c4e7db03186561edb2.tar.gz perlweeklychallenge-club-5c1663e3f7a4bf8767cd62c4e7db03186561edb2.tar.bz2 perlweeklychallenge-club-5c1663e3f7a4bf8767cd62c4e7db03186561edb2.zip | |
Merge pull request #11 from manwar/master
update to week 12
Diffstat (limited to 'challenge-010/duncan-c-white/README')
| -rw-r--r-- | challenge-010/duncan-c-white/README | 35 |
1 files changed, 24 insertions, 11 deletions
diff --git a/challenge-010/duncan-c-white/README b/challenge-010/duncan-c-white/README index fb3a863c80..2384fb220f 100644 --- a/challenge-010/duncan-c-white/README +++ b/challenge-010/duncan-c-white/README @@ -1,14 +1,27 @@ -Challenge 1: "Create a script which takes a list of numbers from -command line and print the same in the compact form. For example, if -you pass 1,2,3,4,9,10,14,15,16 then it should print the compact form -like 1-4,9,10,14-16.." +Challenge 1: "Write a script to encode/decode Roman numerals. For example, +given Roman numeral CCXLVI, it should return 246. Similarly, for decimal +number 39, it should return XXXIX." -Quite simple and dull problem. But ok, let's have a go. +My notes: That's a nice problem, let's have a go. -Challenge 2: "Create a script to calculate Ramanujan's constant with at -least 32 digits of precision." -Never heard of this constant, seems to be e^(pi*sqrt(163)), which is -"very nearly an integer", I don't particularly care about abtruse mathematical -formulae. But ok, Perl's built in module biggrat will let you do this anyway, -specifying accuracy 32; see ch-2.sh for the oneliner. +Challenge 2: "Write a to find Jaro-Winkler distance between two strings." + +My notes: + +WTF is Jaro-Winkler, read wikipedia page, well Jaro-Winkler is a +simple prefix adjustment to the Jaro distance, but the wikipedia page +explaining Jaro distances is not very clear - it describes it in terms +of matched characters and transposed characters, but it's description +of matching within a range, and of how to count transposed characters +is almost completely unclear. I couldn't write code based on such a +poor description! + +But googling further, Rosetta Stone had various implementations in +various languages (including C and Perl), which clarifies the terribly +unclear wikipedia entry. Ok, I basically understand it now. Transposed +characters are matching characters that are diferent, eg TH vs HT + +So I'll have a go anyway, although I ran out of time to do it in the +weekly challenge (and I screwed up the git side of things, so couldn't +submit it late either). |
