From 59813bed8338ba6834c491ae91c6cae968cb2225 Mon Sep 17 00:00:00 2001
From: devenperez <63876261+devenperez@users.noreply.github.com>
Date: Mon, 11 Jul 2022 23:35:32 -0400
Subject: [PATCH] Removed "Two Sum" for testing purposes

---
 1-two-sum/1-two-sum.js | 14 --------------
 1-two-sum/1-two-sum.py | 11 -----------
 1-two-sum/NOTES.md     |  1 -
 1-two-sum/README.md    | 38 --------------------------------------
 4 files changed, 64 deletions(-)
 delete mode 100644 1-two-sum/1-two-sum.js
 delete mode 100644 1-two-sum/1-two-sum.py
 delete mode 100644 1-two-sum/NOTES.md
 delete mode 100644 1-two-sum/README.md

diff --git a/1-two-sum/1-two-sum.js b/1-two-sum/1-two-sum.js
deleted file mode 100644
index 56e2ac7..0000000
--- a/1-two-sum/1-two-sum.js
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * @param {number[]} nums
- * @param {number} target
- * @return {number[]}
- */
-var twoSum = function(nums, target) {
-    for(let i = 0; i < nums.length; i++) {
-        for(let j = i + 1; j < nums.length; j++) {
-            if(nums[i] + nums[j] == target) {
-                return [i, j];
-            }
-        }   
-    }
-};
\ No newline at end of file
diff --git a/1-two-sum/1-two-sum.py b/1-two-sum/1-two-sum.py
deleted file mode 100644
index 3e543b6..0000000
--- a/1-two-sum/1-two-sum.py
+++ /dev/null
@@ -1,11 +0,0 @@
-class Solution(object):
-    def twoSum(self, nums, target):
-        """
-        :type nums: List[int]
-        :type target: int
-        :rtype: List[int]
-        """
-        for i in range(len(nums)):
-            for j in range(i + 1, len(nums)):
-                if nums[i] + nums[j] == target:
-                    return [i, j]
\ No newline at end of file
diff --git a/1-two-sum/NOTES.md b/1-two-sum/NOTES.md
deleted file mode 100644
index 38c1374..0000000
--- a/1-two-sum/NOTES.md
+++ /dev/null
@@ -1 +0,0 @@
-​
\ No newline at end of file
diff --git a/1-two-sum/README.md b/1-two-sum/README.md
deleted file mode 100644
index 2776ef3..0000000
--- a/1-two-sum/README.md
+++ /dev/null
@@ -1,38 +0,0 @@
-<h2><a href="https://leetcode.com/problems/two-sum/">1. Two Sum</a></h2><h3>Easy</h3><hr><div><p>Given an array of integers <code>nums</code>&nbsp;and an integer <code>target</code>, return <em>indices of the two numbers such that they add up to <code>target</code></em>.</p>
-
-<p>You may assume that each input would have <strong><em>exactly</em> one solution</strong>, and you may not use the <em>same</em> element twice.</p>
-
-<p>You can return the answer in any order.</p>
-
-<p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
-
-<pre><strong>Input:</strong> nums = [2,7,11,15], target = 9
-<strong>Output:</strong> [0,1]
-<strong>Explanation:</strong> Because nums[0] + nums[1] == 9, we return [0, 1].
-</pre>
-
-<p><strong>Example 2:</strong></p>
-
-<pre><strong>Input:</strong> nums = [3,2,4], target = 6
-<strong>Output:</strong> [1,2]
-</pre>
-
-<p><strong>Example 3:</strong></p>
-
-<pre><strong>Input:</strong> nums = [3,3], target = 6
-<strong>Output:</strong> [0,1]
-</pre>
-
-<p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
-
-<ul>
-	<li><code>2 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
-	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
-	<li><code>-10<sup>9</sup> &lt;= target &lt;= 10<sup>9</sup></code></li>
-	<li><strong>Only one valid answer exists.</strong></li>
-</ul>
-
-<p>&nbsp;</p>
-<strong>Follow-up:&nbsp;</strong>Can you come up with an algorithm that is less than&nbsp;<code>O(n<sup>2</sup>)&nbsp;</code>time complexity?</div>
\ No newline at end of file