Part of it was to create new jobs and hire people, meanwhile they - *checks notes* - fired a bunch of people?

A lot of them don’t know the difference between ab, abp ublock and ublock origin

Whoosh

It’s essentially the traveling salesman problem

2 bytes would be 0-65535 and 8 sets is ~3.4×10^(38) addresses

Also if you want a domain but dont care about the actual address, a .xyz domain composed entirely of numbers with less than 10 digits is $1-2 + same as renewal fee per year. $1.22 for me on porkbun

Just be sure to redact the whois information bc you will get a call from scammers trying to get you to register your domain on some “internet map” for a small fee acting as if its some step in your setup process you havent done yet

Typically if you report the phone stolen to your provider they blacklist the IMEI which gets shared with other providers so the phone can no longer be used. I was unclear on this part but a new e-sim can be provided for the new phone, and the old sim banned or the old one transferred. Regardless, the old phone will still show the IMEI/sim/phone number, which is how they got that to text them

The phone itself (by IMEI) is a brick. The sim and same phone number were assigned to a new phone and they texted that number

SendToBoardingSchool()

In general, there’s pros and cons to both. Iirc inflation is considered to be a bit better than deflation because deflation is linked to economic crisis, high unemployment, low productivity, and low sales. Inflation isn’t much better but having a very small amount of inflation is more manageable and has some benefits.

https://stackoverflow.com/questions/76975645/how-can-i-give-different-colors-for-class-enum-and-interface-names-identifiers might get you closer?

I’m exaggerating a bit there. This problem is fairly easy to implement iteratively (e.g. keep a list of unbrowsed folders and keep adding to it), but that is not the case for all problems. Some will be easier to solve in one way, though fundamentally solvable either way

It depends on if the problem is recursive or iterative, and how much it needs to be optimized.

For example, you may use a for loop for a simple find and replace scheme for characters in a string, where you check each character one by one until you find one which matches the target, and then substitute that.

There are certainly recursive ways to do string replacement in strings which might be faster than an iterative search depending on implementation, but that’s more optimization than I might need 99.9999% of the time

A recursive problem that’s difficult to solve iteratively is browsing all the files in a folder and it’s subfolders. Each folder may have several subfolders, which you then need to search, but then each of those folders can have subfolders. This problem can be solved fairly easily recursively but not as easily iteratively.

That’s not to say it can’t be solved that way, but the implementation may be easier to write

Recursive code, however, is more frequently prone to bugs which causes infinite recursion leading to crashes, as it is not a tool which is often used and requires several more fences to prevent issues. For example, in the folder example, if one were to encounter a shortcut to another folder and implement code to follow that shortcut as if it were a directory as well, then placing a shortcut to a folder within itself might cause the code to recurse infinitely without having a maximum recursion depth and or checking for previously seen folders.

isalpha documentation:

Return value

Non-zero value if the character is an alphabetic character, zero otherwise.

You should be either checking for not equal to 0 instead of true, as its not necessarily guaranteed to be 1 ~= true, or removing the comparison entirely

Also make sure that your loop condition is < and not “& lt” without the space unless that’s a weird formatting issue

For more information, make sure to check the documentation for the standard library functions

This lacks a lot of context as both strategies are useful in different circumstances. For a player (A) holding an angle from a far distance, this is true because the person coming around the corner (B) from a short distance to the corner is visible to to A before A is visible to B. This gives the reactor an advantage. This is usually afaik called angle advantage

For a person who is close to a corner peeking a person close to the corner, the opposite can be true due to the delay it takes for the movement to be relayed to the other player’s computer. This means that the player peeking may in more extreme cases have a 100-200ms advantage over the reacting player. This is dubbed peeker’s advantage.

The effects can vary with latency and distance,

Lemmy.ca says -76

High frequency semaphore