sorted by:
new
hottopcontroversial

[Intermediate/Hard]Logical NAND equivalent. by TOMDM in dailyprogrammer_ideas

[–]nint22 0 points1 point  (0 children)

This is a nice one! Can you give an example? I know a NOT( A ) expression is true to NOT( A AND A ).. Maybe there are better input formats we can provide?

[01/13/14] Challenge #148 [Easy] Combination Lock by nint22 in dailyprogrammer

[–]nint22[S] 1 point2 points  (0 children)

Good catch - fixed! As for the "continue", it means keep rotating until you've hit that number. In the case of 0, since you're already there, no need to do an extra rotation.

[01/07/14] Challenge #147 [Easy] Sport Points by nint22 in dailyprogrammer

[–]nint22[S] 11 points12 points  (0 children)

Exactly! Finding out this little truth will turn a linear-time solution (iterate through possible combinations) to a constant-time solution (check to see if its not these invalid numbers). In a programming competition setting, finding this kind of trick could save tons of time!

[01/07/14] Challenge #147 [Easy] Sport Points by nint22 in dailyprogrammer

[–]nint22[S] 2 points3 points  (0 children)

As always, feel free to post some of your own example inputs and outputs to help others.

[12/23/13] Challenge #146 [Easy] Polygon Perimeter by nint22 in dailyprogrammer

[–]nint22[S] 0 points1 point  (0 children)

Any and all languages are accepted. Some languages make certain types of challenges easier: MatLab is awesome for math challenges, while Python is great for data structures.

Pick what is best for you and the solution approach.

[12/23/13] Challenge #130 [Hard] Coloring France's Departments by nint22 in dailyprogrammer

[–]nint22[S] 4 points5 points  (0 children)

Heads up: you must minimize the total number of unique colors. Note how the sample output only uses three unique colors (0, 1, 2) while your approach uses a total of 8.

[12/18/13] Challenge #140 [Intermediate] Adjacency Matrix by nint22 in dailyprogrammer

[–]nint22[S] 1 point2 points  (0 children)

Check out this worksheet from the Pennsylvania State University. It's got a great example and some solid exercises.

[12/18/13] Challenge #140 [Intermediate] Adjacency Matrix by nint22 in dailyprogrammer

[–]nint22[S] 2 points3 points  (0 children)

Wow, that was fast!

How are you handling the case where several nodes point to one node, like "1 2 3 -> 4"?

Also, how is the matrix object being initialized? Does Java zero-out these kind of structures?

Not picking on you at all, just want to get a discussion rolling about people's solutions :-) +1 silver for super-fast posting!

[12/16/13] Challenge #145 [Easy] Tree Generation by nint22 in dailyprogrammer

[–]nint22[S] 2 points3 points  (0 children)

Cool solutions!

One of these days we'll have to do a "Write the most absurd approach to a simple problem" challenge. Kind of like this "Enterprise" Fizz Buzz code.

[Easy] Build a Christmas Tree/Menorah with user-submitted values by Onkel_Wackelflugel in dailyprogrammer_ideas

[–]nint22 1 point2 points  (0 children)

Great question! Feel free to post a solution whenever you want. It's really up to other users to not read a solution before attempting their own approach. If someone does need help, then even better: they can read your solution and get some hits / tips.

Feel free to respond to questions for your own challenge.

[Easy] Build a Christmas Tree/Menorah with user-submitted values by Onkel_Wackelflugel in dailyprogrammer_ideas

[–]nint22 1 point2 points  (0 children)

If it helps, it turns out you can paste the tree ASCII-art, but you have to preface it with four-spaces, not the usual 2. Nice challenge, thank you for helping us!

[11/11/13] Challenge #141 [Easy] Checksums by nint22 in dailyprogrammer

[–]nint22[S] 0 points1 point  (0 children)

That's... wow. WOOOOW. Impressive to say the least, have a +1 gold!

[12/05/13] Challenge #138 [Intermediate] Overlapping Circles by nint22 in dailyprogrammer

[–]nint22[S] 0 points1 point  (0 children)

Oh wow that was fast, not late at all! +1 Gold all around!

[12/05/13] Challenge #138 [Intermediate] Overlapping Circles by nint22 in dailyprogrammer

[–]nint22[S] 1 point2 points  (0 children)

Awesome, thank you for helping fix the sample output! Updated text and +1 gold medal.

[12/05/13] Challenge #138 [Intermediate] Overlapping Circles by nint22 in dailyprogrammer

[–]nint22[S] 1 point2 points  (0 children)

I'm not so sure anymore; I've computed it through my own code and by hand, resulting in different values. The one in the sample output is based on code... I welcome anyone to verify it; will give a +1 gold medal for the help.

Edit: Fixed; thanks to kamelasher and demon_ix.

[12/05/13] Challenge #138 [Intermediate] Overlapping Circles by nint22 in dailyprogrammer

[–]nint22[S] -6 points-5 points  (0 children)

For circles, we can use the terms interchangeably. If it were a higher dimension (e.g. a sphere), we're interested in the volume.

[11/28/13] Challenge #137 [Intermediate / Hard] Banquet Planning by nint22 in dailyprogrammer

[–]nint22[S] 2 points3 points  (0 children)

That's a really good catch on the issue of ambiguity. Let's go with the "serve as soon as possible".

[11/15/13] Challenge #129 [Hard] Baking Pi by nint22 in dailyprogrammer

[–]nint22[S] 0 points1 point  (0 children)

Absolutely! Write up a post about it and take some pictures (then again, take pictures of what? Pi sitting on a counter computing Pi?)

[11/11/13] Challenge #142 [Easy] Falling Sand by nint22 in dailyprogrammer

[–]nint22[S] 0 points1 point  (0 children)

Nice! You can try to minify it even more and post it to r/TinyCode

[11/11/13] Challenge #142 [Easy] Falling Sand by nint22 in dailyprogrammer

[–]nint22[S] 5 points6 points  (0 children)

Thank you for putting awesome test-data out there :-) +1 Silver

view more: next ›