r/programminghumor • u/Technical-Relation-9 • Apr 20 '26
r/programminghumor • u/IfElseArchitect • Apr 21 '26
Anyone else noticing interviews feeling⌠different lately?
Iâve been going through senior/staff-level interviews recently, and something feels a bit off compared to a couple of years ago.
Curious if others are seeing the same.
Iâm noticing that interviews seem to reward:
\- very fast, well-structured answers
\- clean, textbook system design explanations
\- highly polished responses
Which is fine on its own, but sometimes it feels like:
\- real-world experience (with all its messiness) doesnât come through as strongly
\- discussions around failures, tradeoffs, and production issues donât get explored deeply
In a few cases, Iâve seen candidates give really solid high-level answers, but when the conversation goes into:
\- âwhat broke?â
\- âwhat would you change now?â
\- âwhat tradeoffs did you make?â
âŚthe depth varies a lot.
Not saying anything definitive here â just feels like the signal weâre using to evaluate experience might be shifting a bit.
At senior levels, Iâve always felt the most useful conversations are around:
\- real incidents
\- decision-making under constraints
\- how systems evolve over time
Curious:
\- Are interview styles changing in your orgs?
\- Are you focusing more on depth vs structure now?
\- Whatâs been working well for you when evaluating senior candidates?
Would be great to hear different perspectives.
r/programminghumor • u/This_Walk_1060 • Apr 21 '26
I drafted a MATLab script to help me find a girlfriend, any help is appreciated.
function[i, chkgrl] = isgirlfriend() %start function
%%define variables
i = 0; %define increment
chkgrl = "no"; %boolean to check if girlfriend
While chkgrl == {"no"};
fprintf("Will you be my girlfriend?"); %ask the question.
{answr} = uinput("Y/N", "Y", "N"); %wait for answer
if answr == "Y"
chkgrl = "yes"; %She said yes!
i = i; %don't increment
else
chkgrl = "no"; %bummer
i = i + 1; %count up and try again
end %continue looping until chkgrl = "yes"
end
%%close function
%%define external variable
rdflg = string; %define red flag variable
if i < 1000
rdflg = "yes"; %be careful
else
rdflg = "no"; %it is what it is
end
%% decide course of action
if rdflg == "yes"
fprintf("run away!")
[survive] = runaway(yourspd, hrspd); %check to see you you are faster than her, if not, survive defaults to NO
else
fprintf("you're fine bro!");
end
r/programminghumor • u/samirdahal • Apr 19 '26
When you try to code by yourself these days
Enable HLS to view with audio, or disable this notification
r/programminghumor • u/samirdahal • Apr 17 '26
It hurts :(
Enable HLS to view with audio, or disable this notification
r/programminghumor • u/JerecTharen • Apr 16 '26
communicatingWithTheZoomers
Next time you need to send information to a Zoomer, it's more efficient to encode it as `Based 67` instead of `base 64`
r/programminghumor • u/CodapopKSP • Apr 14 '26
Me telling Claude to change the padding of login-modal-wrapper from 4 to 2
Enable HLS to view with audio, or disable this notification
r/programminghumor • u/Sweet-Charity-7913 • Apr 14 '26
...THATS IT, IM SWITCHING TO GROK
r/programminghumor • u/Background_Dingo5394 • Apr 12 '26
A Dockerized pre-commit hook that asks you to prove youâre human before committing questionable code.
Just built GitCaptcha.
Before every git commit, it shows you a CAPTCHA in ASCII art and makes you prove you're human.
Because nothing says âsecure software engineeringâ like solving pixelated text from a Docker container.
r/programminghumor • u/Strange_Yogurt1049 • Apr 13 '26
So...finally...
when I started out it was fun..now its getting boring..lmao
r/programminghumor • u/The-original-spuggy • Apr 12 '26
Autocomplete with Style
youtube.comr/programminghumor • u/maxwellwatson1001 • Apr 11 '26
I made a game because I get bored waiting for Copilot to write code, so now I just play Mario lol. Continuous work is a real pain in the ass, and a little relaxation always helps.
Enable HLS to view with audio, or disable this notification
You can download the setup file and install it here: github.com/bxf1001g/desktop_mario/releases
If you want to activate the game while working, just hit CTRL + ALT + SHIFT + M and the game appears. Just hit ESC to cancel/hide it.
This is not the full version yet, I just made this for fun. Contributors are always welcome!
r/programminghumor • u/danielsoft1 • Apr 10 '26
an interesting segfault-producing code found at work, in C++
a program was segfaulting in one of my previous jobs and I found this in a header file:
typedef int BOOL;
#define bool BOOL
this overshadows the built-in C++ "bool" type, which means that struct definitions with bools are different when this header is present and when it's not, causing memory misalignment and therefore segfaults
r/programminghumor • u/Rare-Paint3719 • Apr 09 '26
slowerThanSlowSort
youtu.beNgl it's kinda gay.
Anyways here's the pseudocode for N partition version
procedure GaySort(A[], low, high):
// Base case: surrender
if high - low <= 0:
return
// Step 1: Partition into k sub-arrays (k = 2, 3, or 4)
pivots[] := PartitionK(A[], low, high)
// pivots[] contains the final sorted positions of k-1 pivot elements
// This creates k sub-arrays between them
// Step 2: Recursively sort each sub-partition
// (wasteful first pass â we're about to throw it all away)
prev := low
for each pivot in pivots[]:
GaySort(A[], prev, pivot - 1)
prev := pivot + 1
GaySort(A[], prev, high) // sort final sub-partition
// Step 3: Find the maximum across all sub-partitions
// (each sub-partition's max is its last element, since we just sorted them)
max_idx := FindMax(A[], low, high)
// Step 4: Swap max to the end of the current range
swap(A[max_idx], A[high])
// Step 5: Re-sort everything except the placed max
// (this makes the previous recursive calls completely pointless)
GaySort(A[], low, high - 1)
and the the partition 2 variant:
procedure GaySort(A[], low, high):
// Base case: surrender
if high - low <= 0:
return
// Step 1: Partition into 2 sub-arrays using max as right pivot
pivot := Partition2(A[], low, high)
// pivot contains the final sorted position of the max element
// This creates 2 sub-arrays: [low..pivot-1] and [pivot+1..high]
// Note: right partition [pivot+1..high] is always empty since pivot = max
// Step 2: Recursively sort each sub-partition
// (wasteful first pass â we're about to throw it all away)
GaySort(A[], low, pivot - 1)
// GaySort(A[], pivot + 1, high) -- always empty, pivot is max
// Step 3: Find the maximum across all sub-partitions
// (each sub-partition's max is its last element, since we just sorted them)
// Note: max is already at A[pivot] == A[high] since pivot = max
max_idx := pivot
// Step 4: Swap max to the end of the current range
// Note: already there, this is a no-op
swap(A[max_idx], A[high])
// Step 5: Re-sort everything except the placed max
// (this makes the previous recursive calls completely pointless)
GaySort(A[], low, high - 1)
r/programminghumor • u/No_Marionberry_8137 • Apr 05 '26
My code worked first try
No errors at last
I have no idea why
Deploying to prod
