feat: Two Sum

Author: maddhruv

README.md

@@ -1,2 +1,9 @@
-# leetcode-blind-75-javascript
+# LeetCode Blind 75 Problems in JavaScript
+
 Solutions of LeetCode Blind 75 Problems in JavaScript
+
+:goal_net: [Curated List of Top 75 LeetCode Questions](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)
+
+| Problem                 | Difficulty                                             | Tags                  | LeetCode                                         |
+| ----------------------- | ------------------------------------------------------ | --------------------- | ------------------------------------------------ |
+| [Two Sum](./two-sum.js) | <img src="https://img.shields.io/badge/-Easy-green" /> | `Array`, `Hash Table` | [:link:](https://leetcode.com/problems/two-sum/) |

two-sum.js

@@ -0,0 +1,13 @@
+const twoSum = (nums, target) => {
+  const indexMap = {};
+
+  for (let i = 0; i < nums.length; i++) {
+    const num = nums[i];
+    const consolidated = target - num;
+
+    if (consolidated in indexMap) {
+      return [indexMap[consolidated], i];
+    }
+    indexMap[num] = i;
+  }
+};