Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents. First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zer...

One more quine quine code-golf Write a non-empty program (full or function). The program output its source 2 times. And when you repeat its source n times, the connected program output (n+1) times original source code. Example For example, your program is abc123 Then, your program should ...

This is mostly for the memes. I regret existing. Rules No using any of the letters from the phrase "This ain't it Chief." Print "This ain't it Chief." in that exact format Both ' and . can be used No input Use JSFiddle, CodePen, etc. to prove your code works (or a screenshot if needed?) Ans...

I have come across the following problem in an interview prep collection, but I have no idea where to start or how. Any ideas would be of great help. Thanks.

Given a rectangular haystack of size at least 2x2 composed of all the same printable ASCII characters, output the location (counting from the top-left) of the needle which is a different character. For example, if the following haystack is input: ##### ###N# ##### ##### The output should be 3...

Background The traveling salesman problem (TSP) asks for the shortest circuit that visits a given collection of cities. For the purposes of this question, the cities will be points in the plane and the distances between them will be the usual Euclidean distances (rounded to the nearest integer)...

Challenge Given two non negative integers a < b, output all countries, from the below Top 100 Countries, where area is between a and b: a<= area <= b. Example 147500,180000 --> uruguay, suriname, tunisia, bangladesh 1100000,1300000 --> peru, chad, niger, angola, mali, south africa 1234567,1...

A flow network is a directed graph G = (V, E) with a source vertex s ϵ V and a sink vertex t ϵ V, and where every edge (u, v) ϵ E on the graph (connecting nodes u ϵ V and v ϵ V) has 2 quantities associated with it: c(u, v) >= 0, the capacity of the edge a(u, v) >= 0, the cost of sending one uni...

500 rep for a ridiculously huge number There are currently no valid answers to Golf a number bigger than Loader's number. This bounty will be awarded to the valid first answer that either Is under 256 bytes, or Outputs a number significantly larger than Loader's number (i.e. larger than any si...

The set of necklaces is the set of strings, where two strings are considered to be the same necklace if you can rotate one into the other. Your program will take numbers k and n, and generate a list of the k-ary (fixed) necklaces of length n. Necklaces will be represented by any representative s...