Tweetware

Bad programming takes and shipping bad software, my two favorite pastimes

[Tweetware @ShipToLocalhost]

@ThePrimeagen I unironically need the source code so I can copy paste for my game too.

[Tweetware @ShipToLocalhost]

@BenjDicken I'd like to believe it's inversely correlated, personally

[Tweetware @ShipToLocalhost]

@doodlestein

[Tweetware @ShipToLocalhost]

@matthewdif I'm in this weird intersection where I learned to code in 2015, completed a bootcamp in 2019, never pursued a full time job in programming, but now I'm enjoying it more than I ever did. Physically writing code is more enjoyable because I never feel like I'm truly stuck.

[Tweetware @ShipToLocalhost]

@rikarends I'm just mad that I have to wade through word salad again. Why is 4.8 so verbose 🫩

[Tweetware @ShipToLocalhost]

@saradietschy I used to follow you on my other account because of John, so funny to come back full circle on this account

I had Fable write a shadow shader that Me and Opus 4.8 struggled for 12 hours with. Other than that, I don't think I've done anything I couldn't do with 4.8

[Tweetware @ShipToLocalhost]

@theo Those are your kids

[Tweetware @ShipToLocalhost]

@ThePrimeagen gotta do something while Fable is writing for us

[Tweetware @ShipToLocalhost]

@notch This is a better question

[Tweetware @ShipToLocalhost]

@fleetingbits I think it's a 1 week loss leader to try to get closer to being profitable

[Tweetware @ShipToLocalhost]

@_andrewthecoder Adding to 0 is dumb, ignore that part lol, we just add the first 2.

[Tweetware @ShipToLocalhost]

I've never solved this before, and I'm not looking at replies. Here are my current thoughts:

If we have 2 numbers that equal 0, they are either the opposite of one another, or both zero. If an array contains only positive numbers, the answer is impossible. Same for negative numbers. For 3 digits, we either need 1 of them to equal 0, or 2 of them need to sum to the opposite of the other.

Programmatically, this just takes the shape of 'find if sum x exists'. We can work backwards from the end: at arr[0] we add that to 0 and then, we add arr[1]. Then we ask if currentSum * -1 exists in the rest of the array. This is O(n^3) though, yeah? I'm sure there is a O(n^2) optimization.

[Tweetware @ShipToLocalhost]

@yacineMTB Time to start a gofundme I guess

[Tweetware @ShipToLocalhost]

Someone help me budget these items please, my wife is going to divorce me:

Rent: $1100
Food: $600
Claude Max: $200
Internet: $89
Fable 5 Credits: $14,490
YouTube Premium: $17
Electricity: $200

[Tweetware @ShipToLocalhost]

@jamonholmgren What!!! Are you telling me there is NUANCE!? Not in my twitter-verse!

[Tweetware @ShipToLocalhost]

@traits_reality @scuba356255 This is me, send me a DM

[Tweetware @ShipToLocalhost]

@neetcode1 I really need to get on this and stop being lazy about it before I get left behind

[Tweetware @ShipToLocalhost]

@theo In sandals? My toes hurt just watching

[Tweetware @ShipToLocalhost]

@wholyv Planning, organization, editing, and breaking down complicated concepts are probably the other uses I regularly engage with other than coding.

[Tweetware @ShipToLocalhost]

@GergelyOrosz I'm low-key worried about this myself, I need to read more books