Update solutions

patricktcoakley · patricktcoakley · commit 45408505c1a9 · 2023-01-29T12:37:26.000-05:00
diff --git a/analysis_options.yaml b/analysis_options.yaml
@@ -15,10 +15,9 @@ include: package:lints/recommended.yaml
 
 # Uncomment the following section to specify additional rules.
 
-# linter:
-#   rules:
-#     - camel_case_types
-
+linter:
+  rules:
+    - prefer_single_quotes
 # analyzer:
 #   exclude:
 #     - path/to/excluded/files/**
diff --git a/lib/leetcode.dart b/lib/leetcode.dart
@@ -13,6 +13,7 @@ export 'matrix/rotate.dart';
 export 'stack/is_valid.dart';
 export 'string/is_anagram.dart';
 export 'string/is_palindrome.dart';
+export 'string/length_of_longest_substring.dart';
 export 'string/letter_combinations.dart';
 export 'tree/invert_tree.dart';
 export 'tree/is_same_tree.dart';
diff --git a/lib/list/merge_two_lists.dart b/lib/list/merge_two_lists.dart
@@ -0,0 +1,21 @@
+import 'list_node.dart';
+
+ListNode? mergeTwoLists(ListNode? list1, ListNode? list2) {
+  if (list1 == null && list2 == null) {
+    return null;
+  }
+
+  if (list1 == null) {
+    return list2;
+  }
+
+  if (list2 == null) {
+    return list1;
+  }
+
+  if (list1.val < list2.val) {
+    return ListNode(list1.val, mergeTwoLists(list1.next, list2));
+  }
+
+  return ListNode(list2.val, mergeTwoLists(list1, list2.next));
+}
diff --git a/lib/matrix/search_matrix.dart b/lib/matrix/search_matrix.dart
@@ -0,0 +1,18 @@
+bool searchMatrix(List<List<int>> matrix, int target) {
+  var m = matrix.length;
+  var n = matrix[0].length;
+  var row = m - 1;
+  var col = 0;
+
+  while (row >= 0 && row < m && col >= 0 && col < n) {
+    if (matrix[row][col] > target) {
+      row -= 1;
+    } else if (matrix[row][col] < target) {
+      col += 1;
+    } else {
+      return true;
+    }
+  }
+
+  return false;
+}
diff --git a/lib/string/length_of_longest_substring.dart b/lib/string/length_of_longest_substring.dart
@@ -0,0 +1,18 @@
+import 'dart:math';
+
+int lengthOfLongestSubstring(String s) {
+  var map = <String, int>{};
+  var longest = 0;
+  var left = 0;
+  for (var right = 0; right < s.length; right++) {
+    var c = s[right];
+    if (map.containsKey(c)) {
+      left = max(left, map[c]!);
+    }
+
+    longest = max(longest, right - left + 1);
+    map[c] = right + 1;
+  }
+
+  return longest;
+}
diff --git a/lib/string/letter_combinations.dart b/lib/string/letter_combinations.dart
@@ -1,5 +1,3 @@
-import 'dart:collection';
-
 List<String> letterCombinations(String digits) {
   const chars = {
     '1': '',
diff --git a/lib/tree/kth_smallest.dart b/lib/tree/kth_smallest.dart
@@ -4,8 +4,8 @@ int kthSmallest(TreeNode? root, int k) {
   var s = <TreeNode?>[];
   TreeNode? curr = root;
 
-  while(true) {
-    while(curr != null) {
+  while (true) {
+    while (curr != null) {
       s.add(curr);
       curr = curr.left;
     }
diff --git a/test/list/merge_two_lists_test.dart b/test/list/merge_two_lists_test.dart
@@ -0,0 +1,27 @@
+import 'package:leetcode/leetcode.dart';
+import 'package:leetcode/list/merge_two_lists.dart';
+import 'package:test/test.dart';
+
+void main() {
+  test('example 1', () {
+    var list1 = ListNode.fromList([1, 2, 4]);
+    var list2 = ListNode.fromList([1, 3, 4]);
+    var expected = ListNode.fromList([1, 1, 2, 3, 4, 4]);
+    var result = mergeTwoLists(list1, list2);
+    expect(mergeTwoLists(list1, list2), equals(expected));
+  });
+
+  test('example 2', () {
+    var list1 = ListNode.fromList([]);
+    var list2 = ListNode.fromList([]);
+    var expected = ListNode.fromList([]);
+    expect(mergeTwoLists(list1, list2), equals(expected));
+  });
+
+  test('example 3', () {
+    var list1 = ListNode.fromList([]);
+    var list2 = ListNode.fromList([0]);
+    var expected = ListNode.fromList([0]);
+    expect(mergeTwoLists(list1, list2), equals(expected));
+  });
+}
diff --git a/test/matrix/search_matrix_test.dart b/test/matrix/search_matrix_test.dart
@@ -0,0 +1,26 @@
+import 'package:leetcode/matrix/search_matrix.dart';
+import 'package:test/test.dart';
+
+void main() {
+  test('example 1', () {
+    var matrix = [
+      [1, 3, 5, 7],
+      [10, 11, 16, 20],
+      [23, 30, 34, 60]
+    ];
+    var target = 3;
+    var expected = true;
+    expect(searchMatrix(matrix, target), equals(expected));
+  });
+
+  test('example 1', () {
+    var matrix = [
+      [1, 3, 5, 7],
+      [10, 11, 16, 20],
+      [23, 30, 34, 60]
+    ];
+    var target = 13;
+    var expected = false;
+    expect(searchMatrix(matrix, target), equals(expected));
+  });
+}
diff --git a/test/string/is_anagram_test.dart b/test/string/is_anagram_test.dart
@@ -9,7 +9,7 @@ void main() {
     expect(isAnagram(s, t), equals(expected));
   });
 
-    test('example 2', () {
+  test('example 2', () {
     var s = 'rat';
     var t = 'car';
     var expected = false;
diff --git a/test/string/length_of_longest_substring_test.dart b/test/string/length_of_longest_substring_test.dart
@@ -0,0 +1,22 @@
+import 'package:leetcode/leetcode.dart';
+import 'package:test/test.dart';
+
+void main() {
+  test('example 1', () {
+    var s = 'abcabcbb';
+    var expected = 3;
+    expect(lengthOfLongestSubstring(s), equals(expected));
+  });
+
+  test('example 2', () {
+    var s = 'bbbbb';
+    var expected = 1;
+    expect(lengthOfLongestSubstring(s), equals(expected));
+  });
+
+  test('example 3', () {
+    var s = 'pwwkew';
+    var expected = 3;
+    expect(lengthOfLongestSubstring(s), equals(expected));
+  });
+}
diff --git a/test/tree/is_valid_bst_test.dart b/test/tree/is_valid_bst_test.dart
@@ -3,13 +3,13 @@ import 'package:test/test.dart';
 
 void main() {
   test('example 1', () {
-    var input = TreeNode.fromList([2,1,3]);
+    var input = TreeNode.fromList([2, 1, 3]);
     var expected = true;
     expect(isValidBST(input), equals(expected));
   });
 
   test('example 2', () {
-    var input = TreeNode.fromList([5,1,4,null,null,3,6]);
+    var input = TreeNode.fromList([5, 1, 4, null, null, 3, 6]);
     var expected = false;
     expect(isValidBST(input), equals(expected));
   });
diff --git a/test/tree/kth_smallest_test.dart b/test/tree/kth_smallest_test.dart
@@ -4,15 +4,14 @@ import 'package:test/test.dart';
 
 void main() {
   test('example 1', () {
-    var input = TreeNode.fromList([3,1,4,null,2]);
+    var input = TreeNode.fromList([3, 1, 4, null, 2]);
     var expected = 1;
     expect(kthSmallest(input, 1), equals(expected));
   });
 
   test('example 2', () {
-    var input = TreeNode.fromList([5,3,6,2,4,null,null,1]);
+    var input = TreeNode.fromList([5, 3, 6, 2, 4, null, null, 1]);
     var expected = 3;
     expect(kthSmallest(input, 3), equals(expected));
   });
-
 }
diff --git a/test/tree/level_order_test.dart b/test/tree/level_order_test.dart
@@ -4,14 +4,19 @@ import 'package:test/test.dart';
 void main() {
   test('example 1', () {
     var input = TreeNode.fromList([3, 9, 20, null, null, 15, 7]);
-    var expected = [[3], [9, 20], [15, 7]
+    var expected = [
+      [3],
+      [9, 20],
+      [15, 7]
     ];
     expect(levelOrder(input), equals(expected));
   });
 
   test('example 2', () {
     var input = TreeNode.fromList([1]);
-    var expected = [[1]];
+    var expected = [
+      [1]
+    ];
     expect(levelOrder(input), equals(expected));
   });
 

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-import 'dart:collection';`
`2`		`-`
`3`	`1`	`List<String> letterCombinations(String digits) {`
`4`	`2`	`const chars = {`
`5`	`3`	`'1': '',`