Added all my solutions from CodeEval for resume : about.patrickcurl.com

Author: Patrick Curl

arrayAbsurdity.rb

@@ -0,0 +1,41 @@
+# ARRAY ABSURDITY
+# CHALLENGE DESCRIPTION:
+
+# Imagine we have an immutable array of size N which we know to be filled with integers ranging from 0 to N-2, inclusive. Suppose we know that the array contains exactly one duplicated entry and that duplicate appears exactly twice. Find the duplicated entry. (For bonus points, ensure your solution has constant space and time proportional to N)
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Each line in this file is one test case. Ignore all empty lines. Each line begins with a positive integer(N) i.e. the size of the array, then a semicolon followed by a comma separated list of positive numbers ranging from 0 to N-2, inclusive. i.e eg.
+
+# 5;0,1,2,3,0
+# 20;0,1,10,3,2,4,5,7,6,8,11,9,15,12,13,4,16,18,17,14
+# OUTPUT SAMPLE:
+
+# Print out the duplicated entry, each one on a new line eg
+
+# 0
+# 4
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+File.open(ARGV[0]).each_line do |line|
+    if line.include? "\n" then
+      line = line.gsub(/[\n]/, '')
+    end
+    a = line.split(";")
+
+    a = a.drop(1)
+    a = a[0].to_s
+    a = a.split(",")
+    #print a
+    a = a.collect{|s| s.to_i}
+    dupe = 0
+    a.each do |x|
+        if a.count(x) > 1 then
+          dupe = x.to_i
+        end
+    end
+
+    print dupe unless line.empty?
+    print "\n" unless line.empty?
+
+end

beautifulStrings.rb

@@ -0,0 +1,52 @@
+# BEAUTIFUL STRINGS
+# CHALLENGE DESCRIPTION:
+
+# Credits: This problem appeared in the Facebook Hacker Cup 2013 Hackathon.
+
+# When John was a little kid he didn't have much to do. There was no internet, no Facebook, and no programs to hack on. So he did the only thing he could... he evaluated the beauty of strings in a quest to discover the most beautiful string in the world.
+
+# Given a string s, little Johnny defined the beauty of the string as the sum of the beauty of the letters in it. The beauty of each letter is an integer between 1 and 26, inclusive, and no two letters have the same beauty. Johnny doesn't care about whether letters are uppercase or lowercase, so that doesn't affect the beauty of a letter. (Uppercase 'F' is exactly as beautiful as lowercase 'f', for example.)
+
+# You're a student writing a report on the youth of this famous hacker. You found the string that Johnny considered most beautiful. What is the maximum possible beauty of this string?
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Each line in this file has a sentence. E.g.
+
+# ABbCcc
+# Good luck in the Facebook Hacker Cup this year!
+# Ignore punctuation, please :)
+# Sometimes test cases are hard to make up.
+# So I just go consult Professor Dalves
+# OUTPUT SAMPLE:
+
+# Print out the maximum beauty for the string. E.g.
+
+# 152
+# 754
+# 491
+# 729
+# 646
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+def frequency(a)
+  a.group_by do |e|
+    e
+  end.map do |key, values|
+    [values.size]
+  end
+end
+
+
+File.open(ARGV[0]).each_line do |line|
+  a = line.downcase.gsub(/[^a-z]/, '').split('')
+  b = frequency(a).sort_by(&:last).reverse.flatten
+  count = 26
+  total = 0
+  b.each do |f|
+      total = total + (f*count)
+      count -= 1
+  end
+  print total
+  print "\n"
+end

calculateDistance.rb

@@ -0,0 +1,30 @@
+# CALCULATE DISTANCE
+# CHALLENGE DESCRIPTION:
+
+# You have coordinates of 2 points and need to find the distance between them.
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Input example is the following
+
+# (25, 4) (1, -6)
+# (47, 43) (-25, -11)
+# All numbers in input are integers between -100 and 100.
+
+# OUTPUT SAMPLE:
+
+# Print results in the following way.
+
+# 26
+# 90
+# You don't need to round the results you receive.
+# They must be integer numbers between -100 and 100.
+
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+File.open(ARGV[0]).each_line do |line|
+a = line.gsub(/[(),\n]/, "").split(" ").map(&:to_i)
+ans = Math.sqrt(((a[2]-a[0])**2)+((a[3]-a[1])**2))
+print ans.to_i
+print "\n"
+end

climbingStairs.rb

@@ -0,0 +1,34 @@
+# CLIMBING STAIRS
+# CHALLENGE DESCRIPTION:
+
+# You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Each line in this file contains a positive integer which is the total number of stairs.
+# Ignore all empty lines. E.g.
+
+# 10
+# 20
+# OUTPUT SAMPLE:
+
+# Print out the number of ways to climb to the top of the staircase. E.g.
+
+# 89
+# 10946
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+def fib(n)
+    gRatio = 1.61803398875
+
+    if n == 0
+        return 0
+    elsif n == 1
+        return 1
+    else
+        num = (((gRatio)**n) - ((1 - gRatio) ** n)) / Math.sqrt(5)
+        return num.to_i
+    end
+end
+File.open(ARGV[0]).each_line do |line|
+    puts fib(line.to_i + 1)
+end

countingPrimes.rb

@@ -0,0 +1,32 @@
+# COUNTING PRIMES
+# CHALLENGE DESCRIPTION:
+
+# Given two integers N and M, count the number of prime numbers between N and M (both inclusive)
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Each line in this file contains two comma separated positive integers. E.g.
+
+# 2,10
+# 20,30
+# OUTPUT SAMPLE:
+
+# Print out the number of primes between N and M (both inclusive)
+
+# 4
+# 2
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+require "prime"
+File.open(ARGV[0]).each_line do |line|
+  a = line.strip.split(',')
+  a = a.collect{|b| b.to_i}
+  primes = 0
+  (a.first..a.last).each do |x|
+    if x.prime? == true then
+      primes +=1
+    end
+  end
+  print primes
+  print "\n"
+end

decimalToBinary.rb

@@ -0,0 +1,27 @@
+# DECIMAL TO BINARY
+# CHALLENGE DESCRIPTION:
+
+# Given a decimal (base 10) number, print out its binary representation.
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename containing whole decimal numbers greater or equal to 0, one per line.
+# Ignore all empty lines. E.g.
+
+# 2
+# 10
+# 67
+# OUTPUT SAMPLE:
+
+# Print the binary representation, one per line. E.g.
+
+# 10
+# 1010
+# 1000011
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+File.open(ARGV[0]).each_line do |line|
+  a = line.to_i.to_s(2)
+  print a
+  print "\n"
+end

evenNumbers.rb

@@ -0,0 +1,31 @@
+# EVEN NUMBERS
+# CHALLENGE DESCRIPTION:
+
+# Write a program which checks input numbers and determines whether a number is even or not.
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Input example is the following
+
+# 701
+# 4123
+# 2936
+# OUTPUT SAMPLE:
+
+# Print 1 if the number is even or 0 if the number is odd.
+
+# 0
+# 0
+# 1
+# All numbers in input are integers > 0 and < 5000.
+
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+File.open(ARGV[0]).each_line do |line|
+  if line.to_i.even?
+    print 1
+  else
+    print 0
+  end
+  print "\n"
+end

fibSeries.rb

@@ -0,0 +1,35 @@
+# FIBONACCI SERIES
+# CHALLENGE DESCRIPTION:
+
+# The Fibonacci series is defined as: F(0) = 0; F(1) = 1; F(n) = F(n-1) + F(n-2) when n>1. Given a positive integer 'n', print out the F(n).
+
+# INPUT SAMPLE:
+
+# The first argument will be a path to a filename containing a positive integer, one per line. E.g.
+
+# 5
+# 12
+# OUTPUT SAMPLE:
+
+# Print to stdout, the fibonacci number, F(n). E.g.
+
+# 5
+# 144
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+def fib(n)
+    gRatio = 1.61803398875
+    num = n.to_f
+    if num == 0
+        return 0
+    elsif num == 1
+        return 1
+    else
+        myNum = (((gRatio) ** num) - ((1 - gRatio) ** num)) / Math.sqrt(5)
+        return myNum.to_i
+    end
+end
+
+File.open(ARGV[0]).each_line do |line|
+ puts fib(line)
+end

fileSize.rb

@@ -0,0 +1,17 @@
+# FILE SIZE
+# CHALLENGE DESCRIPTION:
+
+# Print the size of a file in bytes.
+
+# INPUT:
+
+# The first argument to your program has the path to the file you need to check the size of.
+
+# OUTPUT SAMPLE:
+
+# Print the size of the file in bytes. E.g.
+
+# 55
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+print File.size?(ARGV[0])

findAWriter.rb

@@ -0,0 +1,39 @@
+# FIND A WRITER
+# CHALLENGE DESCRIPTION:
+
+# You have a set of rows with names of famous writers encoded inside. Each row is divided into 2 parts by pipe char (|). The first part has a writer's name. The second part is a "key" to generate a name.
+
+# Your goal is to go through each number in the key (numbers are separated by space) left-to-right. Each number represents a position in the 1st part of a row. This way you collect a writer's name which you have to output.
+
+# INPUT SAMPLE:
+
+# Your program should accept as its first argument a path to a filename. Input example is the following
+
+# osSE5Gu0Vi8WRq93UvkYZCjaOKeNJfTyH6tzDQbxFm4M1ndXIPh27wBA rLclpg| 3 35 27 62 51 27 46 57 26 10 46 63 57 45 15 43 53
+
+# 3Kucdq9bfCEgZGF2nwx8UpzQJyHiOm0hoaYP6ST1WM7Nks5XjrR4IltBeDLV vA| 2 26 33 55 34 50 33 61 44 28 46 32 28 30 3 50 34 61 40 7 1 31
+# This input had 2 rows.
+
+# OUTPUT SAMPLE:
+
+# Print results in the following way.
+
+# Stephen King 1947
+# Kyotaro Nishimura 1930
+# Submit your solution in a file (some file name).(py2| c| cpp| java| rb| pl| php| tcl| clj| js| scala| cs| m| py3| hs| go| bash| lua) or use the online editor.
+
+File.open(ARGV[0]).each_line do |line|
+  if line.include? "\n" then
+    line = line.gsub(/[\n]/, '')
+  end
+
+  a = line.split('|')
+  encoded = a[0].split('')
+  key = a[1].split(" ")
+  name = []
+  key.each do |x|
+    name.push(encoded[x.to_i - 1])
+  end
+  print name.join('')
+  print "\n"
+end