Paul Unger gpaulu

Washington, D.C.

Recently created

Least recently created

Recently updated

Least recently updated

gpaulu / redditDaily_138.hs

Last active December 26, 2015 04:19

Reddit Daily Programmer [09/17/13] Challenge #138 [Easy] Repulsion-Force http://www.reddit.com/r/dailyprogrammer/comments/1ml669/091713_challenge_138_easy_repulsionforce/

	data Particle = Particle { mass :: Float, xPos :: Float, yPos :: Float}

	--probably silly
	delta z a b = z a - z b

	deltaX = delta xPos
	deltaY = delta yPos

	dist a b = sqrt (deltaX a b 2 + deltaY a b 2)

gpaulu / Permutation.java

Last active December 10, 2015 19:18

Reddit 116 http://www.reddit.com/r/dailyprogrammer/comments/164zvs/010713_challenge_116_easy_permutation_of_a_string/

	import java.util.LinkedHashSet;


	public class Permutation {
	private LinkedHashSet<String> set;
	private String s;
	private boolean found;
	Permutation(String s){
	this.s = s;
	found = false;

gpaulu / sumPair2.hs

Created January 4, 2013 19:47

Attempt 2 at reddit challenge 115

	sumPair :: [Int] -> Int -> [(Int,Int)]
	sumPair xs num = helper xs num []
	where helper [] _ [] = []
	helper [] _ [z] = []
	helper [] num (z:zs) = helper (z:zs) num []
	helper (x:[]) _ [] = []
	helper (x:[]) num zs = helper zs num []
	helper (x:y:xs) num []
	\| x + y == num = (min x y,max x y):(helper xs num [])
	\| otherwise = helper (x:xs) num [y]

gpaulu / sumPair.hs

Last active September 24, 2021 13:46 — forked from anonymous/ sumPair.hs

Reddit Challenge 115 Description: Let the term "sum-pair" be a pair of integers A and B such that the sum of A and B equals a given number C. As an example, let C be 10. Thus, the pairs (5, 5), (1, 9), (2, 8), etc. are all sum-pairs of 10. Your goal is to write a program that, given an array through standard input (console), you echo out all sum…

	sumPair options num :: [Int] -> Int -> [(Int,Int)]
	sumPair options num = [(x,y) \| x <- options, y <- options, x + y == num, x < y] ++ [(x,x) \| x <- options, x*2 == num]