Welcome to Software Development on Codidact!
Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.
Activity for CrSb0001
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #293912 |
@#8176 If you're seriously that confused about the empty set (which is IMO very surprising, because of how intuitive it is), I recommend taking a look at either the Wikipedia article I linked 2 days ago or see [this](https://www.youtube.com/watch?v=gQoVmZe8tHE) video about it. (more) |
— | 2 days ago |
| Comment | Post #293912 |
Hi, Project Euler is usually very mathy, I recommend looking at [this](https://en.wikipedia.org/wiki/Empty_set#:~:text=Many%20possible%20properties%20of%20sets,the%20set%20containing%20no%20elements.) if you don't understand. Basically it's the set that has no elements, and since its sum is defined (... (more) |
— | 4 days ago |
| Edit | Post #293912 | Initial revision | — | 5 days ago |
| Question | — |
Current solution for Project Euler 250+ (HackerRank) is giving incorrect answers, why is this? Note: I originally posted this on Stack Overflow on Stack Exchange here however I am posting the same question here as I might be able to get a answer more quickly here. Project Euler+ #250 on HackerRank is as follows: >Find the number of non-empty subsets of $\{1^1, 2^2, 3^3,..., n^n\}$, the... (more) |
— | 5 days ago |