Serious Can you solve this problem

[cripplecel]

You are given an array, prices where prices is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

 

[Choler]

dnr

 

[cripplecel]

dnr

If you solve it you get a million bucks

 

[Janaki]

What's the question

 

[Anthrofurrcel]

What's the question

 

[cripplecel]

What's the question

Create a function to solve this problem

Like this

 

[BurntIvoryKingcel]

@trying to ascend alt?

 

[based_meme]

Do you own programming homework, boyo.

 

[Janaki]

Create a function to solve this problem

Like this
View attachment 1430307

I got nothing

 

[cripplecel]

Do you own programming homework, boyo.

I solve it already

 

[based_meme]

I solve it already

Good. Let me guess, binary search?

 

[cripplecel]

Good. Let me guess, binary search?

No need for that

Lowest price = max int value
Max profit = 0

Just need to iterate on the array.

On each iteration:
profit = current price - lowest price
If ( profit > max profit ) then max profit = profit
If (current price < lowest price) then lowest price = current price

Return max profit

 

[based_meme]

No need for that

Lowest price = maxint
Max profit = 0

Just need to iterate on the array.

On each iteration:
profit = lowest price - current item
If ( profit > max profit ) then max profit = profit
If (current price < lowest price) then lowest price = current price

Return max profit

Fucking arrays in leet code problems. I've always hated this shit. JFL

 

[cripplecel]

Fucking arrays in leet code problems. I've always hated this shit. JFL

Gotta know a bunch of shit like sliding window, two pointer, hashmap, hashset for these array / string problems.

This problem was solved with the two pointer technique.

 

[Diddy]

You ain't getting no job by solving high school questions boyo.

 

[outerdarkness]

What is the Compromise of 1850?

 

[cripplecel]

You ain't getting no job by solving high school questions boyo.

Yes this is very easy problem

 

[cripplecel]

What is the Compromise of 1850?

Idk niggà

 

[Drekavac]

No

 

[outerdarkness]

Idk niggà

Don’t worry about it it was a joke.

 

[based_meme]

Yes this is very easy problem

And I overcomplicated it.

Kind of embarrassing me for, tbh.

 

[cripplecel]

And I overcomplicated it.

Most people will struggle with easy level questions initially.

when I first did this I did a fully retarded solution.

 

[Diddy]

And I overcomplicated it.

Kind of embarrassing me for, tbh.

Tbf I had a stroke reading the first sentence.

 

[based_meme]

Most people will struggle with easy level questions initially.

when I first did this I did a fully retarded solution.

My first thought was to keep splitting the array and look for i and j where i is at the lowest and j is at the highest for every split. Then if i < j, then it's just max(j-i).

But that didn't work.

 

[based_meme]

Tbf I had a stroke reading the first sentence.

It's not so bad, if you know some programming, tbh, but I could see how it would be confusing.

 

[Mihailo Toloto]

120 iq

 

[Diddy]

It's not so bad, if you know some programming, tbh, but I could see how it would be confusing.

Yeah you can just ignore the first sentence.