mastodon hacked apk (unlimited interesting + funny posts) working 2025
Uncategorized
4
Posts
4
Posters
6
Views
-
mastodon hacked apk (unlimited interesting + funny posts) working 2025
-
mastodon hacked apk (unlimited interesting + funny posts) working 2025
@chfour patched day 1 by the social web working group
-
mastodon hacked apk (unlimited interesting + funny posts) working 2025
@chfour wheres the link op -
mastodon hacked apk (unlimited interesting + funny posts) working 2025
@chfour it's 2026
-
undefined oblomov@sociale.network shared this topic on
Gli ultimi otto messaggi ricevuti dalla Federazione
-
Il rito della Finanziaria
@anarchia
Cambiano i governi ma le finanziarie rimangono. Rimangono uguali a loro stesse: un miscuglio di tagli e incentivi di varia natura, per lo più alla produzione, che servono a rientrare nei parametri dell’austerità europea e a mantenere immutato l’assetto politico...Vedi l'articolo
https://www.rivoluzioneanarchica.it/il-rito-della-finanziaria/
-
@ribby qualcosa su proxmox?
-
@demofox anyways on the reversing a linked list challenge, I want to say that I asked them what the requirements would be eg context of its use and the interviewer was like :) no just come up with something impress us :) :) but I might be misremembering as that was ~10 years ago.
-
@demofox tbh it was good to have bombed that one because it helped me realize I should brush up on my c++ before applying for any of the jobs I actually wanted
-
@demofox a long long time ago last time I was unemployed and job hunting I had an interview with apple and they asked me to reverse a linked list. so I said I'd use whatever library function is available. interviewer said no, pretend there isn't one. then I gave them a naive O(N) solution and then the interviewer said it was no good because it used recursion and thus too much stack memory and what if the device didn't have enough memory?!
-
@shanecelis lol I laughed in real life
-
@demofox INTERVIEWER: Can you reverse a string?
ME, pulling a string from my pocket: Of course.
-
@demofox Oh, that's easy. Just perform a complex valued DFT of the byte values twice in a row. It's O(n log n) so it's even *relatively* efficient.
