Merge pull request #1322 from doitduri/main

[doitduri] WEEK 03 solutions

Author: doitduri

combination-sum/doitduri.swift

@@ -0,0 +1,31 @@
+class Solution {
+    func combinationSum(_ candidates: [Int], _ target: Int) -> [[Int]] {
+        if candidates.filter { $0 > target }.count == candidates.count {
+            return []
+        }
+        
+        var result: [[Int]] = []
+        var current: [Int] = []
+        
+        func backtrack(_ start: Int, _ remain: Int) {
+            if remain == 0 {
+                result.append(current)
+                return
+            }
+            
+            if remain < 0 {
+                return
+            }
+            
+            for i in start..<candidates.count {
+                current.append(candidates[i])
+                backtrack(i, remain - candidates[i])
+                current.removeLast()
+            }
+        }
+        
+        backtrack(0, target)
+        
+        return result
+    }
+}

decode-ways/doitduri.swift

@@ -0,0 +1,31 @@
+class Solution {
+    func numDecodings(_ s: String) -> Int {
+         if s.first == "0" {
+            return 0
+        }
+
+        if s.count == 1 {
+            return 1
+        }
+
+        var tables = Array(repeating: 0, count: s.count+1)
+        let chars = Array(s)
+        tables[0] = 1
+        tables[1] = 1
+        
+        for i in 2...s.count {
+            if chars[i-1] != "0" {
+                tables[i] += tables[i-1]
+            }
+
+            if let twoDigit = Int(String(chars[i-2...i-1])) {
+                if 10 <= twoDigit && twoDigit <= 26 {
+                    tables[i] += tables[i-2]
+                }
+            }
+            
+        }
+        
+        return tables[s.count]
+    }
+}

maximum-subarray/doitduri.swift

@@ -0,0 +1,12 @@
+class Solution {
+    func maxSubArray(_ nums: [Int]) -> Int {
+        var currentSum = nums[0]
+        var maxSum = nums[0]
+        
+        for i in 1..<nums.count {
+            currentSum = max(nums[i], currentSum + nums[i])
+            maxSum = max(maxSum, currentSum)
+        }
+        return maxSum
+    }
+}

number-of-1-bits/doitduri.swift

@@ -0,0 +1,6 @@
+class Solution {
+    func hammingWeight(_ n: Int) -> Int {
+        let bitString = String(n, radix: 2)
+        return bitString.filter { $0 == "1" }.count
+    }
+}

valid-palindrome/doitduri.swift

@@ -0,0 +1,6 @@
+class Solution {
+    func isPalindrome(_ s: String) -> Bool {
+        let strings = s.filter { $0.isLetter || $0.isNumber }.lowercased()
+        return String(strings.reversed()) == strings
+    }
+}