Simon André Forsberg

The title is a joke on how some people take a lot of selifes pictures Recently, in The 2nd Monitor, there was a brief discussion on selfie answers, starting with this post. At one point, a user said this: I immediately thought: this is the perfect opportunity for an SEDE query! Try it out! The above query takes the user's ID and returns a list of all the selfie answers that they have posted.

The basic algorithm you use is logical, and well presented. The general style is standard, and I see no issues there. I believe the algorithm can be changed slightly to make the comparison code simpler, but the performance will still be comparable. I looked for edge cases I would have expected, specifically relating to large differences, but you appear to have covered that well. Unfortunately, your pair-counts for are all off. For example, your third test case: should have a count of 6, and not 18.

One think that I quickly noticed is the ammount of repetitions. But one that highly ticked me of is the ammount of tries. You could use an early return, like this: There, we cleaned up the ties! You have misspelled twice. For your code to work, you have to know what's what.