Hi folks! This one took a while to post; but nevertheless, here we are!
Last week, Perserverance(a.k.a Percy) landed on Mars; which saw Linux on Mars! One small win(?) for Linux(?) \o/ \o/
Earlier this week, I picked up (again) "The Philosophy of Software Design by John Ousterhout" and I found myself nerding about it with some fellas at the office-- poor souls ;)!. The particularly interesting thing was the book's discussion of what our role is (as SWEs) wrt work; with an opinionated view that it all boils down to tackling "complexity". Without getting into much detail, I particularly found the books discussion of "causes of complexity" interesting: Dependencies and obscurity. For anyone getting into the field, I'd strongly recommend that read(albeit pore through it with a critical eye).
Issue 1: https://is.gd/HK0jFF
Mailing List discussion: https://is.gd/xrHZmY
If you get the bandwidth, hack at the problems at the submission links above-- It's a nice way to get comments on your code \m/\m/.
Source: https://is.gd/HwTL9E
Given an integer as a function, test to see if it's a palindrome
Constraints: You may not cast the number to a string!
Examples:
Input: n = 9229
Output: True
input: n = 1234
Output: False
Post your answers here as comments.
