Optimize the size of a set
For all strings in the challenge, the input alphabet is {-1,1}.
For a string A of length 2n-1 consider all n substrings A[i,...,i+n-1]. For a given string B of length n, we output 1 if the inner product of A[i,...,i+n-1] and B is positive and 0 otherwise. For a pa...
I noticed today, that when you choose walking directions on Google Maps, it still has the following warning:
Walking directions (beta): Use Caution
Why are walking directions still in Beta? It's probably been around five years since I first noticed this, so can someone please explain why it ha...
> But the former Google employee says: "The top voted entries on Stack Exchange are just not on par with the best solutions I've witnessed at Google, which exude an elevated level of creativity and craftsmanship rarely found elsewhere. Reading the code can easily trigger a software engineer's imposter syndrome, a profound feeling of humbleness, tinged with a sense of proudness to be working with these talented people."
it can be for n number of reasons - improper directions / not accurate enough / not all areas covered / edge cases not consider. Unless we have a Google employee come in a definitive answer (with a source), question is speculative. If you'd like to contest the closure, please consider opening a question on our Web Applications Meta site. — Sathya ♦1 min ago
@Beta For the record, where do you see the beta message? Pulling it up on my desktop doesn't show 'beta' at all, just "Use caution - may involve errors or sections not suited for walking".
Your Task
Given a list of words, check if they form a valid word grid. They form a valid grid if there are N words with N letters and they spell the same words vertically as they do horizontally. The words can be given in any order. [FILE, ICED, LEAD, EDDY] = True and [FILE, LEAD, EDDY, ICED] = ...
That reminds me...I was thinking of offering a bounty if anyone can demonstrate a solution where they used import itertools that is shorter than any solution without it
It's sad that I get more votes in 15 minutes for a trivial answer to a trivial question than I get in 24 hours for an answer which I spent a couple of hours thinking about.
Python golf: Is itertools ever the answer?
I offer a 200 reputation bounty to the first user to demonstrate that his/her solution to an existing question using itertools is shorter than any solution which does not import itertools. To compete, the user must first nominate the answer (in chat or ...
It made me "select all images with soup" ??? Anyone else had to do that?
@Maltysen I'd just need to send a POST request to the main page, and have it parse it.
@Geobits Characters are really stored as Strings on the stack, but they are a quick way to save a byte when [golfing](http://codegolf.stackexchange.com). ``` 'io ``` *Outputs `i`"
@trichoplax are you reading "Your score will be the highest n for which you have the highest or equal highest value in your output when compared to the values in my question or to anyone else's. Non-existent values are assumed to be zero. "?
So when deciding the winner, you see if there is a winner for n=2, then if not you see if there is a winner for n=3, and so on until the winner is unique or you run out of numbers and it's a tie
For all strings in the challenge are over the alphabet {-1,1}.
For a string A of length 2n-1 consider all n substrings A[i,...,i+n-1]. For a given string B of length n, we output 1 if the inner product of A[i,...,i+n-1] and B is positive and 0 otherwise. For a pair A, B we therefore output n...
@randomra I think I'm out of ideas. I've already made some really hacky changes now to golf it further. I've added the full explanation now, but feel free to have another look if you can find anything to shorten it.
@DigitalTrauma added the full explanation to the Retina Retina answer
How can I compile a functional language into bytecode?
My problem is this. Given this program in a haskell like syntax:
add = (\x -> (\y -> x + y))
main = add 5 7
I want to compile it to a simple bytecode and export it in a file.
Then I want to create a virtual machine that can interpret tha...
Optimize the size of a set
For all strings in the challenge, the input alphabet is {-1,1}.
For a string A of length 2n-1 consider all n substrings A[i,...,i+n-1]. For a given string B of length n, we output 1 if the inner product of A[i,...,i+n-1] and B is positive and 0 otherwise. For a pa...
I noticed today, that when you choose walking directions on Google Maps, it still has the following warning:
Walking directions (beta): Use Caution
Why are walking directions still in Beta? It's probably been around five years since I first noticed this, so can someone please explain why it ha...
How can I compile a functional language into bytecode?
My problem is this. Given this program in a haskell like syntax:
add = (\x -> (\y -> x + y))
main = add 5 7
I want to compile it to a simple bytecode and export it in a file.
Then I want to create a virtual machine that can interpret tha...
