solves maximum product of two elements in a array

Author: anishLearnsToCode

README.md

@@ -371,7 +371,7 @@
 | 1450 | [Number of Students Doing Homework at Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)                   |                                                    [![Java](assets/java.png)](src/NumberOfStudentsDoingHomeworkAtGivenTime.java)                                                     |                                                                                                                                   |
 | 1455 | [Check If Word Occurs as Prefix of any Word in Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |                                                 [![Java](assets/java.png)](src/CheckIfAWordOccursAsAPrefixOfAnyWordInASentence.java)                                                 |                                                                                                                                   |
 | 1460 | [Make 2 Arrays Equal by Reversing Sub Arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)                           |                                                     [![Java](assets/java.png)](src/MakeTwoArraysEqualByReversingSubArrays.java)                                                      |                                                                                                                                   |
-| 1464 | [Maximum Product of 2 Elements in Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)                                  |                                                                                                                                                                                      |                                                                                                                                   |
+| 1464 | [Maximum Product of 2 Elements in Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)                                  |                                                       [![Java](assets/java.png)](src/MaximumProductOfTwoElementsInArray.java)                                                        |                                                                                                                                   |
 | 1469 | [Find All Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes)                                                                     |                                                                                                                                                                                      |                                                                                                                                   |
 | 1470 | [Shuffle The Array](https://leetcode.com/problems/shuffle-the-array)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
 | 1474 | [Delete N Nodes After M Nodes In A Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list)                         |                                                                                                                                                                                      |                                                                                                                                   |

src/MaximumProductOfTwoElementsInArray.java

@@ -0,0 +1,14 @@
+public class MaximumProductOfTwoElementsInArray {
+    public int maxProduct(int[] array) {
+        int max = array[0], secondMax = Integer.MIN_VALUE;
+        for (int index = 1 ; index < array.length ; index++) {
+            if (array[index] > max) {
+                secondMax = max;
+                max = array[index];
+            } else if (array[index] > secondMax) {
+                secondMax = array[index];
+            }
+        }
+        return (max - 1) * (secondMax - 1) ;
+    }
+}