sudoshred

Petition to have the question added to leetcode. Two variants one with a single type of parens such as () and one with mixed parens (),{},[]. In each problem implement the map method which takes a chunk sequence of the overall input, the reduce method which takes an array of map method output for each chunk and returns the overall answer.

Also consider RTS elements, like assigning certain schedulers to handle workloads which are swappable and tuneable, maybe with some skill tree unlocks.

Same people complaining "no one wants to work these days".

Depends. I can certainly offer to rewrite my old code that contributed to the memory shortage, for a price.

Safety of their IPO

Statistically impossible to inadvertently generate a collision using UUID keys. UUID is designed to be unique when generated across any computer system. Practically speaking if you have an exactly matching pair of UUIDs from disparate system you have found the exact record match. The name gives a hint "Universally unique identifier". -Not a cryptographer.

sounds like a compliment to the implementation

Much like most office jobs

imminent danger pay

nearly retired

bitshifting screen renders directly to pixels on custom hardware, if I had to bet

Some people enjoy vendor locked managed services for their core infrastructure. Typically this decision is made when building from zero to one in resource constrained environments, and the long term play is to move to your own table/db when it becomes sustainable to do so. The only reason to move to a managed service after having done the work to setup self owned systems is when you need to either a) CYA or b) reduce headcount

Bite selection is akin to bin packing, now that I think about it.

You missed the killer feature, even more diffusion of responsibility.