2023-02-09 update: added "83. Remove Duplicates from Sorted List"

Author: fartem

README.md

@@ -12,18 +12,19 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 
 ### Easy
 
-| Name                       | Link to LeetCode                                              | Link to solution                               |
-|----------------------------|---------------------------------------------------------------|------------------------------------------------|
-| 1. Two Sum                 | [Link](https://leetcode.com/problems/two-sum/)                | [Link](./lib/easy/two_sum.dart)                |
-| 9. Palindrome Number       | [Link](https://leetcode.com/problems/palindrome-number/)      | [Link](./lib/easy/palindrome_number.dart)      |
-| 13. Roman to Integer       | [Link](https://leetcode.com/problems/roman-to-integer/)       | [Link](./lib/easy/roman_to_integer.dart)       |
-| 14. Longest Common Prefix  | [Link](https://leetcode.com/problems/longest-common-prefix/)  | [Link](./lib/easy/longest_common_prefix.dart)  |
-| 20. Valid Parentheses      | [Link](https://leetcode.com/problems/valid-parentheses/)      | [Link](./lib/easy/valid_parentheses.dart)      |
-| 21. Merge Two Sorted Lists | [Link](https://leetcode.com/problems/merge-two-sorted-lists/) | [Link](./lib/easy/merge_two_sorted_lists.dart) |
-| 27. Remove Element         | [Link](https://leetcode.com/problems/remove-element/)         | [Link](./lib/easy/remove_element.dart)         |
-| 35. Search Insert Position | [Link](https://leetcode.com/problems/search-insert-position/) | [Link](./lib/easy/search_insert_position.dart) |
-| 58. Length of Last Word    | [Link](https://leetcode.com/problems/length-of-last-word/)    | [Link](./lib/easy/length_of_last_word.dart)    |
-| 66. Plus One               | [Link](https://leetcode.com/problems/plus-one/)               | [Link](./lib/easy/plus_one.dart)               |
-| 67. Add Binary             | [Link](https://leetcode.com/problems/add-binary/)             | [Link](./lib/easy/add_binary.dart)             |
-| 69. Sqrt(x)                | [Link](https://leetcode.com/problems/sqrtx/)                  | [Link](./lib/easy/sqrt_x.dart)                 |
-| 70. Climbing Stairs        | [Link](https://leetcode.com/problems/climbing-stairs/)        | [Link](./lib/easy/climbing_stairs.dart)        |
+| Name                                   | Link to LeetCode                                                          | Link to solution                                           |
+|----------------------------------------|---------------------------------------------------------------------------|------------------------------------------------------------|
+| 1. Two Sum                             | [Link](https://leetcode.com/problems/two-sum/)                            | [Link](./lib/easy/two_sum.dart)                            |
+| 9. Palindrome Number                   | [Link](https://leetcode.com/problems/palindrome-number/)                  | [Link](./lib/easy/palindrome_number.dart)                  |
+| 13. Roman to Integer                   | [Link](https://leetcode.com/problems/roman-to-integer/)                   | [Link](./lib/easy/roman_to_integer.dart)                   |
+| 14. Longest Common Prefix              | [Link](https://leetcode.com/problems/longest-common-prefix/)              | [Link](./lib/easy/longest_common_prefix.dart)              |
+| 20. Valid Parentheses                  | [Link](https://leetcode.com/problems/valid-parentheses/)                  | [Link](./lib/easy/valid_parentheses.dart)                  |
+| 21. Merge Two Sorted Lists             | [Link](https://leetcode.com/problems/merge-two-sorted-lists/)             | [Link](./lib/easy/merge_two_sorted_lists.dart)             |
+| 27. Remove Element                     | [Link](https://leetcode.com/problems/remove-element/)                     | [Link](./lib/easy/remove_element.dart)                     |
+| 35. Search Insert Position             | [Link](https://leetcode.com/problems/search-insert-position/)             | [Link](./lib/easy/search_insert_position.dart)             |
+| 58. Length of Last Word                | [Link](https://leetcode.com/problems/length-of-last-word/)                | [Link](./lib/easy/length_of_last_word.dart)                |
+| 66. Plus One                           | [Link](https://leetcode.com/problems/plus-one/)                           | [Link](./lib/easy/plus_one.dart)                           |
+| 67. Add Binary                         | [Link](https://leetcode.com/problems/add-binary/)                         | [Link](./lib/easy/add_binary.dart)                         |
+| 69. Sqrt(x)                            | [Link](https://leetcode.com/problems/sqrtx/)                              | [Link](./lib/easy/sqrt_x.dart)                             |
+| 70. Climbing Stairs                    | [Link](https://leetcode.com/problems/climbing-stairs/)                    | [Link](./lib/easy/climbing_stairs.dart)                    |
+| 83. Remove Duplicates from Sorted List | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Link](./lib/easy/remove_duplicates_from_sorted_list.dart) |

lib/easy/remove_duplicates_from_sorted_list.dart

@@ -0,0 +1,16 @@
+import '../common/list_node.dart';
+
+// https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+class Solution {
+  ListNode? deleteDuplicates(ListNode? head) {
+    var p = head;
+    while (p != null && p.next != null) {
+      if (p.val == p.next!.val) {
+        p.next = p.next!.next;
+      } else {
+        p = p.next;
+      }
+    }
+    return head;
+  }
+}

test/easy/remove_duplicates_from_sorted_list_test.dart

@@ -0,0 +1,45 @@
+import 'package:leetcode_dart/easy/remove_duplicates_from_sorted_list.dart';
+import 'package:test/test.dart';
+
+import '../common/linked_list_helper.dart';
+
+void main() {
+  group(
+    'Example tests',
+    () {
+      final rdfsl = Solution();
+      test(
+        '[1, 2]',
+        () => expect(
+          true,
+          LinkedListHelper.areEqual(
+            LinkedListHelper.fromList(
+              [1, 2],
+            ),
+            rdfsl.deleteDuplicates(
+              LinkedListHelper.fromList(
+                [1, 1, 2],
+              ),
+            ),
+          ),
+        ),
+      );
+      test(
+        '[1, 2, 3]',
+        () => expect(
+          true,
+          LinkedListHelper.areEqual(
+            LinkedListHelper.fromList(
+              [1, 2, 3],
+            ),
+            rdfsl.deleteDuplicates(
+              LinkedListHelper.fromList(
+                [1, 1, 2, 3, 3],
+              ),
+            ),
+          ),
+        ),
+      );
+    },
+  );
+}