Ld Code Hunt 47 Puzzles 14 07 Let S Develop Codehunt

Summary

Palindrome check! Ready, set, done. ▻ All Ok, while task 1 was a soft introduction, task 2 ended up quite hard. It was more luck than anything that I had the right idea (and ... I figured this one out quickly. I implemented it quickly, in C Now for the recording suddenly the C broke for me. Can't fix it. Did you ever write a program that required you to average characters? Well, I did now. Funny idea :) ▻ All Time to say goodbye! The last task really was a trick question, which annoyed me quite a bit :( Anyways, I'm done. I'm through. Another task I originally solved with a 1-liner in C# and which I had to reimplement in Java, because C# editor broke for me. This one took me quite some time to figure out. Main reason were the test cases that were not generated for the inputs I provided, ... Another simple one. Would be even easier with LINQ-Reverse, but a naive String.reverse() implementation is not a challenge! Upper case und substring are key to the tasks in sector 06. Except for one task, max skill points are possible in Java. The right ... The first conditionals section goes easy. Most of the conditions are pretty simple, for others there are helpful hints in the initial Sector Loops 02 starts the previous ended: With only recursive solutions giving the best skill grading. I guess this is due to the ... Section final! Understanding the problem is not equivalent to being able to How to check deep equality of arrays in Java? Got me confused, this one. But it helps to focus on the most simple tools we have ... Implementing value-replacement and some i'm-not-sure-what-purpose computation on arrays. The biggest challenge remains the ... The last arithmetic levels get much more challenging. Unfortunately, I had to re-record the levels 11 to 13, because I messed up ...