Given the m ranges that denotes subarray of an array of length n i --> [l ,r] 1<=l<=r<=n Cost of Concatination of two ranges is 1 Find the min cost to overlap the whole array or return -1 if not exist
1<=n<=100
Plz help. Thanks in advance
Given the m ranges that denotes subarray of an array of length n i --> [l ,r] 1<=l<=r<=n Cost of Concatination of two ranges is 1 Find the min cost to overlap the whole array or return -1 if not exist
1<=n<=100
Plz help. Thanks in advance
If I understood correctly, you can concatenate two overlapping ranges: concat([1, 4], [3, 6]) = [1,6]. Then I have this solution:
Complexity is O(n^2); can be reduced to O(n*log n) if you sort the ranges.
Got it thanks