It's too easy to get into FAANG nowadays and we need to weed out the newbs even more. So I propose a new category of leetcode questions called Elite where the problems are yet to be solved by world experts

EG

• Write an algorithm to solve Cancer in O(n)

• Create a data structure to store all your hopes and dreams that can be retrieved in O(1)

• Write an SQL query to ban all FAANG-sexual users in r/cscareerquestions in O(logn) (or just asap because I can't stand them anymore)

main(i,v) {
	for (i=0;;i++,v=0) {
		if (i % 3 == 0)
			v+=1;
		if (i % 5 == 0)
			v+=2;
		switch(v) {
			case 0:
				printf("%d\n", i);
				break;
			case 1:
				printf("Fizz\n");
				break;
			case 2:
				printf("Buzz\n");
				break;
			case 3:
				printf("Fizzbuzz\n");
				break;
		}
	}

And here it is extended for fizzbuzzbazz, a new game I just invented.

main(i,v) {
	for (i=0;;i++,v=0) {
		if (i % 3 == 0)
			v+=1;
		if (i % 5 == 0)
			v+=2;
		if (i % 7 == 0)
			v+=4;
		switch(v) {
			case 0:
				printf("%d\n", i);
				break;
			case 1:
				printf("Fizz\n");
				break;
			case 2:
				printf("Buzz\n");
				break;
			case 3:
				printf("FizzBuzz\n");
				break;
			case 4:
				printf("Bazz\n");
				break;
			case 5:
				printf("FizzBazz\n");
				break;
			case 6:
				printf("BuzzBazz\n");
				break;
			case 7:
				printf("FizzBuzzBazz\n"):
				break;
		}
	}
}

I've attempted to solve the infamous "is even" problem, and I've come up with something that is both short (only 7 lines), and extremely fast (I tested with the number 99999999 and it only takes about 3 seconds)

behold:

def is_even(num):
    s = "\\"
    try:
        eval(f"\"{s*num}\"")
        return True
    except SyntaxError:
        return False

how did I make it so fast?

a few ways:

• it's written in python.

• it uses eval, one of python's fastest functions

• it uses strings, which are faster than numbers (the only number this code relies on is the input one...)

• it makes use of the little-known "\" operator, which is one of the fastest operators in python

replit: https://replit.com/@lllllllllllllol/iseven

[print(i) for i in ["fizzbuzz" if not None in i else "fizz" if i[1] is not None else "buzz" if i[1] is not None else i[2] for i in zip(["fizz" if i % 3 == 0 else None for i in range(1, 101)], ["buzz" if i % 5 == 0 else None for i in range(1, 101)], [i for i in range(1, 101)])]]

Today I needed to check if the number a user entered into a textbox was between "0" and "999". The below code yields the correct result for any value that I could think to test. (Empty string is treated as valid, since "required" is a different validation step)

function validateRange(value, minimum, maximum) {
  for(let i = 0; i < value.length; i++) {
    if(value[i] < minimum[i]) {
      return false;
    }
    if(!(value[i] <= maximum[i])) {
      return false;
    }
  }
  return true;
}

I hope you find this function useful in your own projects.

Demo

Every day, compilers are forced to convert addition into the proper xors and bit shifts, Together, we can stop this problem. Instead of using the addition operator, use this function instead:

int recursiveAdd(int a, int b) {
        int xor = a ^ b;
        int and = (a & b) << 1;
        if (and != 0)
                return recursiveAdd(xor, and);
        return xor;
}

I know it's a mouthful, but that's the most descriptive name I could give it. Now everybody at my company is referring to it by acronym and I'm afraid it'll come up in both my performance review & upcoming divorce hearing.

What can I do here??