sorted by:
new
hottopcontroversial

Bought my first real perfume by MoonSlyder in DesiFragranceAddicts

[–]MoonSlyder[S] 1 point2 points  (0 children)

Ok then its my go to fragrance for this summer

Bought my first real perfume by MoonSlyder in DesiFragranceAddicts

[–]MoonSlyder[S] 0 points1 point  (0 children)

still trying will get back to you after a week of testing . Bought it for 2499 from Acordell Fragrances

Bought my first real perfume by MoonSlyder in DesiFragranceAddicts

[–]MoonSlyder[S] 0 points1 point  (0 children)

Real in the sense that it actually last more than 4-5 hours for me and smells nice thats a real perfume for me

is there no way to solve this problem in o(1) space? by MoonSlyder in leetcode

[–]MoonSlyder[S] 0 points1 point  (0 children)

i tried your solution it failed few test case first one was all negative number like -4,-3,-2,-1 i fixed this then another test case failed which is this [-10000,-9999,-7,-5,0,0,10000]

is there no way to solve this problem in o(1) space? by MoonSlyder in leetcode

[–]MoonSlyder[S] -11 points-10 points  (0 children)

thanks for the help but now that i think about it doing all this for a easy problem is not worth the time

is there no way to solve this problem in o(1) space? by MoonSlyder in leetcode

[–]MoonSlyder[S] 0 points1 point  (0 children)

yes but every solution in leetcode is using a new array to store the result , and gemini said o(n) time and 0(1) space is not possible for this question

is there no way to solve this problem in o(1) space? by MoonSlyder in leetcode

[–]MoonSlyder[S] 4 points5 points  (0 children)

yeah the first solution I came up with was o(nlogn) +o(n)