Longest Subsegment <= K
Given an array A of N integers and an integer K, find the length of the longest subsegment where all elements are less than or equal to K. Input: N K then A elements. Output: single integer.
5 3
1 2 5 3 227 10
1 2 3 4 5 11 65
0
0%
1