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

Mahale harsh patch 2 #1583

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Mahale harsh patch 2 #1583

wants to merge 2 commits into from

Conversation

MahaleHarsh
Copy link

I have removed the Math.max calculation and directly added profit only on days when the stock price increased simplifying the logic and improving readability.
This greedy approach accumulates profit efficiently by capturing only the upward price trends.

@MahaleHarsh
Update leastCommonMultiple.js
8afe254 
applied the reduce method to iteratively compute the LCM across all numbers in the array, combining each pair of results. Additionally, I used the Euclidean algorithm for GCD calculation, which optimizes the LCM computation by reducing the multiplication size
@MahaleHarsh
Update accumulatorBestTimeToBuySellStocks.js
80fa712 
 removed the Math.max calculation and directly added profit only on days when the stock price increased, simplifying the logic and improving readability. This greedy approach accumulates profit efficiently by capturing only the upward price trends.
@Capobviouscmd
Copy link

Is there any tutorial for java?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@anandfresh anandfresh anandfresh approved these changes

@andrzejsydor andrzejsydor andrzejsydor approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
4 participants
@MahaleHarsh @Capobviouscmd @andrzejsydor @anandfresh