Comments by Aylin Naebzadeh (Top 32 by date)

Thank you for your advice.

No, I have tried it on paper with both samples. For the second one, I almost understand, but for the first one I did not, but thanks for your help.
Sorry because of my bad questions.

I calculate these results only in one iteration by using a "for loop".
I mean I check all of the elements only for one time.
And only the value of the two indexes changed(for the last two 1s)

I think this algorithm does not work correctly for this input:
4 -1 4 1 1
This sequence will be converted to:
4 -1 4 -2 -2
And the max element is 4, but the answer is 3. Am I right?
Are there other steps to calculate the final output in the for loop?

Sorry, but now in this example -1 0 4 0 3
I start from -1 --> it is negative --> we do not change it
then we check 0 --> the 0th element is -1 --> it is negative --> so should I subtract one from it? but it would remain always negative...

Sorry, but I did not get your solution. Actually, in this example, the max height becomes 4, not 3🤔. I mean I did not get how did you calculate this sequence:
-1 -2 -4 -2 -3
May you explain more about it?

I have read your article and it helps me to get a better idea about what is happening when we use Add, Remove and Insert methods. Thanks.

Yes, a point can be on more than one segment. I have taken a glance at tests data but unfortunately, they are not sorted. Thank you again.

yes, for example for sample 3, we have 3 segments(which have 2 coordinates) and 2 points(which only have one coordinate) and all of these segments and points are in a horizontal line. Now for this sample point x = 1 is between 2 segments (0,5) and (-3, 2), so the variable count for this point is 2, but for point x = 6, we do not have any segment which includes this point.

You are right. I would think more about it.

Thanks, BillWoodruff. I have checked samples again and I think they are correct. Actually, my code works fine with these samples, but when the number of segments and points become so large no it shows the timeout error to me.

Sorry, but we have been told to solve this question using recursion. You are right, it is not good to use Linq, but what should I use instead?

Actually, I did not update it🤔.

That's right👌

I thought that LINQ and lambdas are faster than for and foreach, but now I understand they are in this case slower and actually they have a hidden loop. And in fact the biggest advantage is that they are easy to read.

I will try it👍

Yes, I have to think more about it.

You are right. I will think more about it.

😅Ok, thanks.

Yes, thank you again.

Thank you, Luc Pattyn. Yes, when I have tried the solution of Wendelius it was a bit slow I think that was because of the recursive strategy. Now if I give an array to the input of this function I should compare the elements two by two using a for loop block am I right?

Thank you again. Yes, I understood this code just by debugging.

Thank you, @Wendelius. I am really grateful for your help. Sorry if my question was not clear. So your strategy was to use recursive functions, am I right? because I think you have called your function inside the foreach block.

Hmmmmm🤔🤔🤔no it was not. Something that I want is to find the largest number which can be created by concatenating the elements in the array.

Maybe I did not ask my question in the post clearly. But something that I want from my code is to return the largest number that can be made by concatenating the elements in the array.

Yes, you are right it is obviously better to work with numbers instead of strings😅 , but when I set the digits array = new double[]{ 3, 23, 101, 1 } it prints 1101 in the output🤔

I have tried your code but after sorting this array and when I run the code the output is: 1323101, but the largest that can be made is 3231101🤔am I right?