We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3985d27 commit 2cc6fc0Copy full SHA for 2cc6fc0
1464_Maximum_Product_of_Two_Elements_in_an_Array.java
@@ -1,7 +1,13 @@
1
-// id: 1464
2
-// Name: Maximum Product of Two Elements in an Array
3
-// link: https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/
4
-// Difficulty: Easy
+/*
+ * 1464. Maximum Product of Two Elements in an Array
+ * Problem Link: https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/
+ * Difficulty: Easy
5
+ *
6
+ * Solution Created by: Muhammad Khuzaima Umair
7
+ * LeetCode : https://leetcode.com/mkhuzaima/
8
+ * Github : https://github.com/mkhuzaima
9
+ * LinkedIn : https://www.linkedin.com/in/mkhuzaima/
10
+ */
11
12
class Solution {
13
public int maxProduct(int[] nums) {
0 commit comments