Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Shuffling Parities #53

Closed
PrasoonJain2002 opened this issue Sep 30, 2021 · 4 comments · Fixed by #55
Closed

Shuffling Parities #53

PrasoonJain2002 opened this issue Sep 30, 2021 · 4 comments · Fixed by #55
Assignees
Labels
Level 1 10 Points Online Question belongs to online platforms

Comments

@PrasoonJain2002
Copy link
Contributor

Enter your question -

Chef is given an array A consisting of N positive integers. Chef shuffles the array A and creates a new array B of length N, where Bi=(Ai+i)mod2, for each i(1≤i≤N).

Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.

Enter link to the question(if question belongs to any online platform) -

https://www.codechef.com/SEPT21B/problems/SHUFFLIN/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Math, Observation

@PrasoonJain2002
Copy link
Contributor Author

PrasoonJain2002 commented Sep 30, 2021

@SarthakKeshari Kindly assign this issue to me.

@SarthakKeshari
Copy link
Owner

@PrasoonJain2002,
Kindly place your solution in "CodeChef" folder.
Deadline - 01/10/2021

@SarthakKeshari SarthakKeshari added Level 1 10 Points Online Question belongs to online platforms labels Sep 30, 2021
@PrasoonJain2002
Copy link
Contributor Author

@SarthakKeshari If I add pull request tomorrow will it be applicable for Hacktoberfest?

@SarthakKeshari
Copy link
Owner

Level 1 questions will not be kept part of Hacktoberfest. Level 2 and above

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Level 1 10 Points Online Question belongs to online platforms
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants