5
Four-Byte Bloom Filter
Bloom filters are cool. In the words of that Wikipedia article:
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possibl...
GNU APL and ngn/apl use UTF-8, so use a byte counting tool.
NARS2000 only uses UCS-2, so 2 bytes per character.
IBM's APL2 is the only modern APL that natively supports APL EBCDIC, so 1 byte per character.
Dyalog APL uses any Unicode format, or the classic Dyalog character set (Table 1 below).*
...
I'm thinking of designing a single-player game strategy challenge in which programs are fed lines on stdin, to which they respond on stdout. A program must respond to the current line before learning the next one. This is similar to how the popular Moby Dick challenge works. Ideally, I would prov...
Is My Swipe Pattern Legal?
Most smartphones allow the user to use a swipe pattern to open their phone:
Certain patterns are legitimate, and others are impossible. Given an input swipe pattern, return a truthsy or falsy indicating if the given input pattern is legal or not.
Input
The grid i...
Given a 2^n-bit x86, output the largest result when n is large enough.
Your code should be at most 512 bytes.
Note:
The result should be constant when n exceed a constant.
Decimal and unary(use the output.length) output allowed
No infinity output, but infinite loop allowed if the loop doesn't ...
