1428_Leftmost_Column_with_at_Least_a_One

Author: Partho Biswas

README.md

@@ -196,6 +196,7 @@ I have solved quite a number of problems from several topics. See the below tabl
 |82| **[766. Toeplitz Matrix](https://tinyurl.com/s3z4lem)** | [Python](https://tinyurl.com/wu6rdaw/766_Toeplitz_Matrix.py), [Swift](https://tinyurl.com/wuja3c4/766_Toeplitz_Matrix.swift) | --- | Easy | --- |
 |83| **[1031. Maximum Sum of Two Non-Overlapping Subarrays](https://tinyurl.com/y3x46a5t)** | [Python](https://tinyurl.com/wu6rdaw/1031_Maximum_Sum_of_Two_Non_Overlapping_Subarrays.py), [Swift](https://tinyurl.com/wuja3c4/1031_Maximum_Sum_of_Two_Non_Overlapping_Subarrays.swift) | --- | Medium | PrefixSum |
 |84| **[1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://tinyurl.com/yysmvobr)** | [Python](https://tinyurl.com/wu6rdaw/1438_Longest_Continuous_Subarray_With_Absolute_Diff_Less_Than_or_Equal_to_Limit.py), [Swift](https://tinyurl.com/wuja3c4/1438_Longest_Continuous_Subarray_With_Absolute_Diff_Less_Than_or_Equal_to_Limit.swift) | (Art 1)[https://tinyurl.com/y69hjhjp], (Art 2)[https://tinyurl.com/y3h2fj2m] | Medium | Sliding window |
+|85| **[1428. Leftmost Column with at Least a One](https://tinyurl.com/y3reu3y2)** | [Python](https://tinyurl.com/wu6rdaw/1428_Leftmost_Column_with_at_Least_a_One.py), [Swift](https://tinyurl.com/wuja3c4/1428_Leftmost_Column_with_at_Least_a_One.swift) | --- | Medium | Binary Search |
 
 
 </p>

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/1428_Leftmost_Column_with_at_Least_a_One.swift

@@ -0,0 +1,28 @@
+/**
+ * // This is the BinaryMatrix's API interface.
+ * // You should not implement it, or speculate about its implementation
+ * public class BinaryMatrix {
+ *     public func get(_ row: Int, _ col: Int) -> Int {}
+ *     public func dimensions() -> [Int] {}
+ * };
+ */
+
+class Solution {
+    func leftMostColumnWithOne(_ binaryMatrix: BinaryMatrix) -> Int {
+        let (rows, cols) = (binaryMatrix.dimensions()[0], binaryMatrix.dimensions()[1])
+        var leftMostCol = Int.max
+        for row in 0..<rows {
+            var (leftCol, rightCol) = (0, cols - 1)
+            while leftCol <= rightCol {
+                let midCol: Int = leftCol + (rightCol - leftCol) / 2
+                if binaryMatrix.get(row, midCol) == 1 {
+                    leftMostCol = min(leftMostCol, midCol)
+                    rightCol = midCol - 1
+                } else {
+                    leftCol = midCol + 1
+                }
+            }
+        }
+        return leftMostCol == Int.max ? -1 : leftMostCol
+    }
+}

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/621_Task_Scheduler.swift

@@ -0,0 +1,2 @@
+import Foundation
+