# Leetcode solution - [Intorduction](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/ryFw9cim-e) - [2. Add Two Numbers](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/r1Fhy-5Hbg) - [66. Plus One](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/ryBxxbqSWx) - [84. Largest Rectangle in Histogram](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/By_HND5HZx) - [85. Maximal Rectangle](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SyC4eb5S-e) - [712. Minimum ASCII Delete Sum for Two Strings](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1k8eb5SZx) - [756. Pyramid Transition Matrix](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SyIOeZ5rbg) - [840. Magic Squares In Grid](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/Bk65gbcSZl) - [865. Smallest Subtree with all the Deepest Nodes](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1rhgbcBWg) - [961. N-Repeated Element in Size 2N Array](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SkSaxbcr-g) - [1161. Maximum Level Sum of a Binary Tree](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1Q1W-qSWl) - [1200. Minimum Absolute Difference](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/ByuDMTePbe) - [1266. Minimum Time Visiting All Points](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/HykrRHoSZe) - [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/HyQDwrwUWl) - [1339. Maximum Product of Splitted Binary Tree](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/Sk77-bqrZg) - [1390. Four Divisors](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1XZWW5S-e) - [1411. Number of Ways to Paint N × 3 Grid](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/r19Nb-qrbx) - [1458. Max Dot Product of Two Subsequences](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SJFwZZqHWg) - [1877. Minimize Maximum Pair Sum in Array](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/S1WpjRR8-g) - [1895. Largest Magic Square](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SJhtFUILWl) - [1970. Last Day Where You Can Still Cross](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/Hy0tWZqr-e) - [1975. Maximum Matrix Sum](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1LjbWqr-x) - [1984. Minimum Difference Between Highest and Lowest of K Scores](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/rJwFlykPZx) - [2483. Minimum Penalty for a Shop](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/ryQhWb5HZg) - [2943. Maximize Area of Square Hole in Grid](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/BkAVRPeL-g) - [2975. Maximum Square Area by Removing Fences From a Field](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/B1WqUyZLZx) - [2976. Minimum Cost to Convert String I](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SyOR_KDD-g) - [3047. Find the Largest Area of Square Inside Two Rectangles](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/Sk1RPyBLbl) - [3314. Construct the Minimum Bitwise Array I ](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/BJJAf5KIbl) - [3315. Construct the Minimum Bitwise Array II](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/H1Hed9tI-e) - [3453. Separate Squares I](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/rywSKu0rbx) - [3454. Separate Squares II](https://) (努力產出說明中...) - [3507. Minimum Pair Removal to Sort Array I](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/SJHPFtnIZe) - [3510. Minimum Pair Removal to Sort Array II](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/r1J5aYpUbx) - [3650. Minimum Cost Path with Edge Reversals](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/HyMW5QGvbl) - [3651. Minimum Cost Path with Teleportations](https://hackmd.io/@ISzeJ2A1Rf6Gx_rjfE5u_w/rJH-PcXDZe)
{"title":"0. Leetcode solution","description":"Intorduction","contributors":"[{\"id\":\"212cde27-6035-45fe-86c7-fae37c4e6eff\",\"add\":3546,\"del\":84,\"latestUpdatedAt\":1770654064072}]"}
Expand menu