Defect Description:given a set of numbers the output should contain the single number which is the length of the longest monotone decreasing subsequence.given set of numbers are 1 2 3 4 5 6 7 8 for which there is no monotone decreasing subsequence. hence the output should be 0 but it is given as 1 which is incorect.steps to reproduce:1.click on problem solving lab.2.click on sequences.3.click on introduction.4.go through the problem 1.expected result:the expected output should be 0 since there is no monotone decreasing subsequence.actual result:given output is 1 which is incorrect.label:category:bugtype of issue:functionality
Defect Description:given a set of numbers the output should contain the single number which is the length of the longest monotone decreasing subsequence.given set of numbers are 1 2 3 4 5 6 7 8 for which there is no monotone decreasing subsequence. hence the output should be 0 but it is given as 1 which is incorect.steps to reproduce:1.click on problem solving lab.2.click on sequences.3.click on introduction.4.go through the problem 1.expected result:the expected output should be 0 since there is no monotone decreasing subsequence.actual result:given output is 1 which is incorrect.label:category:bugtype of issue:functionality