Please register to participate in our discussions with 2 million other members - it's free and quick! Some forums can only be seen by registered members. After you create your account, you'll be able to customize options and access all our 15,000 new posts/day with fewer ads.
Sorry to hear that. I have an interview tomorrow. I hope I don't get ostracized by the interviewer. I don't really want the job but I feel I have no choice. If I were to not accept the job position, I would be making a very bad mistake.
I agree with the other posters. You dodged a bullet. Can you imagine dealing with this on a regular basis?No thank you!
You know, your story sounded a little off to me, like either you weren't telling us something or you missed what their real problem was. After seeing your recent status change to " Keep America White" I now have a theory as to what really happened. Did you express that sentiment at any time during this process? That would have been a good reason for them to show you the door, no matter how good your tech skills may be.
You know, your story sounded a little off to me, like either you weren't telling us something or you missed what their real problem was. After seeing your recent status change to " Keep America White" I now have a theory as to what really happened. Did you express that sentiment at any time during this process? That would have been a good reason for them to show you the door, no matter how good your tech skills may be.
Yeah, wtf is that? Perhaps he didn't wear his best hood to the interview.
Hubby says: the interviewers were correct, and your algorithm was incomplete.
If V = min{a(1), a(2)} then V will never = a(2)> a(1). Your second statement will never be true.
A better solution is:
Set V = min{a(1), b(1)}
If V= a(1) then increment count by 1, and then compare min{a(2), b(1)} ....
The opposite if V = b(1)Iterate until count = (n+m)/2
better way to do this is(in the real world) to combine both arrays into one array, then sort it again.
If the count is odd number, then just use the middle number, if it is even, and use total of the two muddle number /2.
Of course unless they don't allow you to do it that way.
lol software engineering. I felt so good going into this interview. Had no idea the guy was going to shut me down for no reason that I can tell. I was giving great answers, I thought. Almost felt like some hazing ritual.
i do the same thing and you wouldn't believe the number of total idiot employers out there. too many arrogant jerks at these places who think they are God's gift to IT. though i've never had an interview end like that. usually if the employer doesn't like you, they just don't send you on to the next person and instead allow you to leave then never get back to you - one way or the other. get's frustrating i know but those aren't the kind of places i would want to work for anyway.
btw, i don't even know the answer to that question and i've been doing this a long time. must have been a C position.
Ouch, if someone asked me "Find the median of two sorted arrays" I'd think I would cross my eyes, stick out my tongue and then place my finger to my forehead, right between both cocked eyes! Certainly would have been the wrong answer too, OP.
Thanks for the laugh. Heehee.
Please register to post and access all features of our very popular forum. It is free and quick. Over $68,000 in prizes has already been given out to active posters on our forum. Additional giveaways are planned.
Detailed information about all U.S. cities, counties, and zip codes on our site: City-data.com.
Please register to participate in our discussions with 2 million other members - it's free and quick! Some forums can only be seen by registered members. After you create your account, you'll be able to customize options and access all our 15,000 new posts/day with fewer ads.
Certainly would have been the wrong answer too, OP. 
