Next coding challenge

[R Giskard Reventlov]

Code the flux capacitor?

[PIEBALDconsult]

That's a hardware problem.

[David ONeil]

An arc could be interesting. Do one component of a simple game, or other task, every week, and put it together at the end. Or recode the entire codeproject site, one step at a time :) oh wait - I meant :~

My CodeProject Articles :: Our forgotten astronomic heritage :: My website.
"Sorry, buddy, but this mission counts on everyone being as silent as possible, and your farts are just too much of a wildcard." - Korra to Meelo, "Kuvira's Gambit"

[dan sh]

Josephus problem solver Collatz sequence generator An Angular2 SPA app that allows managing certain entities. And just for testing purposes, use Node for server side.

"It is easy to decipher extraterrestrial signals after deciphering Javascript and VB6 themselves.", ISanti[^]

[BillWoodruff]

I like the coding challenges, but, why should they be "simple" ? best, Bill

«There is a spectrum, from "clearly desirable behaviour," to "possibly dodgy behavior that still makes some sense," to "clearly undesirable behavior." We try to make the latter into warnings or, better, errors. But stuff that is in the middle category you don’t want to restrict unless there is a clear way to work around it.» Eric Lippert, May 14, 2008

[PIEBALDconsult]

I, for one, do not have access to Chris' Big List of Mickisms with which to test mine. Without The List -- and sixteen (!) years worth of posts -- none of us can perform a proper stress test of our codez. I also don't want to melt down my system.

[Jon McKee]

A Collatz generator could be interesting since there are optimizations available but the Josephus problem already has an extremely simple solution using binary. I doubt it would yield any interesting programs except maybe the language used. Not a fan of the app since that specifically targets only people that use both AngularJS and NodeJS. Just my 2 cents :)

[Jon McKee]

I know I wouldn't want to spend all my time in a week looking over 20+ KLOC from 15+ entries, testing them to ensure they meet the requirements, and then using some metric to rate which came out on top. Depending on complexity that might be a restrained estimate as well X|

[Kornfeld Eliyahu Peter]

It maybe too easy, but in honor of the ongoing Chess Word Championship (for humans and for chess engines) we may do the 8 queen problem...

Skipper: We'll fix it. Alex: Fix it? How you gonna fix this? Skipper: Grit, spit and a whole lotta duct tape.

[dan sh]

Jon McKee wrote:

Not a fan of the app since that specifically targets only people that use both AngularJS and NodeJS.

I was just being smart here to get my work done. ;P

"It is easy to decipher extraterrestrial signals after deciphering Javascript and VB6 themselves.", ISanti[^]

[Kirill Illenseer]

Drawing Lissajous curves with (pseudo)random variying frequencies for X and Y in away that the resulting line remains uninterrupted.

[Mark_Wallace]

How about "Do something to make my life* easier"? * Mine, that is.

I wanna be a eunuchs developer! Pass me a bread knife!

[kalberts]

When we were students, a long, long time ago, one of my fellow students realized that he didn't master recursion very well - termination conditions in particular. So he defined a simple programming challenge for himself: The program should draw a vertical zigzag line of asterisks on the printer (this was in the age of line printers): A count of spaces reflecting the recursion depth, with a "*" at the end. Each function call creates one such line, nothing else. Now, at the top, "main()" level, he would call the recursive function with an argument MaxRecursionDepth to which the recursion should go directly when started (creating a slanted line of asterisks), an argumment IntermediateRecursionDepth to which the recursion should unroll (continuing the line, slanting the other way, but not all the way back). Then, it should recurse deeper again to MaxRecursionDepth and unroll to IntermediateRecursionDepth, reapeated as many times as indicated by the third agument, NumberOfPeaks, before unrolling to complete the program. The printout should look like a tipped-over contour of a row of mountain peaks separated by valleys, the peak height, number of peaks and valley depths given by the three arguments. If you have been writing recursive functions every day the last ten years, this is quite trivial. But if you are a student who heard the term 'recursion' for the first time last week, it takes some fiddeling to get those termination tests (and re-recursing tests) right. And then, when you see the working solution, you won't understand why it took that much effort to get it correct :-)

[PIEBALDconsult]

I did N-Queens a few years back, but not the ability to determine which solutions are distinct/unique. So include the above suggestion of rotating an NxN matrix, add flipping of the matrix, and then you've got something. :cool:

[PIEBALDconsult]

Except we wouldn't use recursion, would we? :suss:

[PIEBALDconsult]

Implementing games is good exercise. The first game I implemented (in BASIC-plus on a PDP-11 in 1983) was Master Mind. How about a function that determines the black/white counts for two arrays of items -- not just arrays of four colors, but two IList<IEquatable>s of equal size. (Well, maybe don't state it so .net-specific.)

[Baraaaaaa]

adventofcode.com will begin tomorrow.

[kalberts]

I can draw a zigzag line witout using a computer at all! It wouldn't teach me much about terminating a recursion, though.

[Kyle Moyer]

Need someone to finish that novel for you? ;P

[BillWoodruff]

Hi, Jon, I would distinguish the relative difficulty of a problem from whether or not a problem inherently demands a lengthy solution.

«There is a spectrum, from "clearly desirable behaviour," to "possibly dodgy behavior that still makes some sense," to "clearly undesirable behavior." We try to make the latter into warnings or, better, errors. But stuff that is in the middle category you don’t want to restrict unless there is a clear way to work around it.» Eric Lippert, May 14, 2008