there are two question :

1st : hashing question where to find the subarray with specific rules i don't remember that sorry.

2nd : was longest decreasing sublist of linked list another version of longest incresing subsequence in array ( dp problem)

        I have two approach i.e sliding window try to extend as large as possible and start from last extension approach takes O(n) time 
	   --P.C : best approach 
	   another one will be slight dp or brute force way to try by going to every number and track back the bast records O(n^2)
	   -- don't do it.
	   
I got the rejection mail 🥲. 

Even i slove them in just 30 mins outoff 75  mins.