| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2018|[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2018.java)||Medium||

|2016|[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2016.java)||Easy||

|2012|[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2012.java)||Medium||

|2011|[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2011.java)||Easy||

|2007|[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2007.java)||Medium||

packagecom.fishercoder.solutions;

publicclass_2016 {

publicstaticclassSolution1 {

publicintmaximumDifference(int[]nums) {

intmaxDiff = -1;

for (inti =0;i <nums.length -1;i++) {

for (intj =i +1;j <nums.length;j++) {

if (nums[j] >=nums[i]) {

maxDiff =Math.max(nums[j] -nums[i],maxDiff);

}

}

}

returnmaxDiff;

}

}

}