Comments for Olivier Yiptong's blog http://www.oliyiptong.com/blog Tue, 07 Oct 2008 09:04:42 +0000 http://wordpress.org/?v=2.6.2 Comment on Ack! by Rich http://www.oliyiptong.com/blog/2008/10/04/ack/#comment-85476 Rich Sat, 04 Oct 2008 21:07:56 +0000 http://www.oliyiptong.com/blog/?p=81#comment-85476 Ha! Ha!

]]> Comment on The culture of failure by Andrew Louis http://www.oliyiptong.com/blog/2008/09/23/the-culture-of-failure/#comment-82634 Andrew Louis Tue, 23 Sep 2008 19:47:25 +0000 http://www.oliyiptong.com/blog/?p=73#comment-82634 Except when it's too expensive to fail... We're lucky to be in the software industry where failures *usually* aren't the end of the world but there are certainly lots of deadly counterexamples (Therac-25) Kevin Kelly just posted about this today. For instance, take airplane design. Failures are rare but completely catastrophic. This makes it hard to rely on smaller/minor failures. What's the solution? He calls it "looking for ugly." It's a really great post: http://www.kk.org/thetechnium/archives/2008/09/looking_for_ugl.php Except when it’s too expensive to fail…

We’re lucky to be in the software industry where failures *usually* aren’t the end of the world but there are certainly lots of deadly counterexamples (Therac-25)

Kevin Kelly just posted about this today. For instance, take airplane design. Failures are rare but completely catastrophic. This makes it hard to rely on smaller/minor failures.

What’s the solution? He calls it “looking for ugly.” It’s a really great post: http://www.kk.org/thetechnium/archives/2008/09/looking_for_ugl.php

]]> Comment on Amazon SDE in-person interview by oli http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-69203 oli Mon, 11 Aug 2008 19:57:38 +0000 http://www.oliyiptong.com/blog/?p=9#comment-69203 Assuming there are no duplicates, a tradeoff between space and running time can be made: Make an array that can contains enough space for the difference between the largest and the smallest integer. For 1 million integers, that makes it a minimum of 1 million bits. We only need to store a bit of information, just 0 or 1. Iterate through the list of integers, store a '1' bit to the corresponding index in the array. When done, iterate through the array, and for each index, if the resulting bit is not 0, output the index. Voilà! If duplicates are in the mix, just store more than a bit... Assuming there are no duplicates, a tradeoff between space and running time can be made:

Make an array that can contains enough space for the difference between the largest and the smallest integer.
For 1 million integers, that makes it a minimum of 1 million bits.

We only need to store a bit of information, just 0 or 1.

Iterate through the list of integers, store a ‘1′ bit to the corresponding index in the array.
When done, iterate through the array, and for each index, if the resulting bit is not 0, output the index.

Voilà!

If duplicates are in the mix, just store more than a bit…

]]> Comment on Amazon SDE in-person interview by David http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-66809 David Wed, 06 Aug 2008 12:54:53 +0000 http://www.oliyiptong.com/blog/?p=9#comment-66809 Can you share the answer of Interview 3? You can send it to my email @ davylw@gmail.com. I appreciate it. Can you share the answer of Interview 3? You can send it to my email @ davylw@gmail.com.

I appreciate it.

]]> Comment on Just do it by Chris http://www.oliyiptong.com/blog/2008/04/25/just-do-it/#comment-48557 Chris Sat, 26 Apr 2008 05:22:41 +0000 http://www.oliyiptong.com/blog/?p=53#comment-48557 You can watch the talks here. http://blog.justin.tv/2008/04/startup-school.html You can watch the talks here.

http://blog.justin.tv/2008/04/startup-school.html

]]> Comment on 18 minutes with an agile mind by Roland Eck http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-48037 Roland Eck Tue, 22 Apr 2008 00:50:18 +0000 http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-48037 haha very entertaining speaker he's totally off the wall. I like his remark about if you want to know the future ask the kindergarden teacher. haha very entertaining speaker he’s totally off the wall.

I like his remark about if you want to know the future ask the kindergarden teacher.

]]> Comment on 18 minutes with an agile mind by oli http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-45925 oli Sun, 30 Mar 2008 05:01:16 +0000 http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-45925 thanks ahsan. i was probably thinking about the rockband party on wed night too much =D thanks ahsan. i was probably thinking about the rockband party on wed night too much =D

]]> Comment on 18 minutes with an agile mind by ahsan http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-45896 ahsan Sat, 29 Mar 2008 19:19:02 +0000 http://www.oliyiptong.com/blog/2008/03/29/18-minutes-with-an-agile-mind/#comment-45896 hey oli, his name is clifford stoll, not richard. :) hey oli, his name is clifford stoll, not richard.

:)

]]> Comment on The Amazon SDE Phone Interview 2 by zdmytriv http://www.oliyiptong.com/blog/2006/05/24/the-amazon-phone-interview-2/#comment-40234 zdmytriv Sun, 27 Jan 2008 01:33:08 +0000 http://www.oliyiptong.com/blog/?p=7#comment-40234 Quicksort will take O(n) then compare for each i=0..n: (a[i] + a[i+1]) O(n) + O(n) = O(2n) = O(n) Quicksort will take O(n)
then compare for each i=0..n: (a[i] + a[i+1])
O(n) + O(n) = O(2n) = O(n)

]]> Comment on The Amazon SDE Phone Interview 2 by Gowrishankar http://www.oliyiptong.com/blog/2006/05/24/the-amazon-phone-interview-2/#comment-38688 Gowrishankar Thu, 03 Jan 2008 14:27:13 +0000 http://www.oliyiptong.com/blog/?p=7#comment-38688 Hi Oliver, could you explain me the solution you gave for the 4 player client-server architecture game? Thanks Gowri Hi Oliver,

could you explain me the solution you gave for the 4 player client-server architecture game?

Thanks
Gowri

]]>