thisisshub / hacktoberfest Goto Github PK

like if we have a array like
arr={2,7,4,8}
we need to find the nearest smaller no for each element in a array.
output:
{-1,2,2,4}

This file creating an issue when I git clone the repository.
python/Amazing_Circle_design>.py

Rename the file from Amazing_Circle_design>.py to Amazing_Circle_design.py

I want to participate in the hacktober fest and that's why I am opening this issue and will provide a efficient approach to solve this question with proper explanation ..

Given number of pages in n different books and m students. The books are arranged in ascending order of number of pages. Every student is assigned to read some consecutive books. The task is to assign books in such a way that the maximum number of pages assigned to a student is minimum.

I would like to contribute on it using c++.
kindly assign this to me.

please label the PR's as hacktoberfest-accepted

ADD more hacktoberfest tags
you are not approved as a maintainer yet

Demo Code Of the game rock paper scissor with sound effects and result pop-up

language:Python

Please assign me this issue under the hacktober fest .

Given, an array of size n. Find an element that divides the array into two sub-arrays with equal sums.i.e. Find an element in array such that sum of left array is equal to sum of right array.

Language: c++

Please assign this under hacktober fest.