<aside> 💡
Number of element =
UL - LL - 1 ( when both exclusive )
UL - LL - 1 ( when both inclusive )
UL - LL ( when any one inclusive & other exclusive )
</aside>
<aside> 💡
To find maximum
define
**int max = Integer.MIN_VALUE;**
</aside>
<aside> 💡
zero-based index of the lowercase letter
**char ch = 'd';
int index = ch - 'a'; // index = 3**
</aside>
<aside> 💡
index get into 0 after reaching end
**(i + 1) % n //cycles forward.
(i - 1 + n) % n //cycles backward.**
</aside>
<aside> 💡
**changes on arr will reflect to brr
this will not work same in — strings**
int arr[] = new int[3];
arr[0] = 4;
System.out.println(arr[0]); // 4
int brr[] = arr; // --> both point to same
brr[0] = 8;
System.out.println(arr[0]); //8
</aside>