This presentation at strangeloop has been generating a lot of ink this week: http://www.youtube.com/watch?v=SWTWkYbcWU0 The presentation was somewhat interesting, the contentious point made was offering an SLA on a system without a good type system was unethical. This generated a lot of strong reactions…
Good explaination on practical issues arised in C# regarding GC: http://anasoft.wordpress.com/2007/06/17/more-about-gc-dispose-and-finalize/…
Recusive solution that uses O(n2) memory. A more memory effienct solution would use global state to flag which letters have been used while deeper in the call stack. I opted for a more functional solution without global state. In C#: …
From Cracking the Coding Interview. This solution is not complete, but it solves a useful subset of inputs and does it correctly. Getting a working solution for a subset of posisble inputs is better than an incomplete or flawed solution that tries to cover all possible cases, as long as…
From http://www.geeksforgeeks.org/forums/topic/implement-a-regular-expression-parser/: implement a simple regex parser. This is a brute force O(n2) solution that may have some rough edges, but works for most cases: …
From CareerCup.com. Find all combinations of 2 nodes which add up to a particular sum. Must have time complexity of O(n). My solution was O(nlog n), needed a hint to get the idea of using two simultaneous traversals (one in order, one reverse) to find all the…
From Cracking the Coding Interview: Implement a program to determine how many hits and pseudo-hits to return from a guess in mastermind. …