update readme

Author: hogan-tech

.github/Question List.txt

@@ -12,4 +12,5 @@
 0938-range-sum-of-bst python easy
 1428-leftmost-column-with-at-least-a-one python medium
 0872-leaf-similar-trees python easy
-2385-amount-of-time-for-binary-tree-to-be-infected python medium
+2385-amount-of-time-for-binary-tree-to-be-infected python medium
+1026-maximum-difference-between-node-and-ancestor python medium

README.md

@@ -253,6 +253,7 @@ The solutions are organized as follows:
 | 0977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)                                                                               | [C++](./0977-squares-of-a-sorted-array/0977-squares-of-a-sorted-array.cpp)                                                                                                                                                                   | [Easy](./0977-squares-of-a-sorted-array/README.md)                                        |
 | 0981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)                                                                             | [Python](./0981-time-based-key-value-store/0981-time-based-key-value-store.py)                                                                                                                                                               | [Medium](./0981-time-based-key-value-store/README.md)                                     |
 | 0994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)                                                                                                   | [Python](./0994-rotting-oranges/0994-rotting-oranges.py), [C++](./0994-rotting-oranges/0994-rotting-oranges.cpp)                                                                                                                             | [Medium](./0994-rotting-oranges/README.md)                                                |
+| 1026 | [Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)                                         | [Python](./1026-maximum-difference-between-node-and-ancestor/1026-maximum-difference-between-node-and-ancestor.py)                                                                                                                           | [Medium](./1026-maximum-difference-between-node-and-ancestor/README.md)                   |
 | 1048 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain/)                                                                                         | [Python](./1048-longest-string-chain/1048-longest-string-chain.py)                                                                                                                                                                           | [Medium](./1048-longest-string-chain/README.md)                                           |
 | 1057 | [Campus Bikes](https://leetcode.com/problems/campus-bikes/)                                                                                                         | [Python](./1057-campus-bikes/1057-campus-bikes.py)                                                                                                                                                                                           | [Medium](./1057-campus-bikes/README.md)                                                   |
 | 1060 | [Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array/)                                                                   | [Python](./1060-missing-element-in-sorted-array/1060-missing-element-in-sorted-array.py)                                                                                                                                                     | [Medium](./1060-missing-element-in-sorted-array/README.md)                                |