Updated markdown files

Author: Zanger67/leetcode

README.md

@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (682 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (683 solved)
 
 <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
 
@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 
 ------
 
-[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Math](<markdowns/by_topic/Math.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Design](<markdowns/by_topic/Design.md>), [Counting](<markdowns/by_topic/Counting.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
+[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Math](<markdowns/by_topic/Math.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Design](<markdowns/by_topic/Design.md>), [Counting](<markdowns/by_topic/Counting.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Database](<markdowns/by_topic/Database.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
 
 ------
 
@@ -380,6 +380,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 1203 | [Sort Items by Groups Respecting Dependencies](<https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies>)                                                               | Hard    |                           | [solution](<markdowns/_1203. Sort Items by Groups Respecting Dependencies.md>)                                | py                                          |
 | 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>)                                                                                               | Easy    |                           | [solution](<markdowns/_1207. Unique Number of Occurrences.md>)                                                | py                                          |
 | 1209 | [Remove All Adjacent Duplicates in String II](<https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii>)                                                                 | Medium  |                           | [solution](<markdowns/_1209. Remove All Adjacent Duplicates in String II.md>)                                 | py                                          |
+| 1214 | [Two Sum BSTs](<https://leetcode.com/problems/two-sum-bsts>)                                                                                                                               | Medium  | Weekly Premium            | [solution](<markdowns/_1214. Two Sum BSTs.md>)                                                                | py                                          |
 | 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>)                                                   | Medium  |                           | [solution](<markdowns/_1218. Longest Arithmetic Subsequence of Given Difference.md>)                          | py                                          |
 | 1229 | [Meeting Scheduler](<https://leetcode.com/problems/meeting-scheduler>)                                                                                                                     | Medium  | Weekly Premium            | [solution](<markdowns/_1229. Meeting Scheduler.md>)                                                           | py                                          |
 | 1230 | [Toss Strange Coins](<https://leetcode.com/problems/toss-strange-coins>)                                                                                                                   | Medium  | Weekly Premium            | [solution](<markdowns/_1230. Toss Strange Coins.md>)                                                          | c, java, py                                 |
@@ -559,7 +560,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](<https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph>)                                                 | Medium  | Daily                     | [solution](<markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>)                         | java, py                                    |
 | 2196 | [Create Binary Tree From Descriptions](<https://leetcode.com/problems/create-binary-tree-from-descriptions>)                                                                               | Medium  | Daily                     | [solution](<markdowns/_2196. Create Binary Tree From Descriptions.md>)                                        | py                                          |
 | 2206 | [Divide Array Into Equal Pairs](<https://leetcode.com/problems/divide-array-into-equal-pairs>)                                                                                             | Easy    | Daily                     | [solution](<markdowns/_2206. Divide Array Into Equal Pairs.md>)                                               | c, py                                       |
-| 2211 | [Count Collisions on a Road](<https://leetcode.com/problems/count-collisions-on-a-road>)                                                                                                   | Medium  |                           | [solution](<markdowns/_2211. Count Collisions on a Road.md>)                                                  | py                                          |
+| 2211 | [Count Collisions on a Road](<https://leetcode.com/problems/count-collisions-on-a-road>)                                                                                                   | Medium  | Daily                     | [solution](<markdowns/_2211. Count Collisions on a Road.md>)                                                  | py                                          |
 | 2221 | [Find Triangular Sum of an Array](<https://leetcode.com/problems/find-triangular-sum-of-an-array>)                                                                                         | Medium  | Daily                     | [solution](<markdowns/_2221. Find Triangular Sum of an Array.md>)                                             | c, java, py                                 |
 | 2225 | [Find Players With Zero or One Losses](<https://leetcode.com/problems/find-players-with-zero-or-one-losses>)                                                                               | Medium  |                           | [solution](<markdowns/_2225. Find Players With Zero or One Losses.md>)                                        | java                                        |
 | 2235 | [Add Two Integers](<https://leetcode.com/problems/add-two-integers>)                                                                                                                       | Easy    |                           | [solution](<markdowns/_2235. Add Two Integers.md>)                                                            | py                                          |