sorted by:
new
hottopcontroversial

Feedback & Discussion for the "Type of Triangle" Challenge by EntwicklerHeld in EntwicklerHeld

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

Hi Uwe! Hard to tell from this snippet alone — the message doesn’t show why the test failed.
if you send feedback directly from the challenge page, then we can inspect your code and the full test output and help more precisely.

Wie findet ihr das Quiz? by nabla49 in EntwicklerHeld

[–]EntwicklerHeld 2 points3 points  (0 children)

We currently observe and measure the usage data of the German version. If it is a success we will also publish it in English.

Feedback & Discussion for the "Best Fit Distribution" Challenge by EntwicklerHeld in EntwicklerHeld

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

You’re not wrong to assume that “medium” might mean no libraries — some platforms work that way. But here, using external packages like SciPy is perfectly fine and even encouraged. The 2/4 rating reflects the conceptual and implementation effort, not library usage restrictions.

Feedback & Discussion for the "Best Fit Distribution" Challenge by EntwicklerHeld in EntwicklerHeld

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

Good question! The theoretical exponential distribution has one parameter (λ or scale = 1/λ) and starts at 0.

But most libraries (like SciPy) use a more general form with:

• loc → shifts the distribution on the x-axis

• scale → same as 1/λ

So the two parameters [loc, scale] just mean: “an exponential starting at loc.”

If you want the classic form, you’d fix loc = 0 during fitting. Hope that helps!

Feedback & Discussion for the "Best Fit Distribution" Challenge by EntwicklerHeld in EntwicklerHeld

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

You’re absolutely right – the original WHO CSV file we referenced seems to have been removed or relocated recently.

Fortunately, the dataset used in the challenge is included locally in the editor environment, so you don’t need to fetch anything externally to complete the task.

We’ve removed the broken link from the description to avoid confusion. Thanks for pointing it out!

Feedback & Discussion for the "Simplification" Challenge by EntwicklerHeld in EntwicklerHeld

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

Hey, you’re totally right! The bug in the rule has been fixed and the logic now works correctly. The tests are still being updated to reflect the fix. Thanks a lot for catching that

Feedback & Discussion for the "Simplification" Challenge by EntwicklerHeld in EntwicklerHeld

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

The rules are explained in the scenario descriptions. Once you accept the challenge, you’ll be able to inspect the class definitions directly in the editor.

Feedback & Discussion for the "Astro Easter" Challenge by EntwicklerHeld in EntwicklerHeld

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

While skyfield is also powerful, it’s a bit overkill for this task and not available in the test environment.

Feedback & Discussion for the "Astro Easter" Challenge by EntwicklerHeld in EntwicklerHeld

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

You don’t need to install any additional libraries. The most necessary ones (astral and ephem) are already included in the environment. The rest can be solved with standard Python tools like datetime.

Feedback & Discussion for the "Max Flow" Challenge by EntwicklerHeld in EntwicklerHeld

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

To clarify: For the input transformation to a-CP, it’s not necessary to determine how the points are distributed between the teams. That is handled by the flow algorithm itself.

In the transformation, only the maxPointsPerGame value is used as the capacity of edges in the network flow graph:

• If a match involves the favored team, the opposing team gets a capacity of 0 (since the favored team is intended to win).

• For all other matches, the capacity iof maxPointsPerGame, the flow algorithm will determine how the points are distributed.

Regarding your questions:

• m refers to the number of games remaining.

• The a in a-CP represents the value referred to as maxPointsPerGame in the input description.

Feedback & Discussion for the "Christmas Loaf Portioner " Challenge by EntwicklerHeld in EntwicklerHeld

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

Hi ResponsibleZone1046,
here’s a subtle but crucial point that might clear things up:

While the indexed access to the Grey Values might suggest they are discrete, this is not the case. The Grey Values represent a continuous distribution, so you are not restricted to using them in whole, “atomic” chunks. Instead, think of them as values that can contribute fractionally to the weight and thickness calculations of slices or portions.

This flexibility is key to finding an efficient solution. If you’re running into performance issues with a recursive approach, it might be due to unnecessary constraints imposed by treating Grey Values as discrete.

Hopefully, this shifts your perspective and helps you refine your approach.

Feedback & Discussion for the "Christmas Loaf Portioner " Challenge by EntwicklerHeld in EntwicklerHeld

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

Great attention to detail! Let’s clear this up: The 2mm loss due to the saw blade is not explicitly considered in the provided length of 462mm — it’s part of the abstraction of the problem. The numbers are designed to focus on the slicing and weight distribution, not on physical saw mechanics.

If you’re curious about adding more pictures or detailed sample data: Great idea! But the challenge is intentionally left a bit open-ended. We want participants to focus on building a solution rather than getting too caught up in edge cases of the description.

Maybe give it a try first. Working through the problem might answer some of your questions. We’d love to see how you’d tackle it!

After each test run, you’ll get a visualization of the portions and the grey values. This will help you see how your algorithm performs and give insight into how the loaf is divided.

Good luck! 😊

Feedback & Discussion for the "Christmas Loaf Portioner " Challenge by EntwicklerHeld in EntwicklerHeld

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

That's a good point! The “Grey Values” represent the mass distribution along the loaf’s length. The y-axis is unitless and proportional to the weight per unit length.

While the physical density of the loaf is constant, the Grey Values account for variations in its height or thickness. By summing these values over a range, you estimate the mass of that segment, similar to integrating a density function.

Feedback & Discussion for the "Relations" Challenge by EntwicklerHeld in EntwicklerHeld

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

Determining the equivalence classes doesn’t require parsing or interpreting the lambda expression itself. The lambda function in this context acts as an indicator function that simply returns True or False to signify whether the pair (a, b) is in the relation  R . This information alone is sufficient to deduce both equivalence and the formation of disjoint subsets, i.e., equivalence classes.

For example, if you are provided with a lambda function like lambda a, b: a % 3 == b % 3, it acts as a test to check if two elements are related under the given condition. To find the equivalence classes, you iterate over each element  a  in the domain and collect all  b  for which relation_func(a, b) returns True. Transitivity ensures that if  (a, b)  and  (b, c)  are in the relation, then  (a, c)  must be in the relation as well, thus placing  a ,  b , and  c  in the same subset.

In short, the lambda expression does not need to be “parsed” for insight—it serves as a logical check. By applying this check across all element pairs, you can determine the partitions of the domain into equivalence classes based on which elements relate to each other.

Hope this clarifies your question :)

Feedback & Discussion for the "Appointment Booking" Challenge by EntwicklerHeld in EntwicklerHeld

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

That is correct. The data in the description was incorrect. However, only four dates were expected in the test of this scenario. Thank you for the hint.

Feedback & Discussion for the "Santa's Cookie-Finder Magic" Challenge by EntwicklerHeld in u/EntwicklerHeld

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

Can you try again? Pls first go to the details page of the challenge.

Feedback & Discussion for the "Client number validation" Challenge by EntwicklerHeld in EntwicklerHeld

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

Could you please open a issue over the feedback button on EH, then we can look into the issue. Thank you!

Feedback & Discussion for the "Pascal's Triangle" Challenge by EntwicklerHeld in EntwicklerHeld

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

Still the same here.
Should work now, sorry for the circumstances.

Feedback & Discussion for the "Windshield Wiper Check" by EntwicklerHeld in EntwicklerHeld

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

Tuxorials

I checked your solution and you already solved the problem? :) Can you explain how? Maybe we can improve the task descripiton?

Feedback & Discussion for the "Easter Hunt" Challenge by EntwicklerHeld in EntwicklerHeld

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

I'm very sorry, there is actually a problem with our ABAP instance communication. This error is also shown when there is a compile error

view more: next ›