The new site header has some bits of source code from various questions as the background. Here are the first 3 lines: --<-<<+[+[<+>--->->->-<<<]>]<<--.<++++++.<<-..<<.<+.>>.>>.<<<.+++.>>.>>-.<<<+. Hello, World! IT'S SHOWTIME TALK TO THE HAND "Hello, World!" YOU HAVE BEEN TERMINATED "9!dlroW ,ol...

Using brace expansion to illustrate, we can test for the following range: {29..51}, with the following regular expression 29|[3-4][0-9]|5[0-1]. What is the most efficient regular expression to test if a number is in the following range: {29..51..3}.

Print the new badge logo with your user number code-golfascii-artkolmogorov-complexity We all know that PPCG received a brand new layout, featuring a new logo: Challenge Write a program or function receiving no input, that outputs the new badge logo (with the curly brackets) using ASCII lette...

Golf a regex that only matches itself and copies of itself concatenated an amount of times that is a multiple of nine. If the regex was /hello/, it would match /hello/, /hello//hello//hello//hello//hello//hello//hello//hello//hello/ and /hello/ concatenated with itself 18 times, but not /hello//...

I have a tree (undirected graph with no cycles) of n nodes. If I remove k edges of this tree, I will have k+1 new trees i.e. a forest will be formed. How do I calculate the number of nodes in each of these new trees formed? I have to do the above for q queries. A hint may help.

Sequential terms You are required to determine the nth term of the provided sequence whose relation is as follows: f(0)=p f(1)=q f(2)=r for n > 2 f(n)=af(n-1)+bf(n-2)+c*f(n-3)+g(n) where g(n)=nn(n+1) Note: Since the nth term would be too large, therefore print the value as f(n) modulo 10^...

Nearest match with limited values code-golf When writing my solution for this challenge, I found that I needed to generate a target value using nothing but multiplication and increments/decrements, using a restricted set of values to use in the multiplication. Given that my choice of values w...

Given a grid of directions and a start and end position, determine the minimum number of substitutions in the direction grid that needs to be made to complete the path between the two points. The grid is doubly-cylindrical. This is clearer given an example. Example Let's take the following grid...

Game summary In this challenge, your bot should make the best use of the resources available to burn your opponent with an acid/base. To do this, you will be provided a set of substances (molecules or mixtures), as defined by their chemical structures, and you will have to work out how/when to u...