61–70 of 289 posts
Why is summing a list of numbers 1 to N O(N^2) instead of O(N), don't you just iterate through the set of numbers once? EDIT: Nevermind, I think it means the value of the sum is on the order of n^2
How is your H1B still valid after you lost(?) your job and left the country? H1B is tied to an employer and a specific job, so I don't know how it's still active. Are you sure that your H1B hasn't expired yet? If you try to enter on an expired H1B, you might get banned from entering for 10 years (this happened to my friend 6 months ago) so make sure your immigration status is rock solid.
In fact, in such cases, you don't even need a new visa stamp for the transferred H1B. As long old H1B stamp has not expired, you can present this H1B along with the approved transfer petition and they will let you in.
This is just my understanding of the process and does not constitute legal advice. I am not an immigration attorney or any such. Just a technology guy -:)
I never really know what to do during negotiation time. During the first interview, I'm usually asked how much. I'm told that I should always try to push it back for the other person to make the first offer. However in matter how hard I try, they demand that I make the first offer. I don't want to aim too high or too low in fear that I'd lose out on the opportunity.
(sorry for sidetracking the excellent piece but...) When I examine the ~13,000 hours I've spent programming I find it hilarious that interviews should centre around algorithmic problems. I've been guilty of it myself and failing FizzBuzz is definitely a true negative but it's so little of a true positive it's not even funny. What I would really love to know about you as a candidate is: - do you know how to actually n…
(think parsing and searching monster flat text databases from disk)
I never really know what to do during negotiation time. During the first interview, I'm usually asked how much. I'm told that I should always try to push it back for the other person to make the first offer. However in matter how hard I try, they demand that I make the first offer. I don't want to aim too high or too low in fear that I'd lose out on the opportunity.
The key is, you should want to aim too high! They're not going to say 'no, and never darken our door again' (or if they do, then you had a lucky escape - if they're that nasty and irrational at negotiation time, what would they be like to work for after they had you in the door??)
They'll say some variant of no - 'that's a little higher than we were thinking of' or 'ha ha, very funny' or 'well we were looking at something closer to typical market salary' or 'I'm afraid there's no way our budget would cover that' or however they want to put it, the point is, they're not willing to go as high as the number you named, which is good - if they were, that would probably have meant you were leaving money on the table.
Then you say 'okay, what sort of figure were you thinking of?' Now you're negotiating.
This may very well have been an excellent piece. But, the author lost me no later than 2 sentences in with his immature and sexist "nerdy girl" analogy. I just didn't even bother to read the rest. Working in silicon valley myself, I already waste enough time on people who think this kind of immature male mindset is okay.
That is a shallow and inaccurate assessment of what's one the best articles that's been posted in the past month.
"sum of the numbers from 1 to N is O(N^2)" Maybe I'm misunderstanding you, but no it isn't. it's O(N) if you have to traverse a list of numbers it's actually constant time if the numbers are sequential.
> “Design the infrastructure for a link-shortener.” I'm wondering how to answer that? * Get a short and memorizable url. * When you enter an URL hash it, put it in a hash table and use the hash for the link. > “If I type https://google.com into my browser and press enter, what happens?” How would you guys answer this one? I'm not sure I've enough knowledge to do that. I'd say: * first TLS handshake thanks to RSA to s…
I've had it twice. The first time, with Google, they were genuinely interested to know how deep I could go, so I talked about DNS, TCP, SSL, HTTP etc, but I also talked about application event loops and keyboard drivers and interrupt handlers.
The second time, with Rackspace, I presumed they want the same, but they were a bit bewildered and wanted to keep it higher level (protocols only).
(sorry for sidetracking the excellent piece but...) When I examine the ~13,000 hours I've spent programming I find it hilarious that interviews should centre around algorithmic problems. I've been guilty of it myself and failing FizzBuzz is definitely a true negative but it's so little of a true positive it's not even funny. What I would really love to know about you as a candidate is: - do you know how to actually n…
Why is summing a list of numbers 1 to N O(N^2) instead of O(N), don't you just iterate through the set of numbers once? EDIT: Nevermind, I think it means the value of the sum is on the order of n^2
The sum of the numbers is O(1) - you can calculate it algorithmically.
N*(N+1)/2