update readme

Author: hogan-tech

1214-two-sum-bsts/1214-two-sum-bsts.py

@@ -115,67 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [1590-make-sum-divisible-by-p](https://github.com/hogan-tech/leetcode-solution/tree/master/1590-make-sum-divisible-by-p) |
-| [2141-maximum-running-time-of-n-computers](https://github.com/hogan-tech/leetcode-solution/tree/master/2141-maximum-running-time-of-n-computers) |
-| [3623-count-number-of-trapezoids-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3623-count-number-of-trapezoids-i) |
-## Hash Table
-|  |
-| ------- |
-| [1590-make-sum-divisible-by-p](https://github.com/hogan-tech/leetcode-solution/tree/master/1590-make-sum-divisible-by-p) |
-| [3623-count-number-of-trapezoids-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3623-count-number-of-trapezoids-i) |
-## Prefix Sum
-|  |
-| ------- |
-| [1590-make-sum-divisible-by-p](https://github.com/hogan-tech/leetcode-solution/tree/master/1590-make-sum-divisible-by-p) |
-## Binary Search
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-| [2141-maximum-running-time-of-n-computers](https://github.com/hogan-tech/leetcode-solution/tree/master/2141-maximum-running-time-of-n-computers) |
-## Greedy
-|  |
-| ------- |
-| [2141-maximum-running-time-of-n-computers](https://github.com/hogan-tech/leetcode-solution/tree/master/2141-maximum-running-time-of-n-computers) |
-## Sorting
-|  |
-| ------- |
-| [2141-maximum-running-time-of-n-computers](https://github.com/hogan-tech/leetcode-solution/tree/master/2141-maximum-running-time-of-n-computers) |
-## Two Pointers
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Stack
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Tree
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Depth-First Search
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Binary Search Tree
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Binary Tree
-|  |
-| ------- |
-| [1214-two-sum-bsts](https://github.com/hogan-tech/leetcode-solution/tree/master/1214-two-sum-bsts) |
-## Math
-|  |
-| ------- |
-| [3623-count-number-of-trapezoids-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3623-count-number-of-trapezoids-i) |
-## Geometry
-|  |
-| ------- |
-| [3623-count-number-of-trapezoids-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3623-count-number-of-trapezoids-i) |
-<!---LeetCode Topics End-->

1214-two-sum-bsts/README.md

@@ -1,17 +1,18 @@
-<h2> 559 46
-1214. Two Sum BSTs</h2><hr><div><p>Given the roots of two binary search trees, <code>root1</code> and <code>root2</code>, return <code>true</code> if and only if there is a node in the first tree and a node in the second tree whose values sum up to a given integer <code>target</code>.</p>
+<h2><a href="https://leetcode.com/problems/two-sum-bsts">1150. Two Sum BSTs</a></h2><h3>Medium</h3><hr><p>Given the roots of two binary search trees, <code>root1</code> and <code>root2</code>, return <code>true</code> if and only if there is a node in the first tree and a node in the second tree whose values sum up to a given integer <code>target</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/10/ex1.png" style="width: 369px; height: 169px;">
-<pre><strong>Input:</strong> root1 = [2,1,4], root2 = [1,0,3], target = 5
+<img alt="" src="https://assets.leetcode.com/uploads/2021/02/10/ex1.png" style="width: 369px; height: 169px;" />
+<pre>
+<strong>Input:</strong> root1 = [2,1,4], root2 = [1,0,3], target = 5
 <strong>Output:</strong> true
 <strong>Explanation: </strong>2 and 3 sum up to 5.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/02/10/ex2.png" style="width: 453px; height: 290px;">
-<pre><strong>Input:</strong> root1 = [0,-10,10], root2 = [5,1,7,0,2], target = 18
+<img alt="" src="https://assets.leetcode.com/uploads/2021/02/10/ex2.png" style="width: 453px; height: 290px;" />
+<pre>
+<strong>Input:</strong> root1 = [0,-10,10], root2 = [5,1,7,0,2], target = 18
 <strong>Output:</strong> false
 </pre>
 
@@ -22,4 +23,3 @@
 	<li>The number of nodes in each tree is in the range <code>[1, 5000]</code>.</li>
 	<li><code>-10<sup>9</sup> &lt;= Node.val, target &lt;= 10<sup>9</sup></code></li>
 </ul>
-</div>