Merge pull request #24 from fluttermiddlepodcast/944_Delete_Columns_to_Make_Sorted

added "944. Delete Columns to Make Sorted"

Author: fluttermiddlepodcast

README.md

@@ -4,22 +4,23 @@ Solutions from [LeetCode](https://leetcode.com) on Dart.
 
 ## Easy
 
-| Name | LeetCode | Solution |
-|-----------------------------------------|--------------------------------------------------------------------------------|-------------------------------------------------------------|
-| 9. Palindrome Number | [Link](https://leetcode.com/problems/palindrome-number/) | [Link](./lib/easy/palindrome_number.dart) |
-| 26. Remove Duplicates from Sorted Array | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Link](./lib/easy/remove_duplicates_from_sorted_array.dart) |
-| 136. Single Number | [Link](https://leetcode.com/problems/single-number/) | [Link](./lib/easy/single_number.dart) |
-| 144. Binary Tree Preorder Traversal | [Link](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Link](./lib/easy/binary_tree_preorder_traversal.dart) |
-| 169. Majority Element | [Link](https://leetcode.com/problems/majority-element/) | [Link](./lib/easy/majority_element.dart) |
-| 217. Contains Duplicate | [Link](https://leetcode.com/problems/contains-duplicate/) | [Link](./lib/easy/contains_duplicate.dart) |
-| 226. Invert Binary Tree | [Link](https://leetcode.com/problems/invert-binary-tree/) | [Link](./lib/easy/invert_binary_tree.dart) |
-| 342. Power of Four | [Link](https://leetcode.com/problems/power-of-four/) | [Link](./lib/easy/power_of_four.dart) |
-| 414. Third Maximum Number | [Link](https://leetcode.com/problems/third-maximum-number/) | [Link](./lib/easy/third_maximum_number.dart) |
-| 796. Rotate String | [Link](https://leetcode.com/problems/rotate-string/) | [Link](./lib/easy/rotate_string.dart) |
-| 2119. A Number After a Double Reversal | [Link](https://leetcode.com/problems/a-number-after-a-double-reversal/) | [Link](./lib/easy/third_maximum_number.dart) |
-| 2239. Find Closest Number to Zero | [Link](https://leetcode.com/problems/find-closest-number-to-zero/description/) | [Link](./lib/easy/find_closest_number_to_zero.dart) |
-| 2481. Minimum Cuts to Divide a Circle | [Link](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/) | [Link](./lib/easy/minimum_cuts_to_divide_a_circle.dart) |
-| 2490. Circular Sentence | [Link](https://leetcode.com/problems/circular-sentence/) | [Link](./lib/easy/circular_sentence.dart) |
+| Name | LeetCode | Solution |
+|-----------------------------------------|----------------------------------------------------------------------------|-------------------------------------------------------------|
+| 9. Palindrome Number | [Link](https://leetcode.com/problems/palindrome-number/) | [Link](./lib/easy/palindrome_number.dart) |
+| 26. Remove Duplicates from Sorted Array | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Link](./lib/easy/remove_duplicates_from_sorted_array.dart) |
+| 136. Single Number | [Link](https://leetcode.com/problems/single-number/) | [Link](./lib/easy/single_number.dart) |
+| 144. Binary Tree Preorder Traversal | [Link](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Link](./lib/easy/binary_tree_preorder_traversal.dart) |
+| 169. Majority Element | [Link](https://leetcode.com/problems/majority-element/) | [Link](./lib/easy/majority_element.dart) |
+| 217. Contains Duplicate | [Link](https://leetcode.com/problems/contains-duplicate/) | [Link](./lib/easy/contains_duplicate.dart) |
+| 226. Invert Binary Tree | [Link](https://leetcode.com/problems/invert-binary-tree/) | [Link](./lib/easy/invert_binary_tree.dart) |
+| 342. Power of Four | [Link](https://leetcode.com/problems/power-of-four/) | [Link](./lib/easy/power_of_four.dart) |
+| 414. Third Maximum Number | [Link](https://leetcode.com/problems/third-maximum-number/) | [Link](./lib/easy/third_maximum_number.dart) |
+| 796. Rotate String | [Link](https://leetcode.com/problems/rotate-string/) | [Link](./lib/easy/rotate_string.dart) |
+| 944. Delete Columns to Make Sorted | [Link](https://leetcode.com/problems/delete-columns-to-make-sorted/) | [Link](./lib/easy/delete_columns_to_make_sorted.dart) |
+| 2119. A Number After a Double Reversal | [Link](https://leetcode.com/problems/a-number-after-a-double-reversal/) | [Link](./lib/easy/third_maximum_number.dart) |
+| 2239. Find Closest Number to Zero | [Link](https://leetcode.com/problems/find-closest-number-to-zero/) | [Link](./lib/easy/find_closest_number_to_zero.dart) |
+| 2481. Minimum Cuts to Divide a Circle | [Link](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/) | [Link](./lib/easy/minimum_cuts_to_divide_a_circle.dart) |
+| 2490. Circular Sentence | [Link](https://leetcode.com/problems/circular-sentence/) | [Link](./lib/easy/circular_sentence.dart) |
 
 ## Medium
 

lib/easy/delete_columns_to_make_sorted.dart

@@ -0,0 +1,14 @@
+class Solution {
+int minDeletionSize(List<String> strs) {
+var result = 0;
+for (var i = 0; i < strs[0].length; i++) {
+for (var j = 1; j < strs.length; j++) {
+if (strs[j][i].compareTo(strs[j - 1][i]) < 0) {
+result++;
+break;
+}
+}
+}
+return result;
+}
+}

test/easy/delete_columns_to_make_sorted_test.dart

@@ -0,0 +1,14 @@
+import 'package:leetcode_dart/easy/delete_columns_to_make_sorted.dart';
+import 'package:test/test.dart';
+
+void main() {
+group(
+'Example tests',
+() {
+final dctms = Solution();
+test('1', () => expect(1, dctms.minDeletionSize(["cba", "daf", "ghi"])));
+test('0', () => expect(0, dctms.minDeletionSize(["a", "b"])));
+test('3', () => expect(3, dctms.minDeletionSize(["zyx", "wvu", "tsr"])));
+},
+);
+}