Largest Subarray With Contiguous Elements

easy
Question Solve Solutions 
1. You are given an array(arr) of integers. Values may be duplicated.
2. You have to find the length of the largest subarray with contiguous elements.

Note -> The contiguous elements can be in any order(not necessarily in increasing order).

Input Format

A number N arr1 arr2.. N numbers

Output Format

A number representing the length of the largest subarray with contiguous elements.

Constraints

1 <= N <= 10^4
1 <= arr[i] <= 10^3

Example

Input
3
10 12 11
Output
3
Previous
Count Distinct Elements In Every Window Of Size K
Next
Count Of All Subarrays With Zero Sum

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself