I've added links to both Night 04.28.2003 and Chicago 05.01.2003 image galleries.

I've added links to both Night 04.28.2003 and Chicago 05.01.2003 image galleries.

Here are the apartments I'm looking at in the Redmond, Washington area:

WARNING: You need to have a free Rent.com membership to view these links.

Cedar Terrace Apartments

Sammamish View Apartment Homes

Overlook at Lakemont

Park at Forbes Creek

Ravenswood

Archstone Inglewood Hill

Archstone Redmond Campus

Archstone Redmond Hill

WARNING: You need to have a free Rent.com membership to view these links.

Cedar Terrace Apartments

Sammamish View Apartment Homes

Overlook at Lakemont

Park at Forbes Creek

Ravenswood

Archstone Inglewood Hill

Archstone Redmond Campus

Archstone Redmond Hill

Well, it's official. I've been waiting a long time to post anything of substance because I knew a decision would be coming soon. I'm now officially a Program Manager at Microsoft on the Critical Response Team in the Mobile Devices Division.

I will probably be moving out there between the end of June and mid-July. I'm not sure yet. There is so much I want to accomplish before moving, so many people to see and say goodbye to, it's overwhelming. Today, I went car shopping. I think I found the one I want, but it's a bit pricy for someone who won't be seeing that first pay check for at least two months. I could wait, but I want it now! ::whine::

I will probably be moving out there between the end of June and mid-July. I'm not sure yet. There is so much I want to accomplish before moving, so many people to see and say goodbye to, it's overwhelming. Today, I went car shopping. I think I found the one I want, but it's a bit pricy for someone who won't be seeing that first pay check for at least two months. I could wait, but I want it now! ::whine::

Uh oh...

**The Dante's Inferno Test has banished you to ***the Eigth Level of Hell - the Malebolge!*

Here is how you matched up against all the levels:

**Take the Dante's Divine Comedy Inferno Test**

Here is how you matched up against all the levels:

Level | Score |
---|---|

Purgatory (Repenting Believers) | Very Low |

Level 1 - Limbo (Virtuous Non-Believers) | Very Low |

Level 2 (Lustful) | Extreme |

Level 3 (Gluttonous) | High |

Level 4 (Prodigal and Avaricious) | Very High |

Level 5 (Wrathful and Gloomy) | Extreme |

Level 6 - The City of Dis (Heretics) | Extreme |

Level 7 (Violent) | High |

Level 8- the Malebolge (Fraudulent, Malicious, Panderers) | Extreme |

Level 9 - Cocytus (Treacherous) | Extreme |

Let's see, where to begin... First, the interview from a week and a half ago! I can't divulge much information, for two reasons: 1) I haven't gotten a yes or a no from said company. 2) I had to sign an NDA before I could talk to anyone. Let's see how many details I can give away without giving it all away.

First, I was told that I would have anywhere between three and five interviews total. There ended up being a total of six, which I can only interpret as being a hopeful sign. I arrived at the recruiting building (yes, an entire building devoted to recruiting) around 8 AM and didn't end up leaving until around 6 PM. Given a half hour for lunch, that was practically nine and a half hours of interviewing!

Second, the riddles asked were fairly interesting and though I might have heard them all before, I had never solved any of them. The first one wasn't so much a riddle as a generic design question. I was asked how I would design the timing on any given traffic light. I was allowed to request whatever information desired and then I had to come up with some formulas for making the "best" traffic light. The first part of the problem was how to define "best". What makes a good traffic light? I decided it was a combination of two factors: 1) Maximum throughput in all directions. 2) Low traffic jam incidence rate. After figuring out the formula for a single intersection, I had to modify it for a grid of intersections. Then I was asked to "think outside the box" (yes, that phrase was used exactly) and figure out other ways to improve the experience. All in all, a basic design problem.

The second riddle was a programming question, something I didn't expect to encounter since I was interviewing for a management position. Managers don't code! I was given a 2D array and had to figure out the time it would take to sort it. I barely remembered performance numbers for the different sort algorithms, but I remembered that quick sort was O(n log n) (and thankfully was correct). Sorting a 2D array would thus take (O(n log n))^2. The second part to the programming question was how to sort two already sorted linked lists. This was simple, since you just setup two iterators that would move along the two lists, removing the smaller of the two items.

The riddle I had the hardest time with was the cube desk calendar. You have two cubes and you are allowed to put any single digit on any face. With these two cubes, you have to represent every number from 01 to 31. This turned out to not be that difficult when I realized you could mathematically approach this and define restrictions. Some examples of these restrictions are that you need a "1" on each block since you have to represent "11". The same thing for "2" and "22". Eventually, I got to the point where I had six open spots on the cubes but seven numbers to put on the cubes. This is when I realized that you could use "6" to represent a "9" and thus solved the puzzle.

Almost all of the riddle had a mathematic basis. The next riddle started off as a word problem. A man starts at point A on a mountain and walks up to point B in exactly 12 hours. At some time later, he walks down from point B to point A in exactly 12 hours. He does not have a constant rate of ascent or descent. The actual riddle was "Can you prove or disprove the existence of a point P where the man took the same amount of time to reach the same spot on the mountain?" I was having trouble trying to prove this, since it had to be true. Eventually, I was given a hint to use a graph. First I tried plotting time versus distance. That was dumb. Once I plotted time versus location, I showed that the plots must intersect and thus a point P does exist.

The last riddle was one I heard a long, long time ago. I knew the answer, but didn't know how to explain it at first. This was the "Let's Make a Deal" riddle: You have three doors to choose from, 1 with a prize and 2 without. After you choose your door, the host of the show will eliminate one of the doors you did not choose and then ask you to pick again. You can either stick with your original door or choose the remaining door. The question is, do you stay or do you switch and why? I knew you were supposed to switch, but couldn't think off the top of my head why. Finally I realized that your initial chance at winning was only 1 in 3. After the elimination, your chance is at least 2 in 3. Switching is smart.

Ok, that was the first of more updates. I gotta run now though.

First, I was told that I would have anywhere between three and five interviews total. There ended up being a total of six, which I can only interpret as being a hopeful sign. I arrived at the recruiting building (yes, an entire building devoted to recruiting) around 8 AM and didn't end up leaving until around 6 PM. Given a half hour for lunch, that was practically nine and a half hours of interviewing!

Second, the riddles asked were fairly interesting and though I might have heard them all before, I had never solved any of them. The first one wasn't so much a riddle as a generic design question. I was asked how I would design the timing on any given traffic light. I was allowed to request whatever information desired and then I had to come up with some formulas for making the "best" traffic light. The first part of the problem was how to define "best". What makes a good traffic light? I decided it was a combination of two factors: 1) Maximum throughput in all directions. 2) Low traffic jam incidence rate. After figuring out the formula for a single intersection, I had to modify it for a grid of intersections. Then I was asked to "think outside the box" (yes, that phrase was used exactly) and figure out other ways to improve the experience. All in all, a basic design problem.

The second riddle was a programming question, something I didn't expect to encounter since I was interviewing for a management position. Managers don't code! I was given a 2D array and had to figure out the time it would take to sort it. I barely remembered performance numbers for the different sort algorithms, but I remembered that quick sort was O(n log n) (and thankfully was correct). Sorting a 2D array would thus take (O(n log n))^2. The second part to the programming question was how to sort two already sorted linked lists. This was simple, since you just setup two iterators that would move along the two lists, removing the smaller of the two items.

The riddle I had the hardest time with was the cube desk calendar. You have two cubes and you are allowed to put any single digit on any face. With these two cubes, you have to represent every number from 01 to 31. This turned out to not be that difficult when I realized you could mathematically approach this and define restrictions. Some examples of these restrictions are that you need a "1" on each block since you have to represent "11". The same thing for "2" and "22". Eventually, I got to the point where I had six open spots on the cubes but seven numbers to put on the cubes. This is when I realized that you could use "6" to represent a "9" and thus solved the puzzle.

Almost all of the riddle had a mathematic basis. The next riddle started off as a word problem. A man starts at point A on a mountain and walks up to point B in exactly 12 hours. At some time later, he walks down from point B to point A in exactly 12 hours. He does not have a constant rate of ascent or descent. The actual riddle was "Can you prove or disprove the existence of a point P where the man took the same amount of time to reach the same spot on the mountain?" I was having trouble trying to prove this, since it had to be true. Eventually, I was given a hint to use a graph. First I tried plotting time versus distance. That was dumb. Once I plotted time versus location, I showed that the plots must intersect and thus a point P does exist.

The last riddle was one I heard a long, long time ago. I knew the answer, but didn't know how to explain it at first. This was the "Let's Make a Deal" riddle: You have three doors to choose from, 1 with a prize and 2 without. After you choose your door, the host of the show will eliminate one of the doors you did not choose and then ask you to pick again. You can either stick with your original door or choose the remaining door. The question is, do you stay or do you switch and why? I knew you were supposed to switch, but couldn't think off the top of my head why. Finally I realized that your initial chance at winning was only 1 in 3. After the elimination, your chance is at least 2 in 3. Switching is smart.

Ok, that was the first of more updates. I gotta run now though.

Ok, everyone has been bugging the hell out of me to post, so here comes a barrage of updates.

- Cable cleanup!
- Beautiful sentiment from Hemingway:INTERVIEWER Cou...
- I love Craigslist but I abhor their search and cat...
- Learn to love your car again
- Great primer on Flash AS3, especially if you've co...
- Mystery Meat UI in Blender
- Adobe Help, you're on notice!
- Hey Apple, what's wrong with Backspace?
- Direct Manipulation
- Xbox 360 #1 RIP

- May 2000
- June 2000
- July 2000
- August 2000
- September 2000
- October 2000
- November 2000
- December 2000
- January 2001
- February 2001
- March 2001
- April 2001
- June 2001
- July 2001
- August 2001
- November 2001
- March 2002
- April 2002
- May 2002
- June 2002
- July 2002
- August 2002
- September 2002
- February 2003
- March 2003
- April 2003
- May 2003
- June 2003
- July 2003
- August 2003
- September 2003
- October 2003
- November 2003
- December 2003
- January 2004
- February 2004
- March 2004
- April 2004
- May 2004
- June 2004
- July 2004
- August 2004
- September 2004
- October 2004
- November 2004
- December 2004
- January 2005
- February 2005
- March 2005
- April 2005
- May 2005
- June 2005
- July 2005
- August 2005
- September 2005
- October 2005
- November 2005
- December 2005
- January 2006
- February 2006
- March 2006
- April 2006
- May 2006
- July 2006
- August 2006
- September 2006
- October 2006
- November 2006
- December 2006
- January 2007
- February 2007
- March 2007
- April 2007
- May 2007
- June 2007
- July 2007
- August 2007
- September 2007
- October 2007
- November 2007
- December 2007
- January 2008
- May 2008
- June 2008
- July 2008
- August 2008
- September 2008
- December 2008