Get Maximum Consecutive Hidden Commits

Problem Preview

"You are working with a Git-based version control system. Each commit in a repository has a unique integer ID representing a timestamp, and the list of commit IDs is given in ascending order. The commit history is complete and consistent. You are auditing this history and want to test how many consecutive commits can be temporarily hidden (e.g., by a UI filter) such that the remaining visible commits still allow someone to deduce which commits were hidden uniquely. You are allowed to hide a contiguous block of consecutive commits. Implement a function to maximize the number of commits hidden while ensuring the surrounding commit history clearly defines the hidden range. The function getMaxConsecutiveHidden takes the following input: int commitIds[] unique integers in ascending order The function should return an integer, which maximizes the number of commits hidden. ### Example commits = [1, 3, 4, 5, 6, 9] After hiding the maximum number of consecutive commits, the array becomes [1, 3, ... 6, 9]. It is clear that the missing commits are: 4 and 5. Hence, the optimal answer is 2. ### Constraints - 1 ≤ n ≤ 2 * 10^5 - 1 ≤ commitIds[i] ≤ 10^9"