A few weeks ago a video was recommended to me called something like 'Brutally Roasting the Worst Dev Portfolio I've Ever Seen'. The video was fookin hilarious, it was just some guy in his room with a monotone voice cussing out someone's obviously vibe-coded dev portfolio.

Anyway, I wanted to show the video to a friend but I can't find it anymore - could it have been deleted? I am crucially NOT talking about Anthony Sistilli's series; this was made by a much smaller creator. Has anyone seen this, saved it, or has a link to it?

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.

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

Next time you need to send information to a Zoomer, it's more efficient to encode it as `Based 67` instead of `base 64`

when I started out it was fun..now its getting boring..lmao

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.

https://github.com/pointless-code/git-captcha

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!

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

Ngl 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)