Saturday, May 25, 2013
Maybe you’re stuck in your career and looking for that new ‘thing’ that will jump-start it back. Maybe you’ve encountered a technical problem that is just too big for your current state of knowledge. Hopefully neither of these things are true, and you’re simply looking to improve your craft and competence for the sake of becoming better. Whatever the reason, rest assured that there are things you can start doing today. Even right now, if you’re so inclined. Over the course of my years in the industry, I’ve met a lot of great developers and technical people. Many...
Monday, May 20, 2013
Yesterday I had the pleasure of speaking in front of a number of my colleagues in Sela about functional programming. My talk’s title was ‘The Essence of Functional Programming’ and it dealt with what I consider to be the primary differences between functional and other languages. Thanks to everyone who came – it was pleasure (broken air-conditioning not withstanding..)! Slide deck is available here.
Friday, May 10, 2013
I recently can across an interesting problem: Given a set of n directories, find the most nested directory that is an ancestor of all of them. This is equivalent to finding the longest common prefix. For example, if I have the following paths: /dir1/dir2/dir3
Then the longest common prefix is just /dir1/dir2. If we now add /dir1/dir5 to the set, we get:
Then the longest common prefix changes to /dir1. In order to do this, I start by comparing the first and second directories by splitting them on the / symbol, and then comparing the elements of the resulting arrays. ...