Close to Perfection
Easy Accuracy: 31.05% Submissions: 1035 Points: 2

Geek likes this girl Garima from his neighborhood, and wants to impress her so that she may go on a date with him. Garima is a Perfectionist and likes only PERFECT things .This makes Geek really nervous, and so Geek asks for your Help.!
Geek has baked a cake for Garima, which is basically an array of Numbers. Garima will take only a Perfect Piece of the cake.
A Perfect Piece is defined 
as - a subarray such that the difference between the minimum and the maximum value in that range is at most 1. Now, Since garima just loves cake, She wants a Perfect Piece Of Maximum length possible. Help Geek go on a date.!

The first line of the input contains an integer T denoting the number of test cases.

  • The first line of each test case contains an integer n-denoting the length of the array.
  • The second line contains n space separated integers -denoting the cake

For each 
testcase, output a single line containing the maximum Possible length of the subarray which is a Perfect piece



  • 1T100
  • 1n1 000
  • 1 Ai 1000

  • Example

    8 8 8 8
    1 2 3 3 2
    5 4 5 5 6 7 8 8 8 7 6



    Example case 1. The longest subarray is [1, 4] where maximum=8 and minimum = 8 and difference is 0,which is less than 1. Its length is 4.

    Example case 2. 1-based indexing. The longest subarray is [2, 5] where maximum=3 and minimum is 2 and difference is 1. Its length is 4.

    Example case 3. The longest subarray is [6, 10] where maximum=8 and minimum is 7 and difference is 1. Its length is 5.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.