| Title |
Δ |
| Folding in Haskell, using more than one function
|
-1.04 |
| Better move generator than brute force in Neutreeko
|
+0.10 |
| Optimizing finding an endgame
|
-0.91 |
| What are some better ways to write [(-1,-1),(-1,0),(-1,1),(0,-1),(0...
|
-0.74 |
| Calculate number of columns and rows needed depending on space avai...
|
-0.37 |
| How does this print "hello world"?
|
-1.42 |
| How to find subsequences?
|
+0.14 |
| Additive Sequence Algorithm
|
+0.64 |
| Fastest way to print a list of integers as a triangle from the exte...
|
-0.65 |
| Maximum сontinuous achievable number
|
+0.82 |
| Simple algorithm for generating random numbers with bigger/smaller...
|
-0.70 |
| Generating all n-bit strings whose hamming distance is n/2
|
0.00 |
| calculate moving object inside box
|
+0.14 |
| Is there a faster way to detect a game feature?
|
-0.49 |
| magic sequence of cards recursive algorithm
|
0.00 |
| How to calculate the number of coprime subsets of the set {1,2,3,.....
|
+0.31 |
| jQuery Datepicker, Check-Out Date is One Day After Check-In Date
|
+0.64 |
| How to "sort" elements of 2 possible values in place in l...
|
-0.25 |
| How to calculate a number which is not present in given ranges
|
-0.64 |
| identifying custom shapes in a 2D grid
|
0.00 |
| Closest pair of points across a line
|
-0.43 |
| Minimum cost path to visit a set of points in a given order exactly...
|
-0.23 |
| BitSet bug in cracking the coding interview?
|
+0.11 |
| Project Euler #18 in Haskell
|
-1.24 |
| testing tic tac toe win condition
|
+1.10 |
| Algorithm for finding a combination of integers greater than a spec...
|
+0.09 |
| TopCoder optimal choice algorithm from SRM 489 DIV 2 (500 pt)
|
-0.13 |
| Caculating total combinations
|
-0.31 |
| Caculating total combinations
|
+1.69 |
| Longest equally-spaced subsequence
|
-1.13 |
| Improve the solution to monkey grid puzzle
|
-0.36 |
| Haskell: Create unique n-tuples from a list of x elements
|
+1.36 |
| Array movement from a1,..,an,b1,..,bn to a1,b1,..,an,bn
|
+1.27 |
| Finding a sequence of operations
|
-0.62 |
| Given four coordinates check whether it forms a square
|
-0.40 |
| algorithm for checking close by numbers for similarities in a list
|
-0.45 |
| Find all possible combinations of a String representation of a number
|
+0.08 |
| Pattern matching a string in linear time
|
-0.09 |
| Sort array of days in javascript
|
-0.45 |
| calculate a row of numbers(see context for details)
|
+1.36 |
| Creating sets of similar elements in a 2D array
|
-1.02 |
| How can i determine if a string is a concatenation of a string list
|
-0.15 |
| Find all triplets in array with sum less than or equal to given sum
|
-0.89 |
| Finding N closest numbers
|
+0.13 |
| Haskell filter string with only the first occuring Char
|
-0.17 |
| Find the number of repeated subarray in an array
|
-0.34 |
| Error Installing Haskell BitSet Package on Windows XP
|
0.00 |
| Longest chain of pairs
|
-0.20 |
| Create List of Strings in Haskell
|
-1.18 |
| Most efficient way to check 3 lists for a common integer in Haskell
|
-0.45 |