In other words, challenges for which the specifically-developed golfing languages will not be accepted?
Are there even tags for language-specific challenges?
Burning Bridges
code-golf graph-theory
Introduction
You are on a network of islands which are connected by wooden bridges and you want to see if you can burn every bridge in the island network. However, you can only burn a bridge once you've walked over it.
Once a bridge has been burned, it h...
@BetaDecay I personally think it looks ready. +1 :)
@Mr.Xcoder I love how print'\n'.join(map(''.join,sum([[sum([f[i*3:i*3+3]for i in j],[])for f in map(list,['..............\\/...|./../...|...\\..\\............','.........---.......|........|.......---.........','...\\..../......../.|........|.\\........../\\.....'])]for j in input()],[]))) is shorter than my earlier golfy solution ಠ_ಠ
Given an integer array and two numbers as input, remove a certain amount of the first and last elements, specified by the numbers. The input can be in any order you want.
You should remove the first x elements, where x is the first numerical input, and also remove the last y elements, where y is...
Introduction
You are on a network of islands which are connected by wooden bridges and you want to see if you can burn every bridge in the island network. However, you can only burn a bridge once you've walked over it.
Once a bridge has been burned, it has gone and you cannot go back over it. N...
I am currently dealing with an analytics problem.
The data consists of historical information of households and products used by them over the period of two decades.
I have outcome variable as product segment which is defined by a a specific segment code.It is denoted by A-Z and 0-9. (Total 35...
I just received a notice back from the SE team; unfortunately, the votes that I cast as 42649 are permanently deleted and cannot be merged with 68942, so unfortunately the lost rep will not be refunded to anyone :(
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph which visits every edge exactly once. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this:
Given the graph in the image, is it possible to construct a path (or a cycle, i.e. a path starting and ending on the same vertex) which visits each edge exactly once?
Euler proved that a necessary condition...
@trichoplax no I think it's a bit harmful...a swarm of answers goes into a trivial challenge so it ends up at hnq then many unknowing users would just upvote the challenge without thinking much or something like that
@EriktheOutgolfer I agree that can be a problem, but reducing the number of challenges that can appear on HNQ would probably exclude the less trivial challenges, leaving the trivial ones still there to be overvoted. I don't see an obvious solution to this.
Basically what's documented here:
What formula should be used to determine "hot" questions?
We have a few tweaks:
Succeeding questions from the same site are penalized by increasing amounts. So, the first question from SO in the list gets multiplied by 1.0, the second by 0.98, the third ...
@HyperNeutrino What's amazing is that they increasingly deduct points for each question from the same stack, so even with that deduction we still top the leaderboard
I think they should divide the answer score by the answer count, so having a sudden influx of answers that are all not voted very high could be a sign of a trivial challenge.
Rust, 29 bytes
|n,i,j|&n[i..<[_]>::len(n)-j]
Call it as follows:
let a = &[1, 2, 3, 4, 5, 6];
let f = |n,i,j|&n[i..<[_]>::len(n)-j];
f(a, 2, 1)
I had a lot of fun fighting with the borrow checker figuring out what the shortest approach was in order to have it infer the lifetime of a returne...
Golfing in rust: crimes against readability to get the compiler to infer lifetimes over closures
@HyperNeutrino looks fine, you might want to push the contact info a little more towards the center, but once you start filling the whitespace IMO it'll be good enough
@Downgoat @HyperNeutrino or at least vary it up, you're usually suggested to use ~2 fonts, one for headings and one for body, plus maybe one for big titles
MacGyver's Toolbox
In this question each answer will get a "toolbox" that can be used to construct a program/function. The toolbox will consist of two things:
a list of programming languages
a list of valid characters
You must write a valid program/function in one of the languages provided ...
@HyperNeutrino Okay reccomendation are: change header font to 'Source Code Pro' (on google font) font-weight: 300, letter-spacing: -1px, increase margin to 1em. body background to #354851. toolbar background to rgba(0,0,0,0.45). Lower the text and you can remove the background styling but if oyu want background i would recomend background: rgba(255,255,255,0.1);
@Jim Neim's a language that I made specifically for integer manipulation. It doesn't do particularly well with strings. ([_ℚΨ) is a compressed version of 1498485600.
@StewieGriffin congrats! was it on the advance fighter jet/mind control device/weather control device/teleporter/robot/clone/time machine/multiverse transport/weapons? :O
@Jim Printing strings in Neim is actually quite hacky. (I'm free) decompresses the string I'm free! from base 255 to base 10, and then B converts it to base 255
just spent 20 minutes helping my boss who was having trouble pushing into an empty git repo only to find out he was trying to push empty directories ._.
This is a simple one: Take a matrix of integers as input, and output the index of the row with the most non-zero elements. You may assume that there will only be one row with the most non-zero elements.
Test cases:
These are 1-indexed, you may choose if you want 0 or 1-indexed.
1
0
row = 1
---...
In this question each answer will get a "toolbox" that can be used to construct a program/function. The toolbox will consist of two things:
a list of programming languages
a list of valid characters
You must write a valid program/function in one of the languages provided using only the chara...
In golf, the nineteenth hole is a slang term for a pub, bar, or restaurant on or near the golf course, very often the clubhouse itself. A standard round of golf has only eighteen holes, so golfers will say they are at the 'nineteenth hole', meaning they are enjoying a drink after the game. The concept is similar to Après-ski in skiing.
The 19th hole on miniature golf courses is often a hole in which if a hole-in-one is scored, one receives a free game.
== References in media ==
The golf stories of author P. G. Wodehouse, which are narrated by his character, the Oldest Member, discuss the nineteenth...