Is each bracket matched? code-golfdecision-problembalanced-string Given a string consisting only of the characters ()[]{}, determine if each type of bracket is matched--that is, every ( corresponds to one later ), every [ corresponds to one later ], and every { corresponds to one later } (and vic...

Heavily based on this closed challenge. Codidact post, Sandbox Description A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$ The next term, \$t_3 = t_1 - t_2\$ More generally, \$t_n = t_{n-2} - t_{n-1}\$ The sequence ends when \$t_n ≤ 0\$. All values in the sequence must be...

Efficient table-lookup computation Note: as you can probably tell, this is a simpler variation; however the poster of the other sandbox post has not been visiting the site for a while. atomic-code-golf multiple-winning-criteria (<-- ?) The problem: compute the day of the week from a MM-DD represe...

You are to write a program which generates random integers between \$0\$ and \$99\$ inclusive, outputting each integer in turn, until \$0\$ is generated. You may choose which single-order random distribution (uniform, binomial, Poisson etc.) you use so long as each integer has a non-zero chance o...

Count strictly overlapping substrings code-golf string Given two strings a and b, count how many times b occurs as a substring in a, but only when it overlaps with another instance of b. Test cases input a input b output trololololol trol 0 trololololol ol 0 trololololol...

Is it a positive integer? code-golf integer decision-problem Amazingly, we don't have a challenge this simple yet (as far as I can tell, at least; the closest I've found is Output the sign). Given a non-zero integer, determine whether it is positive or negative. The reason for not handling zero i...

Counting set bits in a byte Here is a bite-sized problem I ran in to when trying to implement Conway's game of life on a microcontroller, and was trying to count the amount of neighbours: How can you check how many bits are set in a byte? Challenge Given one byte of input data and an integer N be...

I don't mean a quine that outputs its own binary. My question is the following: Could you write a quine such that if you compile it and read the compiled file in binary format you'll get the same result as if you read the original file? For example, a java quine with the same binary as its jar.

Introduction A quine is a program that outputs its own source code. For example, a well-known Python quine is _="_=%r;print(_%%_,end='')";print(_%_,end=''). Running it outputs _="_=%r;print(_%%_,end='')";print(_%_,end=''), therefore it is a valid quine. An error quine is similar to a regular quin...

your task is to write a program that receives an path to an image file, and outputs some text based on the image. here is an example: image: Output: ▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓ ▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓ ▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓ ▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓ ▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓ ▓▓▒▒▒▒▒...

Here Lies Thy Info... The Input An A-Z character that is lowercase or uppercase Example of The Desired Output a=>a à á â ä æ ã å ā l=>l ł I Am Still Confused? The input will be an a-z or A-Z letter. The output should be all or at least most of the accented versions of the input. If there is not ...