Jul 01, 2014
Happy birthday to me!
As a quick fun thing to do today, I've created a personalized birthday wish generator using Markov chains. The code is pretty simple and unremarkable, and I've made it available as a gist. Play with the online version here! Sorry, I'll also party normally later :-) #nerd
Jun 08, 2014
Say "No" to the Open/Closed pattern
The open/closed principle is the second of the five SOLID principles. The best place to start to try and understand it is probably Uncle Bob's article on it, but you can also take a look at the Wikipedia page or read about it in Bertrand Meyer's "Object-Oriented Software Construction" book. The canonical description is Software entities (classes, modules, functions, etc.) should be open for extension, but closed for modification. The best critique you can find is the one by the amazing Jon Skeet…
May 06, 2014
I don't love the single responsibility principle
courtesy of wikipedia Did you ever happen to disagree with a colleague on the single responsibility principle and its application? Let's try to understand why that could be the case. I once worked with a colleague, whom we shall call Stan, who had a very different understanding of the single responsibility principle than I had. During code reviews, his feedback would often be that my classes "tried to do too much" and broke the single responsibility principle. My feedback to his patches was ofte…
Jan 20, 2014
Speaking engagements for spring 2014
Here are the confirmed engagements for spring 2014. I'm honored to be invited to travel to Asia, in China and Japan. Excellent! 25-27 April - QCon Beijing 2014 - Beijing, China 30 April - QCon Tokyo 2014 - Tokyo, Japan 21 May - DevSum 2014 - Stockholm, Sweden 22 May - InfoShare 2014 - Gdansk, Poland
Jan 14, 2014
Keynoting Community Days 2014
I have been invited to offer a keynote at Community Days 2014 in Milan. I will be giving an Italian version of the Architecture of Stack Overflow talk: Come funziona Stack Overflow: dall'architettura server ai tool di sviluppo This will be held Wednesday 26 February 2014 at 10:00 / 11:00 at Microsoft Italia - Via Lombardia 2/a-1, 20068 Peschiera Borromeo (MI) More info on the official site, including a something for your calendar.
Oct 02, 2013
New speaking engagement: Hacker News London on October 23rd
I am honored to announce that I will be speaking at the Hacker News London meet up. My updated speaking agenda: September 20th — The Architecture of Stack Overflow at DevDay 2013, Krakow, Poland Oct 23rd — Architecture of Stack Overflow -- the TL;DR at Hacker News London, London,United Kingdom October 28th — The Architecture of Stack Overflow at WebTechCon/International PHP Day 2013, München, Germany October 28th — Lean Engineering at Stack Exchange at WebTechCon/International PHP Day 2013, Münc…
Sep 13, 2013
New speaking engagement: Developer Conference 2013
I am happy to announce that I've been asked to give a talk about the Architecture of Stack Overflow at Developer Confererence 2013. My speaking agenda therefore looks as follows: September 20th — The Architecture of Stack Overflow at DevDay 2013, Krakow, Poland October 28th — The Architecture of Stack Overflow at WebTechCon/International PHP Day 2013, München, Germany October 28th — Lean Engineering at Stack Exchange at WebTechCon/International PHP Day 2013, München, Germany Nov 7th — The Archit…
Jul 22, 2013
Speaking in Krakow and Munchen
I'm proud to announce a double speaking engagement this fall. DevDay 2013 20/09/2013, Kraków (Poland) I will be speaking about the Architecture of Stack Overflow. WebTech Conference 2013 27–30/10/2013 München (Germany) I will be giving two talks, one about the Architecture of Stack Overflow and the other about Lean engineering at Stack Exchange. Architecture of Stack Overflow The Stack Exchange network is a huge success story which now counts more than a hundred sites, millions of users and half…
Jun 26, 2013
Answer for "Christmas visit nightmare"
TL;DR: Not only I did get an answer by an egregious reader (hi Emmet!), but it was a really good one. The way to solve the problem is to use an algorithm known as "earliest deadline first": you sort by ascending end date and then proceed in order, excluding the family members that overlap. Demonstration It's fairly easy to convince ourselves that it returns a optimal solution by following this line of reasoning. Sort the dates as specified above pick the first element Get all the visits that ove…
Jun 15, 2013
Hacking Challenge: Christmas visits nightmare!
I originally wrote this challenge in 2012 to select a few developers for my previous company. They turned it down! I still think it's a nice puzzle. I would like to publish more in the future, let's see how this goes. Instructions Subsitute //Write code here... with your awesome solution. Feel happy. If you want me to look at it, your answer to sk...@stackoverflow.com (if you can't guess the email, there's a captcha waiting for you as a punishment). If you don't want me to look at it, that's ok,…