@Neil but would also accept…? I suppose your original example was 1 3 4, and ^ is 2 3 4.
@Neil Can we take distance as including the perforation line, i.e. these examples have distance 4? (essentially 1-indexed instead of 0-indexed). If so:
@Neil Canvas, 19 bytes. SOGL had a nice built-in that's very helpful for this ("A", "B", 4 → "BABABABAB") that i've for some reason have not added to Canvas..
CMC: IP address in quad-dotted notation as text → binary ("01" string or [0,1] list or [false,true] list etc.) E.g. "172.16.254.1" → 10101100000100001111111000000001
Not that I couldn't just carry it to the next room for a few minutes, but I'd have to unplug my VGA monitor, which would prompt Windows to rearrange all my windows
Shortest code to produce a self-reproducing list, dictionary, array, etc.
Write the shortest code to produce a nested list, dictionary, array, etc. That is, when you index one of its items, you get the same result. Try this in a Python REPL:
>>> i=[]
>>> i.append(i)
>>> i
[[...]]
>>> i[0]
[[......
@JohnDvorak the android app creates a vpn (because otherwise DNS requires static IP configuration on every hotspot which might be a big hassle, and requires doing so manually), but otherwise it doesn't do much (i haven't seen any ads anywhere from the app)
I want to write a function that will execute a shell command and return its output as a string, no matter, is it an error or success message. I just want to get the same result that I would have gotten with the command line.
What would be a code example that would do such a thing?
For example:
...
I'm using a LinkedHashMap in Java initialized to use accessOrder. In rare scenarios in a multi-threaded environment I've gotten into a state where issuing a remove on the map completes successfully but the entry is still in the map... The accessor methods to manipulate the map are all synchronized. Has anyone run into this before?
I don't believe the map needs to be volatile because the map's reference is never changing
Doing a heap dump doesn't appear to show any rogue copies of the map
Invert Some Switches on a Switchboard
Inspired by this challenge.
Goal:
Given a pre-configured switchboard and a list of numbers, invert the switches at the given indexes.
A switchboard is made up of some number of switches (v or ^) arranged into rows of varying length wrapped in -s. Here is ...
I have two sorted lists A and B of numbers. I want to associate each number in A with a different one in B so that the sum of the distances is minimised. Is this hard?
Hard as in computational complexity, or as in ease of just writing something to do it? For just writing something to do it it wouldn't be hard to just disregard the sortedness and brute force it in factorial (?) time, but it's probably possible to do more efficiently
Order shouldn't have to be preserved but it intuitively seems like assuming that order is preserved would be optimal--there's probably some obvious counterexample though
and if you're greedily matching 1->1 then it is clearly a very bad idea to assume that
but I'm guessing that the greedy approach is just not going to work generally
in this case 1->1 2->0 has the same sum of differences as 1->0 2->1 but I'm not sure about other cases
I also don't really have any formal training in algorithms so I'm not exactly an authority on this lol
I feel like you couldn't just slide A across B, since requiring the values mapped to to be contiguous in B would provide a terrible result for A=[2,99] B=[2,42,99], but sliding smaller parts of A around seems to be the general idea of it
For the first time I had to create 11 different units for a single task in Delphi. Saved everything, pressed compile, waited for 15 minutes. Delphi couldn't handle its units, BSODd my computer.
If I ever tell you guys it's good to work with Delphi, please refer me to a hospital.
Anyhow maybe one approach could be to just go through every element of the powerset of B that has the same length as A, but I'm not really sure about how fast that would be
CMC: Given a string of printable ASCII, return every letter that doesn't appear in the string. You may return these letters as upper or lowercase, but you must detect letters of both cases in the input string
Shortest code to produce a self-reproducing list, dictionary, array, etc.
Write the shortest code to produce a nested list, dictionary, array, etc. That is, when you index one of its items, you get the same result. Try this in a Python REPL:
>>> i=[]
>>> i.append(i)
>>> i
[[...]]
>>> i[0]
[[......
Invert Some Switches on a Switchboard
Inspired by this challenge.
Goal:
Given a pre-configured switchboard and a list of numbers, invert the switches at the given indexes.
A switchboard is made up of some number of switches (v or ^) arranged into rows of varying length wrapped in -s. Here is ...
