this site is not very old and yet, speaking as mostly an "outsider," clearly has a colorful/ unusual history. it is not a typical site for stackexchange and has many unique aspects, such as demographics like a very dedicated user base, young, and very eager to learn, etc.
my suggestion is that s...
this site is not very old and yet, speaking as mostly an "outsider," clearly has a colorful/ unusual history. it is not a typical site for stackexchange and has many unique aspects, such as demographics like a very dedicated user base, young, and very eager to learn, etc.
my suggestion is that s...
@MartinBüttner yes lol. I upvoted though - it would be a great post to have, especially for people joining the site. It can give an insight into why there are questions from years ago that would no longer be accepted.
I'm not that familiar with file system manipulation
Maybe you should post it as a question :)
Just posting in the sandbox might give you a very short solution that would show that it isn't suitable as a main site question - but then you'd have your answer anyway...
"An abstract data type is defined only by the operations that may be performed on it and by mathematical pre-conditions and constraints on the effects (and possibly cost) of those operations. "
so in an abstract data type you don't say HOW anything will be done
just what operations have to be supported
for example, insert(x), delete(x), find next biggest number bigger than x
in a data structure you say how this should be done
so an abstract data type challenge would let the programmer choose how to solve the problem
One of my coworkers told me that a Visual Studio extension existed that could recursively reload all dependencies for a given project. Now he has no recollection that he ever told me that. Does anyone here know what extension he might have been talking about?
Calculate cellphone key presses as quickly as possible from a cellphone keyboard!
Here's a nice challenge: Calculate cell-phone keypresses. It has you calculate the amount of keypresses it takes to produce a set of characters on a cellphone keyboard.
That challenge was ordinary code-golf. This ...
@feersum I commented something to that effect. I don't mind having further phone keyboard challenges, but at least the actual challenge should be novel.
Is it better to delete/fix/undelete or just fix in place if you realize you really screwed up a code golf, assuming you are working on it now and it won't take very long?
Transposing for C# (not the language)
code-golf c# java python
In this challenge, your job is to transpose a series of notes which you will be given so that the resulting sequence contains as many C# notes as possible.
Input
You may write a function or program which accepts one argument: an a...
@ArtOfCode I don't think the time restriction is really necessary at all. Something like "must run within 10 seconds on a reasonable desktop PC" seems absolutely sufficient.
you should definitely include more background about the challenge though. don't assume people know what "transposing" means. and I'd prefer if the list of frequencies was included in the challenge.
Oh neat. Python array slicing handles out of bounds. So I can do this: list = [1,2,3,4] # a list with four elements slice = list[3:7] # a slice from the fourth to the eighth element
@Doorknob Can you edit? I am taking a screenshot for a feature request on meta and I want to make it purty. I am not excited about this :( I am not excited about this weather :(
Calculate cellphone key presses as quickly as possible from a cellphone keyboard!
Here's a nice challenge: Calculate cell-phone keypresses. It has you calculate the amount of keypresses it takes to produce a set of characters on a cellphone keyboard.
That challenge was ordinary code-golf. This ...
Transposing for C# (not the language)
code-golf c# java python
In this challenge, your job is to transpose a series of notes which you will be given so that the resulting sequence contains as many C# notes as possible.
Input
You may write a function or program which accepts one argument: an a...
