use each_with_object to simply code



On another note:

     # Another (more efficient) approach is to order the linkedlist first,
     # then check every node against its "next" and that way detecting dups
     # is easy and fast, but then again, most sorting algorithms require
    # storing extra data temporarily.

could you give an example code?  I can't figure it out.
Merge pull request #2 from 404pnf/patch-1

use each_with_object to simply code
Several methods to remove duplicates
Merge branch 'master' of github.com:eLobato/ruby-algorithm-problems

Conflicts:
	remove_duplicates_linked_list.rb
find_min: nil can't be compared 

This won't work since nil can't be compared

'''Ruby
def find_min(array)
	min = nil
	array.each do |element|
		if (element < min) || (min == nil)
			min = element
		end
	end
	min
end
'''
Update factor.rb

I like your solution to the prime factors.  Elegant.  But could be made faster and using tail call.
Update find_3_indexes.rb

alternative solutions
add examples
alternative solutions

using number --> string --> array , take_last_while
Merge pull request #7 from 404pnf/patch-5

alternative solutions to counting zeros in a number
Merge pull request #6 from 404pnf/patch-4

Examples for factorialfactorial
Merge pull request #5 from 404pnf/patch-3

Find 3 indexes alternative methods
Merge pull request #4 from 404pnf/patch-2

More solutions to get the prime factors of a number
Merge pull request #3 from 404pnf/patch-1

find_min: nil can't be compared