typo: through

I would remove "From the problem" it seems unnecessary.

Can you try to fix anyone between buy and sell?

I think this could be more clear, i'm not sure what this means.

Got it. I re-wrote it.

This is an excellent hint, good job!

Thanks.

We can remove "It is obvious". Some beginners might be offended by it.

I think it might be easier to start this hint with the motivation. For example, we can say start with something like this:

We are trying to maximize profit = sell - buy. If the current i is the sell value, we want to choose to minimum buy value to the left of i to maximize the profit.

I think this wording is a natural follow up to your third hint.

We also need to make sure that we can also avoid doing transaction.

This isn't super clear. Do you mean that if we cannot do a profitable transaction?

yeah, good feedback. I will make sure not to use that word again.

However, since we need to compute the result array by finding the difference between indices, we should store the indices of the elements in the stack instead of the elements themselves but should consider the values at that indices while operating the stack.

This sentence is pretty long, can we split it up.

I would specifically mention that we can use a hashset todetect duplicates in O(1) time.

Minor feedback:

1. Remove "it is obvious"
2. In the second sentence, i would start with "To count the frequency.. we can simply use an array.." Starting with the reason makes it easier to understand. Otherwise when i start that sentence idk why we are using an array.

Why [does] this work?

The problem name is the name of the algorithm that we gonna use.

The problem name is the name of the algorithm that we [can] use.

minor: I would split it up like this:

For example, consider the array [1, 2, 3, 4, 5] and target = 4. The mid value is 3, thus, on the next iteration we search to the right of mid. The remaining segment is [4,5].

Yeah, this is good statement.

Can you determine the upper bound for the possible answer?

Remove "possible". Also, we should mention thath is always greater than or equal to the length of piles, since that is the only reason we can determine the upper bound.

Because if Koko eats largest pile in one hour, then it is straightforward that she can eat any other pile in an hour only.

if koko eats [the] largest pile

Now that we have tools like chatgpt to proof read, I don't really wanna catch grammar errors for you.

It is weird that after I wrote the hint and cross-checked it with GPT for errors, it can also make mistakes in grammar.

Why are we using a variablem in a sentence before we explain what it represents. This is a poor way of conveying ideas.

Thanks, I will keep that in mind.

Even ignoring the grammar errors, I think some of these hints could be much better.

Don't you think they are overly verbose and also hard to understand?

Why didn't you just say:

Rather than linearly scanning, we can use binary search. The upper bound ofk ismax(piles) and since we are only dealing with positive values, the lower bound is1. The search space of our binary search is1 throughmax(piles).

Keep in mind, you're not writing these hints for yourself. You are writing them for other people.

if Koko cannot finish the task with a rate ofk, it means she also cannot finish it with any rate less thank. Similarly, if she can finish the task with a rate ofk, she can also finish it with any rate greater thank. This allows us to find the smallest possiblek using binary search.

The problems I see with this part are:

1. This is implied, for even the brute force solution, it's not specific to the binary search solution, so it just feels like a distraction.
2. Hints don't need to be a substitution for solutions. We don't need to provide long explanations.

I was confused by the (2) point that hints need not be lengthy. I will make sure I don't write long hints.

@Srihari2222 I don't think long hints are necessarily bad. But if it's possible to convey the same information with less words, that is preferable. I think most of the hints have been pretty good.

Why are we using length and breadth?

Don't you think in the context of this problem we should usewidth andheight. Please read the problem statement again. To be honest, I know it's easy for me to correct this, but I'm honestly a little puzzled that I had to tell you this.

I'm pretty sure you are better than me at leetcode, so why is your reading and writing skills so subpar? If you are tired, I understand. You can always take a break. I would prefer that, rather than having to give you basic feedback.

Sorry, I will try to improve it. I thought people would be comfortable with length and breadth in terms of rectangles. But yeah, I will make sure and be more focused on it now.

time to "get" the max or min

we can remove the "depending on the type of the heap" part. It's implied and it shortens the hint.

Good hint, no feedback.

I think we should say "as good or better" since an O(n) solution exists. But let me know if you did this for a reason.

Sorry, it was my mistake. But I can assure you that, I always try to see the work I have done neetcode and I always try to correct that If I made any mistake. This mistake you mentioned is an example.

I also got to know that I have done some mistakes in the solutions, when I see that I corrected those articles when I was writing Go and Kotlin solutions. Now I am 100% sure that there is no solution in those articles that gives a wrong answer and any errors other than TLE for brute force.

@Srihari2222 Thank you, i appreciate that.