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.

Sign up for GitHub

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

Jump to bottom

Stock buy & sell Maximum Profit #8

Open
amarjeet2003gupta opened this issue Oct 29, 2022 · 3 comments
Open

Stock buy & sell Maximum Profit #8

amarjeet2003gupta opened this issue Oct 29, 2022 · 3 comments

Comments

@amarjeet2003gupta
Copy link

The cost of stock on each day is given in an array A[] of size N. Find the maximum profit if a person can buy and then sell stock only one time.

Input :
10
100 120 140 310 50 150 1 250 4 40
@amarjeet2003gupta
Copy link
Author

Hello sir/ma'am,
I found this as an important DSA problem
Can you please assign this issue to me.

@ParthBoghani46
Copy link

hey , i am new to open source and i have little knowledge about dsa. can you assign me

@Chandanmali
Copy link

Hello sir/ma'am,
I found this as an important DSA problem
Can you please assign this issue to me.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@Chandanmali @amarjeet2003gupta @ParthBoghani46