Min Cost to Repair Edges (Minimum Spanning Tree II)
AmazonOnline AssessmentMSTGraph
Rose Garden
GoogleOnline Assessment
Minimum Number Of Decreasing Subsequence Partitions
GoogleOnline AssessmentHardDP
Cut Binary Search Tree
AmazonTreeBSTHardLC
Subtree: Maximum Average Node
AmazonOnline AssessmentMediumTree
Fill 2D Array
GoogleOnline Assessment
Rearrange String
String
Pickup Coupon
GoogleOnline Assessment
Tree Diameter
Google
Top N Buzzwords
AmazonOnline AssessmentHOT
Load Balancer
AmazonOnline Assessment
Find Substrings
AmazonOnline AssessmentHard
Partition String
AmazonOnline AssessmentStringMedium
Minimum Number Of Decreasing Subsequence Partitions
(This question has been seen in the interviews of the following companies: Google)
Minimum Number Of Decreasing Subsequence Partitions
Given an int array of length n. Split it into strictly decreasing subsequences. Output the minimum number of decreasing subsequences you can get by splitting the array...