2 Problems
60 minutes

Question 1:
Given an array of integers. Count the number of good subsequences. A good subsequence is the one which contains all elements from min to max and all the elements are unique.
Example, array is [5, 4, 5, 7, 8]. Good subsequences are: [5], [4], [5], [7], [8], [5,4], [4,5], [7,8]

Question 2:
https://leetcode.com/discuss/interview-question/783699/recycling-cartridges-oa-hackerrank

Upvote if you find this helpful!