Profile overview for hkrdrm.
Submission statistics

This user has mostly submitted to the following subverses (showing top 5):

1 submissions to dankmemes

1 submissions to funny

1 submissions to programming

This user has so far shared a total of 3 links, started a total of 0 discussions and submitted a total of 43 comments.

Voting habits

Submissions: This user has upvoted 17 and downvoted 0 submissions.

Comments: This user has upvoted 37 and downvoted 4 comments.

Submission ratings

5 highest rated submissions:

3 days without reddit, submitted: 7/12/2015 1:54:53 AM, 30 points (+30|-0)

Reactjs Component to autobuild a bootstrap carousel from a list of image urls., submitted: 12/2/2015 2:41:50 AM, 2 points (+2|-0)

crazy lady does the donkey kong dance, submitted: 9/3/2016 12:14:34 AM, -2 points (+2|-4)

5 lowest rated submissions:

crazy lady does the donkey kong dance, submitted: 9/3/2016 12:14:34 AM, -2 points (+2|-4)

Reactjs Component to autobuild a bootstrap carousel from a list of image urls., submitted: 12/2/2015 2:41:50 AM, 2 points (+2|-0)

3 days without reddit, submitted: 7/12/2015 1:54:53 AM, 30 points (+30|-0)

Comment ratings

3 highest rated comments:

Hackers In Revolt After SJWs Attempt To Impose Politically Correct 'Code of Conduct' On Ruby Community - Breitbart submitted by fluxusp to technology

hkrdrm 1 points 14 points (+15|-1) ago

just makes me want to write a program in ruby that auto emalis that bitch and calls her a faggot every 23 seconds.

This is how the developer views the user. submitted by Anchy to funny

hkrdrm 0 points 13 points (+13|-0) ago

Yep make something idiot proof and someone will make a better idiot.

3 lowest rated comments:

The maximum continuous subsequence sum problem submitted by katara to code

hkrdrm 0 points 0 points (+0|-0) ago

Here's solution in ruby its not the most efficient but it works.

def replace_max(max_ary, new_ary)
  sum = 0
  new_ary.each{|x| sum += x}
  new_ary.push(sum)

  if(max_ary[-1] > new_ary[-1])
    return max_ary
  end
  return new_ary
end

def find_max_con(ary)
  max = []
  sum = 0
  ary.each{|x| sum += x}
  max = ary.dup
  max.push(sum)

  sub_arrays = []
  sub_arrays.push(ary)

  sub_arrays.each do |x|
    if(x.length > 1)
      #trim left
      sub_arrays.push(x[0..-2].dup)

      #trim right
      sub_arrays.push(x[1..-1].dup)
    end
  end

  sub_arrays.each do |x|
    max = replace_max(max.dup, x.dup)
  end
  sub_arrays
  max
end




ary = [ 2, -6, 3, 5, -1, 4 ]

ary = find_max_con(ary)
puts "\nMax Sum: " + ary.pop.to_s + "\n"
puts ary.to_s

Any Spiceheads here? submitted by mst3k to sysadmin

hkrdrm 0 points 0 points (+0|-0) ago

Ha I was wearing my spice tshirt the other day. Haven't used it since I left my last job.

How can I grasp the concept of C sockets? submitted by somedudeperson to programming

hkrdrm 0 points 0 points (+0|-0) ago

I'd say its good thing to learn the OS calls and the basics behind socket programming, but for any practical purposed maybe look into zeroMQ I really liked using it so far. It has libraries for all the major languages and you don't have to bog yourself down with how many bytes were sent you.