Earlier quoted context omitted.
Unrelated to the job post itself, but I spotted the puzzle and couldn't help but try it out for a minute. Sadly, I couldn't get anything useful out of it; I have a guess as to what it should decode to but got nothing remotely close to ASCII from it. Perhaps I'm just not smart enough to pass the test? ;)
You're probably getting hung up on the "converting to base-128" part. Here's my solution. I wouldn't normally post it publicly, but I've emailed OP multiple times over the last couple months to apply for this position and have received no response, so maybe this is actually the best way to get around the spam filter: from z3 import * s = Solver() x = Int('x') divisor1 = x / 611939 divisor2 = x / 598463 modconstraint1…
const num = findNum();
const bin = num.toString(2);
const byteStrings = toChunks(bin, 7).map(chunk => chunk.join(''));
const bytes = byteStrings.map(str => parseInt(str, 2));
const str = bytes.map(String.fromCharCode).join('');
console.log(num, bin, byteStrings, bytes, str);
function findNum(i=0, lim=1e1000000000) {
while (i = chunkSize) {
buf = [];
chunks.push(buf);
}
buf.push(el);
}
return chunks;
}
243085550 1110011111010011000011101110 [ '1110011', '1110100', '1100001', '1101110' ] [ 115, 116, 97, 110 ]