# Leetcode Solutions

## Introduction

Hi, I am a software engineer in Silicon Valley. I am sharing my knowledge with you here!

* [My github](https://github.com/gzc)
* [My Youtube Channel](https://www.youtube.com/channel/UCAvvkYnRNyObcHzOCaVgSrQ)
* [My Bilibili Homepage](https://space.bilibili.com/1551381295)

## Leetcode Questions

* [LeetCode 1. Two Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1-two-sum)
* [LeetCode 2. Add Two Numbers](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-2-add-two-numbers)
* [LeetCode 3. Longest Substring Without Repeating Characters](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-3-longest-substring-without-repeating-characters)
* [LeetCode 4. Median of Two Sorted Arrays](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-4-median-of-two-sorted-arrays)
* [LeetCode 5. Longest Palindromic Substring](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-5-longest-palindromic-substring)
* [LeetCode 6. ZigZag Conversion](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-6-zigzag-conversion)
* [LeetCode 7. Reverse Integer](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-7-reverse-integer)
* [LeetCode 8. String to Integer (atoi)](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-8-string-to-integer-atoi)
* [LeetCode 9. Palindrome Number](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-9-palindrome-number)
* [LeetCode 10. Regular Expression Matching](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-10-regular-expression-matching)
* [LeetCode 11. Container With Most Water](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-11-container-with-most-water)
* [LeetCode 12. Integer to Roman](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-12-integer-to-roman)
* [LeetCode 13. Roman to Integer](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-13-roman-to-integer)
* [LeetCode 14. Longest Common Prefix](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-14-longest-common-prefix)
* [LeetCode 15. 3Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-15-3sum)
* [LeetCode 16. 3Sum Closest](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-16-3sum-closest)
* [LeetCode 17. Letter Combinations of a Phone Number](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-17-letter-combinations-of-a-phone-number)
* [LeetCode 18. 4Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-18-4sum)
* [LeetCode 19. Remove Nth Node From End of List](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-19-remove-nth-node-from-end-of-list)
* [LeetCode 20. Valid Parentheses](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-20-valid-parentheses)
* [LeetCode 21. Merge Two Sorted Lists](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-21-merge-two-sorted-lists)
* [LeetCode 22. Generate Parentheses](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-22-generate-parentheses)
* [LeetCode 23. Merge k Sorted Lists](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-23-merge-k-sorted-lists)
* [LeetCode 24. Swap Nodes in Pairs](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-24-swap-nodes-in-pairs)
* [LeetCode 25. Reverse Nodes in k-Group](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-25-reverse-nodes-in-k-group)
* [LeetCode 26. Remove Duplicates from Sorted Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-26-remove-duplicates-from-sorted-array)
* [LeetCode 27. Remove Element](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-27-remove-element)
* [LeetCode 28. Implement strStr()](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-28-implement-strstr)
* [LeetCode 29. Divide Two Integers](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-29-divide-two-integers)
* [LeetCode 30. Substring with Concatenation of All Words](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-30-substring-with-concatenation-of-all-words)
* [LeetCode 31. Next Permutation](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-31-next-permutation)
* [LeetCode 32. Longest Valid Parentheses](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-32-longest-valid-parentheses)
* [LeetCode 33. Search in Rotated Sorted Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-33-search-in-rotated-sorted-array)
* [LeetCode 42. Trapping Rain Water](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-42-trapping-rain-water)
* [LeetCode 56. Merge Intervals](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-56-merge-intervals)
* [LeetCode 67. Add Binary](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-67-add-binary)
* [LeetCode 81. Search in Rotated Sorted Array II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-81-search-in-rotated-sorted-array-ii)
* [LeetCode 124. Binary Tree Maximum Path Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-124-binary-tree-maximum-path-sum)
* [LeetCode 125. Valid Palindrome](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-125-valid-palindrome)
* [LeetCode 153. Find Minimum in Rotated Sorted Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-153-find-minimum-in-rotated-sorted-array)
* [LeetCode 154. Find Minimum in Rotated Sorted Array II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-154-find-minimum-in-rotated-sorted-array-ii)
* [LeetCode 157. Read N Characters Given Read4](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-157-read-n-characters-given-read4)
* [LeetCode 158. Read N Characters Given Read4 II - Call multiple times](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-158-read-n-characters-given-read4-ii-call-multiple-times)
* [LeetCode 236. Lowest Common Ancestor of a Binary Tree](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-236-lowest-common-ancestor-of-a-binary-tree)
* [LeetCode 238. Product of Array Except Self](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-238-product-of-array-except-self)
* [LeetCode 269. Alien Dictionary](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-269-alien-dictionary)
* [LeetCode 295. Find Median from Data Stream](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-295.-find-median-from-data-stream)
* [LeetCode 297. Serialize and Deserialize Binary Tree](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-297-serialize-and-deserialize-binary-tree)
* [LeetCode 300. Longest Increasing Subsequence](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-300.-longest-increasing-subsequence)
* [LeetCode 301. Remove Invalid Parentheses](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-301-remove-invalid-parentheses)
* [LeetCode 336. Palindrome Pairs](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-336-palindrome-pairs)
* [LeetCode 407. Trapping Rain Water II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-407-trapping-rain-water-ii)
* [LeetCode 415. Add Strings](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-415-add-strings)
* [LeetCode 426. Convert Binary Search Tree to Sorted Doubly Linked List](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-426-convert-binary-search-tree-to-sorted-doubly-linked-list)
* [LeetCode 489. Robot Room Cleaner](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-489-robot-room-cleaner)
* [LeetCode 560. Subarray Sum Equals K](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-560-subarray-sum-equals-k)
* [LeetCode 680. Valid Palindrome II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-680-valid-palindrome-ii)
* [LeetCode 710. Random Pick with Blacklist](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-710-random-pick-with-blacklist)
* [LeetCode 721. Accounts Merge](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-721-accounts-merge)
* [LeetCode 863. All Nodes Distance K in Binary Tree](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-863-all-nodes-distance-k-in-binary-tree)
* [LeetCode 918. Maximum Sum Circular Subarray](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-918-maximum-sum-circular-subarray)
* [LeetCode 953. Verifying an Alien Dictionary](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-953-verifying-an-alien-dictionary)
* [LeetCode 973. K Closest Points to Origin](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-973-k-closest-points-to-origin)
* [LeetCode 1249. Minimum Remove to Make Valid Parentheses](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1249-minimum-remove-to-make-valid-parentheses)
* [LeetCode 1428. Leftmost Column with at Least a One](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1428-leftmost-column-with-at-least-a-one)
* [LeetCode 1570. Dot Product of Two Sparse Vectors](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1570-dot-product-of-two-sparse-vectors)
* [LeetCode 1644. Lowest Common Ancestor of a Binary Tree II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1644-lowest-common-ancestor-of-a-binary-tree-ii)
* [LeetCode 1650. Lowest Common Ancestor of a Binary Tree III](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1650-lowest-common-ancestor-of-a-binary-tree-iii)
* [LeetCode 1676. Lowest Common Ancestor of a Binary Tree IV](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1676-lowest-common-ancestor-of-a-binary-tree-iv)
* [LeetCode 1727. Largest Submatrix With Rearrangements](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1727.-largest-submatrix-with-rearrangements)
* [LeetCode 1751. Maximum Number of Events That Can Be Attended II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1751-maximum-number-of-events-that-can-be-attended-ii)
* [LeetCode 1754. Largest Merge Of Two Strings](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1754-largest-merge-of-two-strings)
* [LeetCode 1755. Closest Subsequence Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1755-closest-subsequence-sum)
* [LeetCode 1760. Minimum Limit of Balls in a Bag](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1760-minimum-limit-of-balls-in-a-bag)
* [LeetCode 1761. Minimum Degree of a Connected Trio in a Graph](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1761-minimum-degree-of-a-connected-trio-in-a-graph)
* [LeetCode 1764. Form Array by Concatenating Subarrays of Another Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1764-form-array-by-concatenating-subarrays-of-another-array)
* [LeetCode 1765. Map of Highest Peak](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1765-map-of-highest-peak)
* [LeetCode 1766. Tree of Coprimes](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1766-tree-of-coprimes)
* [LeetCode 1770. Maximum Score from Performing Multiplication Operations](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1770-maximum-score-from-performing-multiplication-operations)
* [LeetCode 1771. Maximize Palindrome Length From Subsequences](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1771-maximize-palindrome-length-from-subsequences)
* [LeetCode 1774. Closest Dessert Cost](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1774-closest-dessert-cost)
* [LeetCode 1775. Equal Sum Arrays With Minimum Number of Operations](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1775-equal-sum-arrays-with-minimum-number-of-operations)
* [LeetCode 1776. Car Fleet II](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1776-car-fleet-ii)
* [LeetCode 1778. Shortest Path in a Hidden Grid](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1778.-shortest-path-in-a-hidden-grid)
* [LeetCode 1779. Find Nearest Point That Has the Same X or Y Coordinate](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1779-find-nearest-point-that-has-the-same-x-or-y-coordinate)
* [LeetCode 1780. Check if Number is a Sum of Powers of Three](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1780-check-if-number-is-a-sum-of-powers-of-three)
* [LeetCode 1781. Sum of Beauty of All Substrings](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1781-sum-of-beauty-of-all-substrings)
* [LeetCode 1782. Count Pairs Of Nodes](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1782-count-pairs-of-nodes)
* [LeetCode 1784. Check if Binary String Has at Most One Segment of Ones](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1784-check-if-binary-string-has-at-most-one-segment-of-ones)
* [LeetCode 1785. Minimum Elements to Add to Form a Given Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1785-minimum-elements-to-add-to-form-a-given-sum)
* [LeetCode 1786. Number of Restricted Paths From First to Last Node](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1786-number-of-restricted-paths-from-first-to-last-node)
* [LeetCode 1787. Make the XOR of All Segments Equal to Zero](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1787-make-the-xor-of-all-segments-equal-to-zero)
* [LeetCode 1788. Maximize the Beauty of the Garden](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1788-maximize-the-beauty-of-the-garden)
* [LeetCode 1790. Check if One String Swap Can Make Strings Equal](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1790-check-if-one-string-swap-can-make-strings-equal)
* [LeetCode 1791. Find Center of Star Graph](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1791-find-center-of-star-graph)
* [LeetCode 1792. Maximum Average Pass Ratio](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1792-maximum-average-pass-ratio)
* [LeetCode 1793. Maximum Score of a Good Subarray](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1793-maximum-score-of-a-good-subarray)
* [LeetCode 1794. Count Pairs of Equal Substrings With Minimum Difference](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1794-count-pairs-of-equal-substrings-with-minimum-difference)
* [LeetCode 1796. Second Largest Digit in a String](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1796-second-largest-digit-in-a-string)
* [LeetCode 1797. Design Authentication Manager](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1797-design-authentication-manager)
* [LeetCode 1798. Maximum Number of Consecutive Values You Can Make](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1798-maximum-number-of-consecutive-values-you-can-make)
* [LeetCode 1799. Maximize Score After N Operations](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1799-maximize-score-after-n-operations)
* [LeetCode 1800. Maximum Ascending Subarray Sum](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1800-maximum-ascending-subarray-sum)
* [LeetCode 1801. Number of Orders in the Backlog](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1801-number-of-orders-in-the-backlog)
* [LeetCode 1802. Maximum Value at a Given Index in a Bounded Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1802-maximum-value-at-a-given-index-in-a-bounded-array)
* [LeetCode 1803. Count Pairs With XOR in a Range](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1803-count-pairs-with-xor-in-a-range)
* [LeetCode 1804. Implement Trie II (Prefix Tree)](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1804-implement-trie-ii-prefix-tree)
* [LeetCode 1805. Number of Different Integers in a String](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1805-number-of-different-integers-in-a-string)
* [LeetCode 1807. Evaluate the Bracket Pairs of a String](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1807-evaluate-the-bracket-pairs-of-a-string)
* [LeetCode 1808. Maximize Number of Nice Divisors](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1808-maximize-number-of-nice-divisors)
* [LeetCode 1810. Minimum Path Cost in a Hidden Grid](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1810-minimum-path-cost-in-a-hidden-grid)
* [LeetCode 1812. Determine Color of a Chessboard Square](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1812-determine-color-of-a-chessboard-square)
* [LeetCode 1813. Sentence Similarity III](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1813-sentence-similarity-iii)
* [LeetCode 1814. Count Nice Pairs in an Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1814-count-nice-pairs-in-an-array)
* [LeetCode 1815. Maximum Number of Groups Getting Fresh Donuts](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1815-maximum-number-of-groups-getting-fresh-donuts)
* [LeetCode 1816. Truncate Sentence](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1816-truncate-sentence)
* [LeetCode 1817. Finding the Users Active Minutes](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1817-finding-the-users-active-minutes)
* [LeetCode 1818. Minimum Absolute Sum Difference](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1818-minimum-absolute-sum-difference)
* [LeetCode 1819. Number of Different Subsequences GCDs](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1819-number-of-different-subsequences-gcds)
* [LeetCode 1820. Maximum Number of Accepted Invitations](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1820-maximum-number-of-accepted-invitations)
* [LeetCode 1822. Sign of the Product of an Array](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1822-sign-of-the-product-of-an-array)
* [LeetCode 1824. Minimum Sideway Jumps](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1824-minimum-sideway-jumps)
* [LeetCode 1825. Finding MK Average](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1825-finding-mk-average)
* [LeetCode 1826. Faulty Sensor](https://zhenchaogan.gitbook.io/leetcode-solution/1826-faulty-sensor)
* [LeetCode 1827. Minimum Operations to Make the Array Increasing](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1827-minimum-operations-to-make-the-array-increasing)
* [LeetCode 1828. Queries on Number of Points Inside a Circle](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1828-queries-on-number-of-points-inside-a-circle)
* [LeetCode 1829. Maximum XOR for Each Query](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1829-maximum-xor-for-each-query)
* [LeetCode 1830. Minimum Number of Operations to Make String Sorted](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1830-minimum-number-of-operations-to-make-string-sorted)
* [LeetCode 1832. Check if the Sentence Is Pangram](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1832-check-if-the-sentence-is-pangram)
* [LeetCode 1833. Maximum Ice Cream Bars](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1833-maximum-ice-cream-bars)
* [LeetCode 1834. Single-Threaded CPU](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1834-single-threaded-cpu)
* [LeetCode 1835. Find XOR Sum of All Pairs Bitwise AND](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1835-find-xor-sum-of-all-pairs-bitwise-and)
* [LeetCode 1836. Remove Duplicates From an Unsorted Linked List](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1836-remove-duplicates-from-an-unsorted-linked-list)
* [LeetCode 1837. Sum of Digits in Base K](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1837-sum-of-digits-in-base-k)
* [LeetCode 1839. Longest Substring Of All Vowels in Order](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1839-longest-substring-of-all-vowels-in-order)
* [LeetCode 1840. Maximum Building Height](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1840-maximum-building-height)
* [LeetCode 1847. Closest Room](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1847-closest-room)
* [LeetCode 1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number)
* [LeetCode 1851. Minimum Interval to Include Each Query](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1851-minimum-interval-to-include-each-query)

{% content-ref url="leetcode-297-serialize-and-deserialize-binary-tree" %}
[leetcode-297-serialize-and-deserialize-binary-tree](https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-297-serialize-and-deserialize-binary-tree)
{% endcontent-ref %}