diff --git a/cpp/205-Isomorphic-Strings.cpp b/cpp/205-Isomorphic-Strings.cpp deleted file mode 100644 index d908acee1..000000000 --- a/cpp/205-Isomorphic-Strings.cpp +++ /dev/null @@ -1,20 +0,0 @@ -class Solution { -public: - bool isIsomorphic(string s, string t) { - unordered_map STMap, TSMap; - - for(size_t i = 0; i < s.size(); i++) - { - // (STMap[s[i]] != 0) ===> If the char is not in the map - if((STMap[s[i]] != 0 && STMap[s[i]] != t[i]) || (TSMap[t[i]] != 0 && TSMap[t[i]] != s[i])) - { - return false; - } - - STMap[s[i]] = t[i]; - TSMap[t[i]] = s[i]; - } - - return true; - } -}; diff --git a/csharp/315-Count-of-Smaller-Numbers-After-Self.cs b/csharp/0315-count-of-smaller-numbers-after-self.cs similarity index 100% rename from csharp/315-Count-of-Smaller-Numbers-After-Self.cs rename to csharp/0315-count-of-smaller-numbers-after-self.cs diff --git a/csharp/876-Middle-Of-The-Linked-List.cs b/csharp/0876-middle-of-the-linked-list.cs similarity index 100% rename from csharp/876-Middle-Of-The-Linked-List.cs rename to csharp/0876-middle-of-the-linked-list.cs diff --git a/csharp/70-Climbing-Stairs.cs b/csharp/70-Climbing-Stairs.cs deleted file mode 100644 index 7e34fecb8..000000000 --- a/csharp/70-Climbing-Stairs.cs +++ /dev/null @@ -1,12 +0,0 @@ -public class Solution { - public int ClimbStairs(int n) { - if(n <= 3) return n; - int one = 2, two = 3; - - for(var i = 2; i < n - 1; i++) { - (one, two) = (two, one + two); - } - - return two; - } -} \ No newline at end of file diff --git a/javascript/876-Middle-Of-The-Linked-List.js b/javascript/0876-middle-of-the-linked-list.js similarity index 100% rename from javascript/876-Middle-Of-The-Linked-List.js rename to javascript/0876-middle-of-the-linked-list.js diff --git a/javascript/937-K-Closest-Points-To-Origin.js b/javascript/0937-k-closest-points-to-origin.js similarity index 100% rename from javascript/937-K-Closest-Points-To-Origin.js rename to javascript/0937-k-closest-points-to-origin.js diff --git a/javascript/207-canFinish.js b/javascript/207-canFinish.js deleted file mode 100644 index 6f6b8ab38..000000000 --- a/javascript/207-canFinish.js +++ /dev/null @@ -1,38 +0,0 @@ -function createGraph(numCourses, edges) { - const graph = Array.from({ length: numCourses }, () => []); - - for (let edge of edges) { - let [a, b] = edge; - - if (!(a in graph)) graph[a] = []; - if (!(b in graph)) graph[b] = []; - - graph[a].push(b); - } - return graph; -} - -function canFinish(numCourses, preq) { - const graph = createGraph(numCourses, preq); - let seen = new Set(); - let seeing = new Set(); - - function explore(course) { - if (seen.has(course)) return true; - if (seeing.has(course)) return false; - - seeing.add(course); - for (let neighbor of graph[course]) { - if (!explore(neighbor)) return false; - } - - seen.add(course); - seeing.delete(course); - return true; - } - - for (let i = 0; i < numCourses; i++) { - if (!explore(i)) return false; - } - return true; -} diff --git a/javascript/49-Rotate-Image.js b/javascript/49-Rotate-Image.js deleted file mode 100644 index 7b5fe174a..000000000 --- a/javascript/49-Rotate-Image.js +++ /dev/null @@ -1,30 +0,0 @@ -/** - * @param {number[][]} matrix - * @return {void} Do not return anything, modify matrix in-place instead. - */ -var rotate = function (matrix) { - transpose(matrix); - reflect(matrix); -}; - -var transpose = function (matrix) { - let n = matrix.length; - for (let i = 0; i < n; i++) { - for (let j = i + 1; j < n; j++) { - let temp = matrix[j][i]; - matrix[j][i] = matrix[i][j]; - matrix[i][j] = temp; - } - } -}; - -var reflect = function (matrix) { - let n = matrix.length; - for (let i = 0; i < n; i++) { - for (let j = 0; j < n / 2; j++) { - let temp = matrix[i][j]; - matrix[i][j] = matrix[i][n - j - 1]; - matrix[i][n - j - 1] = temp; - } - } -}; diff --git a/python/119-Pascal-Triangle-II.py b/python/0119-Pascal-Triangle-II.py similarity index 100% rename from python/119-Pascal-Triangle-II.py rename to python/0119-Pascal-Triangle-II.py diff --git a/python/509-Fibonacci-Number.py b/python/0509-Fibonacci-Number.py similarity index 100% rename from python/509-Fibonacci-Number.py rename to python/0509-Fibonacci-Number.py diff --git a/python/118-Pascals-Triangle.py b/python/118-Pascals-Triangle.py deleted file mode 100644 index cb256c330..000000000 --- a/python/118-Pascals-Triangle.py +++ /dev/null @@ -1,10 +0,0 @@ -class Solution: - def generate(self, numRows: int) -> List[List[int]]: - triangle = [] - for row_num in range(numRows): - row = [None for _ in range(row_num + 1)] - row[0], row[-1] = 1, 1 - for j in range(1, row_num): - row[j] = triangle[row_num - 1][j-1] + triangle[row_num - 1][j] - triangle.append(row) - return triangle diff --git a/python/236-Lowest-Common-Ancestor-of-a-Binary-Tree.py b/python/236-Lowest-Common-Ancestor-of-a-Binary-Tree.py deleted file mode 100644 index 06131f4f6..000000000 --- a/python/236-Lowest-Common-Ancestor-of-a-Binary-Tree.py +++ /dev/null @@ -1,35 +0,0 @@ -# Definition for a binary tree node. -# class TreeNode: -# def __init__(self, x): -# self.val = x -# self.left = None -# self.right = None - - -class Solution: - res = None - - def lowestCommonAncestor( - self, root: "TreeNode", p: "TreeNode", q: "TreeNode" - ) -> "TreeNode": - if not root or not p or not q: - return None - - def search(root, p, q): - if not root: - return False - mid = left = right = False - if root.val == p.val or root.val == q.val: - mid = True - - left = search(root.left, p, q) - right = search(root.right, p, q) - if mid: - if left or right: - self.res = root - elif left and right: - self.res = root - return mid or left or right - - search(root, p, q) - return self.res diff --git a/python/40-Combinations-Sum-ii.py b/python/40-Combinations-Sum-ii.py deleted file mode 100644 index 6c7708fd1..000000000 --- a/python/40-Combinations-Sum-ii.py +++ /dev/null @@ -1,23 +0,0 @@ -class Solution: - def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]: - candidates.sort() - - res = [] - - def backtrack(cur, pos, target): - if target == 0: - res.append(cur.copy()) - if target <= 0: - return - - prev = -1 - for i in range(pos, len(candidates)): - if candidates[i] == prev: - continue - cur.append(candidates[i]) - backtrack(cur, i + 1, target - candidates[i]) - cur.pop() - prev = candidates[i] - - backtrack([], 0, target) - return res diff --git a/typescript/242-Valid-Anagrams.ts b/typescript/242-Valid-Anagrams.ts deleted file mode 100644 index 506812c10..000000000 --- a/typescript/242-Valid-Anagrams.ts +++ /dev/null @@ -1,16 +0,0 @@ -function isAnagram(s: string, t: string): boolean { - if (s.length !== t.length) return false; - - const store = new Array(26).fill(0); - - for (let i = 0; i < s.length; i++) { - store[s.charCodeAt(i) - 'a'.charCodeAt(0)]++; - store[t.charCodeAt(i) - 'a'.charCodeAt(0)]--; - } - - for (let i = 0; i < store.length; i++) { - if (store[i] !== 0) return false; - } - - return true; -}