414. Third Maximum Number

Author: Tushar Borole

.idea/workspace.xml

@@ -52,6 +52,7 @@
 | 783  | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)                           | [minimum_distance_between_bst_nodes.js](minimum_distance_between_bst_nodes.js)                                | 88 ms            | 34.7 MB              | Easy       |
 | 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [partition_array_into_three_parts.js](partition_array_into_three_parts.js)                                    | 72 ms            | 39.6 MB              | Easy       |
 | 912  | [Sort an Array](https://leetcode.com/problems/sort-an-array/)                                                                     | [Solution](sort_an_array.js)                                                                                  | 7176 ms          | 38.9 MB              | Medium     |
+| 414  | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)                                                       | [third_maximum_number.js](third_maximum_number.js)                                                            | 76 ms            | 38 MB                | Easy       |
 | 701  | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)                               | [Solution](insert_into_a_binary_search_tree.js)                                                               | 112 ms           | 41.9 MB              | Medium     |
 | 94   | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                     | [Solution](binary_tree_inorder_traversal.js)                                                                  | 56 ms            | 33.7 MB              | Medium     |
 | 1015 | [Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/)                                 | [Solution](smallest_integer_divisible.js)                                                                     | 52 ms            | 34.3 MB              | Medium     |

README.md

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var thirdMax = function(nums) {
+  nums.sort((a, b) => b - a);
+  nums = [...new Set(nums)];
+
+  if (nums.length < 3) {
+    return nums[0];
+  }
+  return nums[2];
+};
+
+thirdMax([1, 2, 3]); //?