Given an integer array, find the largest subarray formed by consecutive integers. The subarray should contain all distinct values.

The problem differs from the problem of finding the longest subsequence formed by consecutive integers. Unlike subsequences, subarrays are required to occupy consecutive positions within the original array.
#Data_structure

The idea is to consider every subarray and keep track of the largest subarray found so far, formed by consecutive integers. For a subarray to contain consecutive integers,

* The difference between the maximum and minimum element in it should be exactly equal to the subarray’s length minus one.

* All elements in the array should be distinct (we can check this by inserting the elements in a set or using a visited array).
#Source_code
#Data_structure

#Source_code
#51

#Output
#51

Diamond Character Pattern
#Source_code
#52

Diamond Character Pattern
#Output
#52

#Source_code
#53

#Source_code
#54

#Output
#54

#Source_code
#55

#Source_code
#56

Using clone() Method
The clone() method is the method of Object class. It creates a copy of an object and returns the same copy. The JVM creates a new object when the clone() method is invoked. It copies all the content of the previously created object into new one object. Note that it does not call any constructor. We must implement the Cloneable interface while using the clone() method. The method throws CloneNotSupportedException exception if the object's class does not support the Cloneable interface. The subclasses that override the clone() method can throw an exception if an instance cannot be cloned
#Source_code
#57

Given an integer array, find the maximum length subarray having a given sum.
#Data_structure

The problem differs from the problem of finding the maximum length subsequence with given sum. Unlike subsequences, subarrays are required to occupy consecutive positions within the original array.
#Source_code
#Data_structure

We can use a map to solve this problem in linear time. The idea is to create an empty map to store the first subarray’s ending index, having a given sum. We traverse the given array and maintain the sum of elements seen so far.

* If the target is seen for the first time, insert the sum with its index into the map.
* If target-S is seen before, there is a subarray with the given sum that ends at the current index, and we update the maximum length subarray having sum S if the current subarray has more length.
#Source_code
#Data_strucutre

Assigning a Variable to the int Variable.
To print the ASCII value of a character, we need not use any method or class. Java internally converts the character value to an ASCII value.
#Source_code
#58

#Output
#58

#Source_code
#59

#Output
#59