svce-acm/a-december-of-algorithms-2019

A December of Algorithms is a small collection of algorithms to implement this December. Finish it all to get a certificate. :christmas_tree:

a-december-of-algorithms-2019's Issues

Plagiarism Detection

What if somebody copies from somebody else's forked repo?

Can we have some test cases for each problem?

It would be really helpful to have some sample test cases (with correct answers) for each problem to run our solutions against.
I'm ready to create some test cases for the problems and make PRs if this aligns with your presentation guidelines.

Thanks!

Are we allowed to send in a pull request without completing all the questions?

Though the README clearly states that we are supposed to send in a pull request only after completing all 31 algorithms, some contributors got their pull requests merged even without completing all the questions. Is that allowed?

What if I have another solution?

If I can solve exercise 15 without backtracking it wouldn't be considered?

Misleading example on December-01?

Well, I might be wrong, but to my mind the 10th sevenish number should be 392, not 350.
Am I missing something or is the example in error?

My 10 first sevenish numbers: 1, 7, 8, 49, 50, 56, 343, 344, 350, 392

[December 09] Regarding symbols

• What all operations will be in the Function expression? e.g. power is given in the sample case, what else? Will there be square root, etc?
• And also specify the symbols that will be used for each operation.

[December - 08] Need more clarity

What if it's a 3x3 matrix and all elements are same? Then how would we calculate the cheating probability of center element?

What is the maximum N in December-06 problem?

How can i check my solutions?

Could we have some more test-cases for the problems to check the robustness of our solution, please?

What if i have solved all the questions and some of my implementations are wrong? Will i be getting the certificate?

Is the code checking done manually

beacuse input/output format isnt mentioned in Q1

Do function input/output types matter?

For certain problems the input parameter types are apparent, however for others, such as 12-02, the input parameters could be integers, strings, etc. and the outputs could be boolean, strings, etc.. When this isn't clear can the input/output types be at the discretion of the implementer or should we get clarification on a per problem basis?

Optional requirement from exercise 13

I can't understand if the function for finding how many switches on on state is optional. In the README says:

• The task is to write O(n) and constant time functions to find how many switches are in the on state (two separate functions).
• [optional] Find the switch nos. that are in the 'on' state after n such iterations.

Minor changes to the exercise

I added one more output option in exercise 16 that is royal-flush, and changed the face 10 to t.
It's ok to make this kind of changes?

There is a typo into Sevenish Number problem

> sevenish_number(10) 350
But I guess that sevenish_number(10) must equal 392. Or is that omission deliberate?