Index and Get/Set Nested Arrays/Lists
This question is intended as extension of Home on the Range of Lists.
This challenge is to write one or two functions or a program which are getter and setter for a nested array/list mapped to 0-based or 1-based indexing.
Input
An array/list containing a...
0
I don't know if something like this exists already (and I'm not finding the right key words) but if not, it felt like it could be an interesting coding puzzle.
The challenge is, to take an arbitrarily nested list (no more than 2 deep), and display the content in a terminal in 2 dimensions in a '...
Post short messages limited to 50
Example
Suppose the user wants to send the following message:
"I can't believe Tweeter now supports chunking my messages, so I don't have to do it myself."
This is 91 characters excluding the surrounding quotes.
When the user send, it will s...
Matrix Jigsaw Puzzle
code-golfmatrixnumberinteger
Input:
An integer n
Two equal-sized square matrices (with their width/height being a multiple of n)
Output:
One of two distinct values of your own choice, one being for truthy results and one for falsey results (so yes, 1/0 instead of true/...
Matrix Jigsaw Puzzle
(Randomly inspired by https://codegolf.meta.stackexchange.com/a/17272/42963)
code-golf matrix
Given a rectangular matrix of digits (i.e., 0 - 9), output the "pieces" of the matrix as if the digits are connected together forming a single piece, in ascending order by the dig...
As you probably know, a Fibonacci Number is one which is the sum of the previous two numbers in the series.
A Fibonacci Digit™ is one which is the sum of the two previous digits.
For instance, for the series beginning 1,1, the series would be 1,1,2,3,5,8,13,4,7,11,2... The change occurs after t...
Source permutation
Tags: code-challenge, integer, permutations, sequence
A permutation of a set \$S = \{s_1, s_2, \dotsc, s_n\}\$ is a bijective function \$\pi: S \to S\$. For example, if \$S = \{0,1,2,3\}\$ then the function \$\pi: x \mapsto (x + 1) \mod 4\$ is a permutation:
$$
\pi(0) = 1,...
The buddy memory allocation technique is a memory allocation algorithm that divides memory into partitions to try to satisfy a memory request as suitably as possible. This system makes use of splitting memory into halves to try to give a best fit. According to Donald Knuth, the buddy system was invented in 1963 by Harry Markowitz, and was first described by Kenneth C. Knowlton (published 1965). Buddy memory allocation is relatively easy to implement. It supports limited but efficient splitting and coalescing of memory blocks.
== Algorithm ==
There are various forms of the buddy system; those in...
This is not the Timing Attack you are looking for!
code-golf cryptography
Introduction
I recently was writing a piece of code to verify a HMAC signature (to verify an API request). While doing that I found the given method in the documentation to be "incredibly verbose" and as a somewhat as...
This is the Cop post. The Robber post is here.
Your task is to take an integer input N and output the Nth digit in the sequence OEIS A002942.
The sequence consists of the square numbers written backwards:
1, 4, 9, 61, 52, 63, 94, 46, 18, 1, 121, 441, ...
Note that leading zeros are trimmed...
Cops section
The robbers section can be found here.
Thanks to FryAmTheEggman, Peter Taylor, Nathan Merrill, xnor, Dennis, Laikoni and Mego for their contributions.
Challenge
Your task is to write 2 different programs (full programs/functions/etc.) in the same language and the same version (...
Using a regular expression, I want to add 1 to 1 to get 2, 1 to 2 to get 3, 1 to 3 to get 4, 1 to 22 to get 23, 1 to 145 to get 146, etc.
So I would have the expression, the value, the replacement, and the output. For example:
Expression:
Value: 1
Replacement:
Output: 2
Expression:
Value: 2
...
