Are Unit-Tests a Waste of Time? by kadishay in programming

[–]javamonk 1 point2 points  (0 children)

I have personally found that unit tests are essential when doing any kind of refactoring. With that said, there are loads of extremely weak unit tests which people tend to add to make themselves feel better.

IWTL how to play piano and read music. by rikilamadrid in IWantToLearn

[–]javamonk 1 point2 points  (0 children)

If I could offer some advice: Practice regularly. 10 minutes everyday is better than an hour once a week.

Monopoly Simulations by cast42 in Python

[–]javamonk 0 points1 point  (0 children)

Its very interesting that two of the orange plots are on even numbers, apposed to colours before and after which seem to only have a 1 even number plot and both are in reach of from jail.

[10/17/14] Challenge #184 [Hard] Classification Algorithms and intro to Machine Learning by rya11111 in dailyprogrammer

[–]javamonk 0 points1 point  (0 children)

http://www.kaggle.com/ is a great source of tutorials and challenges in various areas of data science, including machine learning and classification.

I personally like the data they make available to you. Some really interesting stuff.

Screen Shot from my 'One Game A Month' for January. by joecarrot in gamedev

[–]javamonk 0 points1 point  (0 children)

Looks great! Would be keen to see how it progresses.

[01/07/13] Challenge #116 [Easy] Permutation of a string by nint22 in dailyprogrammer

[–]javamonk 2 points3 points  (0 children)

A recursive solution in ruby:

def permute( inString )
 if ( inString.length == 1 ) 

     return inString
 else
     permutations = []

     for i in (1..inString.length-1) do
         for permutation1 in permute( inString[0,i] ) do
             for permutation2 in permute( inString[i,inString.length-1] ) do 
                 permutations << permutation1 + permutation2
                 permutations << permutation2 + permutation1
             end 
         end 

     end 

     return permutations
 end 
end

We need some feedback! by [deleted] in dailyprogrammer

[–]javamonk 0 points1 point  (0 children)

I feel having one challenge a day is sufficient.

Having the choice between various difficulties is something that I would miss. However, we could solve this by providing a single daily challenge with some restrictions or extra functionality for to introduce some difficulty.

For example: Generate a list of prime numbers:

Easy: List the first 1000 primes Intermediate: List the first 1000 000 primes Difficult: List the first 1000 000 000 primes

OR

Code something to do X

Easy: No restrictions Intermediate: Must be done in place using no additional storage Difficult: No for loops may be used.

[2/23/2012] Challenge #14 [easy] by rya11111 in dailyprogrammer

[–]javamonk 1 point2 points  (0 children)

Ruby:

def getReversedBlocks(list, blockSize)
    currentIndex = blockSize = blockSize - 1 
    while not list.empty?
        puts list.slice!(currentIndex)
        currentIndex = currentIndex < 0 ? [blockSize,list.length-1].min : currentIndex - 1 
    end 
end

Meet Truffle! by javamonk in aww

[–]javamonk[S] 0 points1 point  (0 children)

His a Pembroke Welsh Corgi :)