| Author |
Message |
bugzpodder
|
 Posted: Wed Nov 17, 2004 11:22 pm Post subject: microsoft |
|
|
| It doesnt happen everyday when microsoft suddenly emails you about wanting to get an interview without having to ask for one. and i just had one of those days... I will see how things play out tomorrow |
|
|
|
|
 |
Sponsor
Sponsor
|
|
|
Martin
|
| Posted: Thu Nov 18, 2004 1:28 am Post subject: (No subject) |
|
|
| Congratulations. I have an interview tomorrow too, with Four Season Hotels and Resorts. |
|
|
|
|
|
zomg
|
| Posted: Thu Nov 18, 2004 7:35 am Post subject: (No subject) |
|
|
they just asked out of the blue?
thats awsome and slightly weird
if u get the job send us a copy of windows longhorn lol 
congrats! |
|
|
|
|
|
bugzpodder
|
| Posted: Thu Nov 18, 2004 9:26 am Post subject: (No subject) |
|
|
| i'll see if they ask any interesting questions and post it here |
|
|
|
|
|
Andy
|
| Posted: Thu Nov 18, 2004 10:35 am Post subject: (No subject) |
|
|
| wheres the interview at |
|
|
|
|
|
bugzpodder
|
| Posted: Thu Nov 18, 2004 1:00 pm Post subject: (No subject) |
|
|
| skool |
|
|
|
|
|
wtd
|
| Posted: Thu Nov 18, 2004 2:15 pm Post subject: (No subject) |
|
|
Microsoft has invested heavily in the University of Waterloo, and is known to recruit heavily there.
Good luck selling your soul.  |
|
|
|
|
|
josh
|
| Posted: Thu Nov 18, 2004 2:22 pm Post subject: (No subject) |
|
|
| congrats man, give us the dirt on longhorn!!!!! |
|
|
|
|
|
Sponsor
Sponsor
|
|
|
Amailer
|
| Posted: Thu Nov 18, 2004 3:14 pm Post subject: (No subject) |
|
|
wtd wrote: Microsoft has invested heavily in the University of Waterloo, and is known to recruit heavily there.
Good luck selling your soul.
strange, when PATCHU or w/e his name is (the guy who created MSN +) he said something to that effect "selling his soul when he goes to paris for his interview with M$" apprently M$ was trying to get a deal with him  iunno but cool  |
|
|
|
|
|
bugzpodder
|
| Posted: Thu Nov 18, 2004 4:33 pm Post subject: (No subject) |
|
|
| the interview mainly consists of the question: If you have an array of size N, and each element is between 1 and N-1... return a duplicate element |
|
|
|
|
|
Andy
|
| Posted: Thu Nov 18, 2004 5:59 pm Post subject: (No subject) |
|
|
| any duplicate element? |
|
|
|
|
|
bugzpodder
|
| Posted: Thu Nov 18, 2004 6:22 pm Post subject: (No subject) |
|
|
| yes |
|
|
|
|
|
Andy
|
| Posted: Thu Nov 18, 2004 6:23 pm Post subject: (No subject) |
|
|
| o.. thats not hard... |
|
|
|
|
|
bugzpodder
|
| Posted: Thu Nov 18, 2004 6:29 pm Post subject: (No subject) |
|
|
Take N=2^32-1
if you find a solution that takes O(1) space and O(N) complexity, give me a howl |
|
|
|
|
|
Dan
|
| Posted: Fri Nov 19, 2004 1:23 am Post subject: (No subject) |
|
|
wtd wrote:
Good luck selling your soul.
No kidding i whould work at micdonals b4 i worked for M$. I mean just for what they where/are planing in longhorn u should be scared to even talk to them. |
| Computer Science Canada
Help with programming in C, C++, Java, PHP, Ruby, Turing, VB and more! |
|
|
|
|
|
Register
Wiki
Blog
Search
Turing
Chat Room
Members
