Can anyone help me in sorting this question.

Revision en2, by serpent54, 2023-02-11 09:21:37

How to think about to write code of finding the longest subarray with sum greater than or equal to k in O(nlogn).


  Rev. Lang. By When Δ Comment
en2 English serpent54 2023-02-11 09:21:37 13 Tiny change: 'ongest subsequence with sum ' -> 'ongest subarray with sum '
en1 English serpent54 2023-02-11 08:54:23 160 Initial revision (published)