Expand an array to all directions by duplicating the outer elements You will be given two inputs: an array and the expansion degree For example if I give you [[1,2,3][4,5,6][7,8,9]] and 3, you must output: 1 1 1 1 2 3 3 3 3 1 1 1 1 2 3 3 3 3 1 1 1 1 2 3 3 3 3 1 1 1 1 2 3 3 3 3 4 4 4 4 5 6 ...

Consider the array of positive integers: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, ... Then, concatenate them: 1234567891011121314151617181920212223242526... And then split them into chunks of variable length, each length being equal to the Nth positive integer: [1][23][456][7891][01112][...

Suppose there is an evil organization that is trying to take over the world. All their information is stored on a Unix server. You have SSH access to this server, but their SSH server closes after one line on code! You need to destroy their code, but you know that rm -rf / will not work because y...

Given an integer n >= 2, output the largest exponent in its prime factorization. This is OEIS sequence A051903. Example Let n = 144. Its prime factorization is 2^4 * 3^2. The largest exponent is 4. Test Cases 2 -> 1 3 -> 1 4 -> 2 5 -> 1 6 -> 1 7 -> 1 8 -> 3 9 -> 2 10 -> 1 11 -> 1 12 -> 2 144 ->...

Using non-SE-sites on stack-exchange-api questions. I've seen a language pop up called "Holavi" which uses Google to cut bytes on stack-exchange-api questions. While this is a great idea and all, this is a) unreliable, and b) not using an SE site. Therefore, I think this shouldn't be allowed.

Task: Make a program that draws the following figure line by line. Your program should wait for one-second after drawing each line. Your program can only draw line by line (you cannot jump to another point or re-draw over a line) The dimensions can be of any size (as long as it is viewable) ...