EASY SOLUTION IN JAVA 
IntuitionkceApproachIterate Over the Array:Complexity
Time complexity:
o(N)
Space complexity:
o(1)Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
kce
# Approach
<!-- Describe your approach to solving the problem. -->
Iterate Over the Array:
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
**o(N)**
- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
**o(1)**
# Code
```java []
class Solution {
    public int maximumDifference(int[] nums) {
        int b = Integer.MAX_VALUE;
        int maxDiff = -1;

        for(int i = 0; i<nums.length; i++){
            if(b < nums[i]){
                int p = nums[i] - b;
                maxDiff = Math.max(maxDiff, p);
            }
            else{
                b = nums[i];
            }
        }
        return maxDiff;
    }
}
```
['Iterator', 'Java']