Fix the Buggy Array Check

Problem Statement

Fix the Buggy Array Check Problem Description You are given an implementation of a function: class Solution { public boolean solution(int[] values, int K, int L); } For a given array values of N integers and integers K and L , the function should return true if: no element of the array values appears more than L times, and values does not contain any numbers bigger than K . Otherwise, the function should return false . The attached code is still incorrect for some inputs. Despite the error(s), the code may produce a correct answer for the example test cases. The goal of the exercise is to find and fix the bug(s) in the implementation. You can modify at most three lines. Examples Example 1: Input: values = [1, 1, 4, 4], K = 4, L = 2 Output: true Example 2: Input: values = [1, 1, 2, 4], K = 4, L = 1 Output: false Explanation: Number 1 appears in the array twice, which is more than 1. Example 3: Input: values = [4, 2, 5], K = 5, L = 2 Output: true Constraints N is an integer within the ra