|
experience a more beautiful web snype
|
#
?
May 4, 2012 16:04
|
|
|
|
| # ? Apr 19, 2024 11:48 |
|
|
guess they were tired of your av breaking their beautiful browser experience (by causing it to crash)
|
|
#
?
May 4, 2012 16:05
|
|
|
they should have been using opera
|
|
#
?
May 4, 2012 16:07
|
|
|
tef's flapping his gums
|
|
#
?
May 4, 2012 16:08
|
|
|
tef posted:they should have been using opera
|
|
#
?
May 4, 2012 16:09
|
|
|
Char posted:tef's flapping his gums I don't even have any machines that can run IE9 I'm totally freaking out 
|
|
#
?
May 4, 2012 16:12
|
|
|
obviously what I need to do is find out who bought me it and buy them my old av
|
|
#
?
May 4, 2012 16:13
|
|
|
ahhh spiders posted:
|
|
#
?
May 4, 2012 16:14
|
|
|
Sniep posted:nice mba, left side dock supremacy
|
|
#
?
May 4, 2012 16:15
|
|
|
Internaut! posted:kid I know is a flash developer at a top media shop, google called him up and said we'd like to interview you, in the interview they asked him all kinds of questions about things like inodes and efficient pointer/bitshift operations uh sounds good? last thing anyone wants to do is hire flash devs
|
|
#
?
May 4, 2012 16:39
|
|
|
tef posted:OH poo poo I'VE BEEN SHAGGARED oh thank god now i'll actually be able to read ur posts
|
|
#
?
May 4, 2012 16:55
|
|
|
i'm never going to forget the  attempt at an algorithms question i got in my last interview. maybe one of you can make some sense of what the gently caress he was trying to get at:him: "so, you have a circular linked list, you don't know where it starts or ends, and you want to know when you've visited every element. but you can't save anything!" me: "..." him: "but i'll give you a hint: you have two pointers" me: "uh, leave one pointer at the first element you have, traverse the list with the other, and when the two pointers are equal again, you've been through the whole list" him: "no no no, you can't save anything! all you have are these two pointers!" that went back and forth for about ten minutes before i gave up and said i must not understand the question, chalked it up to his broken english. at the end of the interview when he asked if i had any questions for him, i said yeah, what the gently caress answer were you looking for there and he gets this sly grin on his face and explains that every time you move one pointer ahead by one node, you move the other pointer ahead TWO nodes, and when the pointers equal each other, you've been through the whole list. the punchline is that this man is now my boss
|
|
#
?
May 4, 2012 16:59
|
|
|
if someone asks you about pointers its a good sign u should get up and walk out
|
|
#
?
May 4, 2012 17:02
|
|
|
Werthog posted:i'm never going to forget the Tortoise and hare is the algorithm he wanted you to mention.
|
|
#
?
May 4, 2012 17:03
|
|
|
Sniep posted:i have taht book it's how i learned lua
|
|
#
?
May 4, 2012 17:03
|
|
|
Werthog posted:and he gets this sly grin on his face and explains that every time you move one pointer ahead by one node, you move the other pointer ahead TWO nodes, and when the pointers equal each other, you've been through the whole list. goddamnit
|
|
#
?
May 4, 2012 17:04
|
|
|
MononcQc posted:Tortoise and hare is the algorithm he wanted you to mention. i love interview questions where the conversation goes "well, yes, i guess you could solve it that way but... okay yes that too... okay also that works but have you considered this one solution i read about on slashdot in 2004. no? oh well that's ok  "
|
|
#
?
May 4, 2012 17:04
|
|
|
MononcQc posted:Tortoise and hare is the algorithm he wanted you to mention. this makes perfect sense because, knowing him, he probably flipped open that algorithms textbook that's sitting on his desk (you all know the one) to a random page and spent five seconds trying to memorize it before i came in for the interview. reading comprehension is not his strong suit
|
|
#
?
May 4, 2012 17:11
|
|
|
Werthog posted:i'm never going to forget the he was right
|
|
#
?
May 4, 2012 17:14
|
|
|
lmao and you decided to work there
|
|
#
?
May 4, 2012 17:14
|
|
|
pay's good, benefits are good, and i don't do poo poo so, yeah
|
|
#
?
May 4, 2012 17:15
|
|
|
Werthog posted:this makes perfect sense because, knowing him, he probably flipped open that algorithms textbook that's sitting on his desk (you all know the one) to a random page and spent five seconds trying to memorize it before i came in for the interview. reading comprehension is not his strong suit heh. whose isn't.
|
|
#
?
May 4, 2012 17:15
|
|
|
Werthog posted:i'm never going to forget the his phrasing's wrong or whatever but in the totally generic interview question version of this it's a linked-list with a possible cycle in it, as opposed to a completely circular list, which means you can't just leave one pointer sitting at the first element because the first element might not be in the cyclic portion of the list. not that it sounds like he got that anyway. it's still a dumb gotcha question though.
|
|
#
?
May 4, 2012 17:15
|
|
|
dazjw posted:his phrasing's wrong or whatever but in the totally generic interview question version of this it's a linked-list with a possible cycle in it, as opposed to a completely circular list, which means you can't just leave one pointer sitting at the first element because the first element might not be in the cyclic portion of the list. not that it sounds like he got that anyway. are you seriously using this contrived example to defend what happened
|
|
#
?
May 4, 2012 17:16
|
|
|
yeah it's a complete mischaracterization (wtf stupid spell check, poo poo's right) of the actual problem, plus a total feint with the "you can't save anything" thrown in
|
|
#
?
May 4, 2012 17:19
|
|
|
ahhh spiders posted:are you seriously using this contrived example to defend what happened its not a contrived example it's just how the question is meant to go. you've got a linked list and two pointers and there might be a cycle that starts at some point that is not the head element, how do you find it. not that you should need to be second guessing your interviewers to actually ask their questions correctly
|
|
#
?
May 4, 2012 17:21
|
|
|
lol at thinking that a linked list with a cycle in it == circular linked list
|
|
#
?
May 4, 2012 17:34
|
|
|
dazjw posted:its not a contrived example it's just how the question is meant to go. you've got a linked list and two pointers and there might be a cycle that starts at some point that is not the head element, how do you find it. what are you talking about? is this some example from an interview questions book? that's not what he was asked. there's no "supposed to"
|
|
#
?
May 4, 2012 17:36
|
|
|
now that i think about it, i think he even started out asking the question correctly, then changed his mind mid-question and made it a circular linked list instead to make it "easier." but then when i gave him an answer that worked for the simpler case, he couldn't comprehend the possibility that it was correct because it wasn't the one he was thinking of this pattern has repeated itself many times since then
|
|
#
?
May 4, 2012 17:40
|
|
|
a smart interviewer would give you the example of the basic circular linked list, then after you gave an answer they would expand/change the problem to a linked list with cycles somewhere in it
|
|
#
?
May 4, 2012 17:42
|
|
|
this thread in one tab, about eight different wikipedia articles in others man. algorithms and data structures and poo poo. gotta get a book. self-teach it. maybe one of those colleges that does the open free online course stuff will have an algos one?
|
|
#
?
May 4, 2012 17:47
|
|
|
what exactly are you trying to do
|
|
#
?
May 4, 2012 17:49
|
|
|
Anal Tributary posted:this thread in one tab, about eight different wikipedia articles in others one just ended but i think the material's still up https://class.coursera.org/algo/class/index e: and he's re-running it in a month or so
|
|
#
?
May 4, 2012 17:51
|
|
|
ahhh spiders posted:what exactly are you trying to do learn actual computer science concepts i guess. i mean i don't really like the idea of "learn poo poo to pass an interview," i'd like to be a better coder too.
|
|
#
?
May 4, 2012 17:52
|
|
|
wanting to take "a course on algos" makes me laff almost as much as when people refer to their CS programme's "maths module"
|
|
#
?
May 4, 2012 17:54
|
|
|
Werthog posted:one just ended but i think the material's still up https://class.coursera.org/algo/class/index wow this coursera thing looks like a big education product but the design is unmodified twitter bootstrap, rofl cmon yall even if you ain't a designer you gotta at least change the default font stack or tweak some colors or something i've talked about this in irc before but i've never seen it used in an actual product this brazenly lol anyways this looks really cool! thank you for the link. Rufo posted:wanting to take "a course on algos" makes me laff almost as much as when people refer to their CS programme's "maths module" explain?
|
|
#
?
May 4, 2012 17:55
|
|
|
Rufo posted:wanting to take "a course on algos" makes me laff almost as much as when people refer to their CS programme's "maths module" my algorithms course in school was probably the best one out of all the courses i took in terms of challenging me. that was probably 90% the instructor i had not being a loving moron though
|
|
#
?
May 4, 2012 17:56
|
|
|
Anal Tributary posted:learn actual computer science concepts i guess. i mean i don't really like the idea of "learn poo poo to pass an interview," i'd like to be a better coder too. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/
|
|
#
?
May 4, 2012 17:56
|
|
|
Anal Tributary posted:learn actual computer science concepts i guess. i mean i don't really like the idea of "learn poo poo to pass an interview," i'd like to be a better coder too. are you trying to get a job in the industry because if they don't see a degree and you don't have experience it's probably not going to happen
|
|
#
?
May 4, 2012 17:57
|
|
|
|
| # ? Apr 19, 2024 11:48 |
|
|
ahhh spiders posted:are you trying to get a job in the industry because if they don't see a degree and you don't have experience it's probably not going to happen pretty sure he's in school and just needs an internship but he thinks if he doesn't have 5+ years of professional experience nobody's going to give him one
|
|
#
?
May 4, 2012 17:59
|
|