you give integer array num integer k you partition num subsequence element num appear exactly subsequencesreturn minimum number subsequence need difference maximum minimum value subsequence kA subsequence sequence derive sequence delete element change order remain element Example 1input num 36125 k 2Output 2ExplanationWe partition num subsequence 312 65the difference maximum minimum value subsequence 3 1 2the difference maximum minimum value second subsequence 6 5 1since subsequence create return 2 it show 2 minimum number subsequence neededexample 2input num 123 k 1Output 2ExplanationWe partition num subsequence 12 3the difference maximum minimum value subsequence 2 1 1the difference maximum minimum value second subsequence 3 3 0since subsequence create return 2 note optimal solution partition num subsequence 1 23example 3input num 2245 k 0Output 3ExplanationWe partition num subsequence 22 4 5the difference maximum minimum value subsequence 2 2 0the difference maximum minimum value second subsequence 4 4 0the difference maximum minimum value subsequence 5 5 0since subsequence create return 3 it show 3 minimum number subsequence need Constraints1 numslength 1050 numsi 1050 k 105