🚀 Hi guys, I created a minimal-looking Hackernews client.

It's still not complete yet. But I'm sharing anyway. Feedbacks are welcome ❤

It's live at https://hn-redesign.vercel.app

Here is the source:
https://github.com/RocktimSaikia/...

I once worked until 8am to get a demo ready for a client of the client. I knew the client was a bit thick, so I made some comprehensive video demos and sent them over to him, to save him trying to demo it himself. I wake up at 11am with him screaming down the phone at me:

“It doesn’t work, none of it works!”

“What do you mean?”

“I go to login and I can’t enter anything.”

“I haven’t sent you anything to log into...wait, are you trying to log into a video? Tell me you’re not trying to log into a video of a login page.”

“Uh...oh hang on, it just worked. Ok no pr-“

“No wait, what do you mean it worked?”

“I logged in fine.”

“It’s a video. You can’t log into a video.”

“Uh...alright, bye mate, thanks!”

The moral of the story is: never assume any level of intelligence on the part of a client, even if they exhibit signs of it at first. If they are paying you they will forget how to tie their own shoelaces.

Hey girl are you https cause without you I'm ://

I don't fucking get it why people find it normal to have a zoom meeting run in background for the whole working hours.

Like WTF

Me: Optimize a sort & match method in backend because users complain it's a bit slow.

Coworker: These algorithms are both O(n), so they're identical *closes PR*

Me: *start zoom call* "Heeeeeeeeeey Iiiiiiiiiii wouuuuuuuld liiiiiiiiike toooooo diiiiiisscuuuuus thaaaaaaaat puuuuuuulllll reeeeeequuuueeest yooooouuuuu cloooooossseeeed"

Coworker: "wtf are you doing, why are you talking so slow"

Me: "No matter whether I talk fast or slow, the information still reaches you in O(n) time, so why are you complaining"

I fucking hate it when people misunderstand the purpose of (or abuse) big O notation. It's an estimate of how an algorithm SCALES once the set increases in size, in which case you leave out both less significant terms and constant factors.

But those terms and factors are important when you're talking about the DIRECT PERFORMANCE of the algorithm on fixed-size sets, instead of SCALING to larger sets.

1n and 10n are both O(n), but 10x performance on a job that used to take 10 minutes is still significant.

I got a job. A job where I get to sit in front of a computer. I don't know what I'm doing yet... Developer is in the job title description. I'm scared. I'm excited. But most of all, I'm really glad that I get to stop stacking boxes for a living.

Eclipse, you fucking piece of shit