Removing old questions

Removed questions uploaded using an old version of LeetHub
Questions 2,3,4,19,36,141,206

3-longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.py

@@ -1,26 +0,0 @@
-class Solution(object):
-    def lengthOfLongestSubstring(self, s):
-        """
-        :type s: str
-        :rtype: int
-        """
-        letters = [x for x in s]
-        longestLength = 1
-        
-        if len(letters) == 0: return 0
-        
-        for i in range(len(letters)):
-            dictionary = {}
-            for j in range(i, len(letters)):
-                if dictionary.get(letters[j]) == None:
-                    dictionary[letters[j]] = 0
-                else:
-                    if j-i > longestLength:
-                        longestLength = j-i
-                    break
-                    
-                if j == len(letters) - 1:
-                    if j-i+1 > longestLength:
-                        longestLength = j-i+1
-                        return longestLength
-        return longestLength

3-longest-substring-without-repeating-characters/NOTES.md

@@ -1 +0,0 @@
-​

3-longest-substring-without-repeating-characters/README.md

@@ -1,33 +0,0 @@
-<h2><a href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">3. Longest Substring Without Repeating Characters</a></h2><h3>Medium</h3><hr><div><p>Given a string <code>s</code>, find the length of the <strong>longest substring</strong> without repeating characters.</p>
-
-<p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
-
-<pre><strong>Input:</strong> s = "abcabcbb"
-<strong>Output:</strong> 3
-<strong>Explanation:</strong> The answer is "abc", with the length of 3.
-</pre>
-
-<p><strong>Example 2:</strong></p>
-
-<pre><strong>Input:</strong> s = "bbbbb"
-<strong>Output:</strong> 1
-<strong>Explanation:</strong> The answer is "b", with the length of 1.
-</pre>
-
-<p><strong>Example 3:</strong></p>
-
-<pre><strong>Input:</strong> s = "pwwkew"
-<strong>Output:</strong> 3
-<strong>Explanation:</strong> The answer is "wke", with the length of 3.
-Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
-</pre>
-
-<p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
-
-<ul>
-	<li><code>0 &lt;= s.length &lt;= 5 * 10<sup>4</sup></code></li>
-	<li><code>s</code> consists of English letters, digits, symbols and spaces.</li>
-</ul>
-</div>