Hacker Newsnew | past | comments | ask | show | jobs | submit | mnbvcxza's commentslogin

It's like you're bringing feminism into this just to troll. He said absolutely nothing about feminism.


I know that he didn't actually say it. But that's how it sounds.


I think parent clearly didn't think it sounds like that. I don't think it sounds like that. Perhaps you should examine why you think it sounds like that.


Considering his downvotes it's clear I'm not the only one.


I think mratzloff's comment is a better explanation for that... sorry for turning this into reddit.


I could do it for free with the alarm snooze feature on my 5 year old blackberry.


That would create an alarm that you must reset every five minutes, rather than simply notifying you in the background that five minutes have passed.


Walking around with a phone strapped to your wrist would be awkward.


And yet people strap them to their arms while running around town wearing nothing but spandex.


Could you code a solution for the Boggle problem in 45 minutes?


Given function that checks if given string is a word accepted by the game or a sorted good words list, I think I would be able to. It's a very similar algorithm to queens problem. I'll try doing this and tell you!


This just boils down to populating an 8 element array with all the numbers from 0 - 7, where abs(x[n] - x[m] != abs(n - m))


Right! I did that solution in response to a Byte magazine contest years ago. It ran in 20 minutes in Basic on an HP2000.

The tricky part is permuting the array. I used a recursive swap routine, swapping to the right and testing if the array were valid to the left of i then recursing i+1. If it fails you don't have to recurse, you can pop, trimming the search tree drastically. There were 8 or 9 solutions if I remember right, less if you eliminate rotations and mirrors. {edit: 12 solutions}


Because he is from Brazil.


What interesting things are you doing during those gaps?


> Moral of the story, once you know you want to leave, talk to your manager. Be a nice guy.

Before making sure you have something else lined up first?


I suppose every company or team is different. But almost everyone on my team told me they are moving on about the same time they started looking.

This is beneficial both ways:

* A smooth transition can be made. They get to wrap up their last project at the company and have enough time to do a proper knowledge transfer

* We get a head start on hiring a replacement. Typically the person leaving gets to help out during the interview process as well.

* I get to help the person leaving on picking out the right next opportunity and more often than not, help the person negotiate his next job offer.


There is nothing wrong in looking after other opportunities, just like as an employer you would constantly look after new candidates, welcome to 2013! Manager will assume that you have something else lineup up already anyway.


> A co-ordinator of a college program for the inmates told me that they have a CS course, but can't find anyone to teach it because the students will not be allowed to use computers.

Where is this?


I'd keep looking in my spare time. Why quit before you have something else lined up? I'd have to evaluate why it was bad, how bad it was, and how well I could mitigate the problem(s) when determining if I wanted to look for another job. It would have to be fairly bad for me not to give it at least a month - more than just me thinking it wasn't quite as cool as I thought it would be. I don't see how it would hurt your record if you found another job and left within a month - you could just leave that one job off your resume.


Why is Rhino coming soon?


That was "Javascript on the JVM is coming soon".

I don't think Rhino's being used much in production (correct me if I'm wrong) perhaps because of slow execute times, but the far racier Nashorn is likely to kick out any lingering use of languages used for JVM scripty stuff, e.g. Groovy, Xtend, Beanshell.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: