From Rubber Ducks To Robot Overlords

Content Hey, are you sleeping? Yes, now shut up I know how to fix that bug on line 255

Two weeks of blood, sweat, and Stack Overflow searches reduced to "Wow! This is garbage." Nothing quite like having QA stomp on your feature with the enthusiasm of someone finding gum on their shoe. The developer's equivalent of showing your mom artwork you're proud of, only for her to ask if it's supposed to be a horse when you clearly drew a dragon.

Content airstrike 0 minutes ago unvote root parent prev next - There are actually only two hard problems in computer science: 0) Cache invalidation 1) Naming things 5) Asynchronous callbacks 2) Off-by-one errors 3) Scope creep 6) Bounds checking

Junior devs out here asking "how do I loop through an array in JavaScript?" with proper grammar and punctuation like they're writing a thesis. Meanwhile, seniors have evolved beyond language itself—they just slam their error message directly into Google, typos and all. No context, no politeness, just raw stack trace energy. The senior's search history is basically a crime scene of cryptic keywords: "undefined not function react" or "segfault malloc why". They've learned that Google doesn't need your life story, it needs the exact three words that unlock Stack Overflow's ancient wisdom. The junior is still trying to explain their problem to a search engine like it's their therapist, while the senior treats Google like a database query—maximum efficiency, zero fluff.

Grammar corrections feel like getting shot in the face with a laser gun. Code corrections? That's just free QA. Developers would rather have their entire codebase criticized than deal with someone pointing out they used "your" instead of "you're" in the documentation. Priorities, I guess.

Content Jeroen Frijters JeroenFrijters 1d The Dutch government was forced to release the source code of their DigiD digital authentication iOS app. It is written in C. github.comMinBZKwoo-bes... private static string GetPercentageRounds (double percentage) if (percentage 0) return "0000000000"; if (percentage 0.0 percentage 0.1) return "0000000000"; 11 percentage 0.1 percentage 0.2) return if (percentage noTunn 00000000"; 0.2 percentage 0.3) 0000000" if percentage ercentage 0.4) 11 percentage 0.5) 11 percentage 0.6) return if percentage 6 percentage 0.7) return 000" 1 percentage 0.7 percentage 0.8) 11 percentage return a percentage 0.9) 0000": return 11 1.3M Q308 171,196 6,678 08 tyrannoSaurav TyrannoSaurav Replying to JeroenFrijters Ahh I see the problem is that there are too many if statements. Here's a solution implementing binary search in O(log n) private static string GetPercentageRounds (double percentage) if (percentage 0 So percentage 0.5) if (percentage 0.2) if (percentage 0.1; 11 percentage return return return "O 00"; if (percentage 0.4) if (percentage 0.3) return "0000000000"; return "000000000"; return " 0000"; if (percentage 0.5 percentage 0.9) if (percentage 0.7) if (percentage return gOO" return if (percentage return return return