### Longest decrease subsequence subarray in Javascript

I am getting ready for some interviews for my intern and I encountered this question: Find longest decrease sequence in an array So basically, if [3,1,4,3,2,1,2,3] is given, it will return [4,3,2,1] as the longest sequence within it. I was able to solve this question with O(n^2) time complexity but I feel like I can…

Details