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 Problem #1399

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Commits on Oct 16, 2021

  1. Shuffling Problem

    Provided an array A, shuffle all the elements and create a new array B in such a way that each element B[i] is (A[i] + i)%2 . Now find the maximum possible sum of integers of the array B, if you shuffle the array optimally.
    Bipradeep02 authored Oct 16, 2021
    Configuration menu
    Copy the full SHA
    3c088d3 View commit details
    Browse the repository at this point in the history