The original Leetcode datastructures have been turned into custom case class-based ADTs to support easier pattern matching in the recursive calls. The ADTs can be found in the common module.
EASY:
- 35. Search Insert Position (Day 1),
- 58. Length of Last Word (Day 1),
- 83. Remove Duplicates from Sorted List (Day 1),
- 88. Merge Sorted Array (Day 1),
- 94. Binary Tree Inorder Traversal (Day 1),
- 100. Same Tree (Day 1),
- 101. Symmetric Tree (Day 2),
- 121. Best Time to Buy and Sell Stock (Day 4),
- 104. Maximum Depth of Binary Tree (Day 3),
- 961. N-Repeated Element in Size 2N Array (Day 1)
MEDIUM:
- 49. Group Anagrams (Day 4),
- 98. Validate Binary Search Tree (Day 3),
- 114. Flatten Binary Tree to Linked List (Day 3),
HARD: