{"version":1,"pages":[{"id":"-MSfHNMic-3QSt5iCo7L","title":"Leetcode Solutions","pathname":"/leetcode-solution","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MSk5SYWBMvLJoFn36JZ","title":"LeetCode 1. Two Sum","pathname":"/leetcode-solution/leetcode-1-two-sum","siteSpaceId":"sitesp_QTvGB","description":"Hash Map"},{"id":"-MSpBNsy7QSLhjots94Q","title":"LeetCode 2. Add Two Numbers","pathname":"/leetcode-solution/leetcode-2-add-two-numbers","siteSpaceId":"sitesp_QTvGB","description":"Linked List"},{"id":"-MT3fdl8e5jKjd7k3Qj5","title":"LeetCode 3. Longest Substring Without Repeating Characters","pathname":"/leetcode-solution/leetcode-3-longest-substring-without-repeating-characters","siteSpaceId":"sitesp_QTvGB","description":"Two Pointer"},{"id":"-MT5H2TY8OGbjTSJAua_","title":"LeetCode 4. Median of Two Sorted Arrays","pathname":"/leetcode-solution/leetcode-4-median-of-two-sorted-arrays","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MT5f02NbkXrbsGlASlz","title":"LeetCode 5. Longest Palindromic Substring","pathname":"/leetcode-solution/leetcode-5-longest-palindromic-substring","siteSpaceId":"sitesp_QTvGB","description":"Dynamic Programming"},{"id":"-MT9fkpkG7vzH_IKRjKA","title":"LeetCode 6. ZigZag Conversion","pathname":"/leetcode-solution/leetcode-6-zigzag-conversion","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MT9qsKvpLf70hWyVAwA","title":"LeetCode 7. Reverse Integer","pathname":"/leetcode-solution/leetcode-7-reverse-integer","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MTKPPNam3EOCfuZ85o3","title":"LeetCode 8. String to Integer (atoi)","pathname":"/leetcode-solution/leetcode-8-string-to-integer-atoi","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MTKdqcJfLWEF1OLa_V9","title":"LeetCode 9. Palindrome Number","pathname":"/leetcode-solution/leetcode-9-palindrome-number","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MTSM4aWSHPxm6sF-wcU","title":"LeetCode 10. Regular Expression Matching","pathname":"/leetcode-solution/leetcode-10-regular-expression-matching","siteSpaceId":"sitesp_QTvGB","description":"Backtracking"},{"id":"-MTZIsmeRif03C1zSJW7","title":"LeetCode 11. Container With Most Water","pathname":"/leetcode-solution/leetcode-11-container-with-most-water","siteSpaceId":"sitesp_QTvGB","description":"Two Pointer"},{"id":"-MTdFE1S6yHuq-2_e_sm","title":"LeetCode 12. Integer to Roman","pathname":"/leetcode-solution/leetcode-12-integer-to-roman","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MTnLhsL3DfHMSSvIDas","title":"LeetCode 13. Roman to Integer","pathname":"/leetcode-solution/leetcode-13-roman-to-integer","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MToBXE4eNGwjSkyta3K","title":"LeetCode 14. Longest Common Prefix","pathname":"/leetcode-solution/leetcode-14-longest-common-prefix","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MTt8-SbQZvZ507Q6gZi","title":"LeetCode 15. 3Sum","pathname":"/leetcode-solution/leetcode-15-3sum","siteSpaceId":"sitesp_QTvGB","description":"Two Pointer"},{"id":"-MTxw8RaAKcteweKgiT3","title":"LeetCode 16. 3Sum Closest","pathname":"/leetcode-solution/leetcode-16-3sum-closest","siteSpaceId":"sitesp_QTvGB","description":"Sort + Two Pointer"},{"id":"-MU2HvVTsW4eob5SWM2i","title":"LeetCode 17. Letter Combinations of a Phone Number","pathname":"/leetcode-solution/leetcode-17-letter-combinations-of-a-phone-number","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MU7FJ4-O3hW_0BHso7r","title":"LeetCode 18. 4Sum","pathname":"/leetcode-solution/leetcode-18-4sum","siteSpaceId":"sitesp_QTvGB","description":"Sort | Two Pointer"},{"id":"-MUCkr20roB45IQXarxK","title":"LeetCode 19. Remove Nth Node From End of List","pathname":"/leetcode-solution/leetcode-19-remove-nth-node-from-end-of-list","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MUIJ28Xom__zUqsDtXr","title":"LeetCode 20. Valid Parentheses","pathname":"/leetcode-solution/leetcode-20-valid-parentheses","siteSpaceId":"sitesp_QTvGB","description":"Stack"},{"id":"-MUMpZ4hJMQ2QOB1Qw93","title":"LeetCode 21. Merge Two Sorted Lists","pathname":"/leetcode-solution/leetcode-21-merge-two-sorted-lists","siteSpaceId":"sitesp_QTvGB","description":"Linked List"},{"id":"-MUSUVLZH7fBayWjOfDJ","title":"LeetCode 22. Generate Parentheses","pathname":"/leetcode-solution/leetcode-22-generate-parentheses","siteSpaceId":"sitesp_QTvGB","description":"Recursion"},{"id":"-MU_597GXg-DeWCYmxMc","title":"LeetCode 23. Merge k Sorted Lists","pathname":"/leetcode-solution/leetcode-23-merge-k-sorted-lists","siteSpaceId":"sitesp_QTvGB","description":"Priority Queue | Linked List"},{"id":"-MU_idvJoJsMEQi32kvX","title":"LeetCode 24. Swap Nodes in Pairs","pathname":"/leetcode-solution/leetcode-24-swap-nodes-in-pairs","siteSpaceId":"sitesp_QTvGB","description":"Linked List"},{"id":"-MUg-97REZtVXRmkbmj5","title":"LeetCode 25. Reverse Nodes in k-Group","pathname":"/leetcode-solution/leetcode-25-reverse-nodes-in-k-group","siteSpaceId":"sitesp_QTvGB","description":"Linked List"},{"id":"-MUlzNyCxXtkOIl0bq18","title":"LeetCode 26. Remove Duplicates from Sorted Array","pathname":"/leetcode-solution/leetcode-26-remove-duplicates-from-sorted-array","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MUrEghc5O6yOpUF9Okz","title":"LeetCode 27. Remove Element","pathname":"/leetcode-solution/leetcode-27-remove-element","siteSpaceId":"sitesp_QTvGB","description":"Two Pointer"},{"id":"-MUwYKBW-qkrWrIZityP","title":"LeetCode 28. Implement strStr()","pathname":"/leetcode-solution/leetcode-28-implement-strstr","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV-ZNwF7sU24hXULMPV","title":"LeetCode 29. Divide Two Integers","pathname":"/leetcode-solution/leetcode-29-divide-two-integers","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV5YReZN-2h5fd2R8Qm","title":"LeetCode 30. Substring with Concatenation of All Words","pathname":"/leetcode-solution/leetcode-30-substring-with-concatenation-of-all-words","siteSpaceId":"sitesp_QTvGB","description":"Two Pointer"},{"id":"-MVDG6bpqfG3Jj_Qe_e1","title":"LeetCode 31. Next Permutation","pathname":"/leetcode-solution/leetcode-31-next-permutation","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVE8m3bn-LSs7NFwiRS","title":"LeetCode 32. Longest Valid Parentheses","pathname":"/leetcode-solution/leetcode-32-longest-valid-parentheses","siteSpaceId":"sitesp_QTvGB","description":"DP | Stack"},{"id":"-MW3LLJ5XClEWcu-dMn6","title":"LeetCode 33. Search in Rotated Sorted Array","pathname":"/leetcode-solution/leetcode-33-search-in-rotated-sorted-array","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MXewxW4lbJ6peoP0D7O","title":"LeetCode 42. Trapping Rain Water","pathname":"/leetcode-solution/leetcode-42-trapping-rain-water","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXp8VjU-6psYZyHfw8y","title":"LeetCode 56. Merge Intervals","pathname":"/leetcode-solution/leetcode-56-merge-intervals","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYZQXNErLcZTT4C2tAa","title":"LeetCode 67. Add Binary","pathname":"/leetcode-solution/leetcode-67-add-binary","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWDPwutaK07kJ3Zd5nW","title":"LeetCode 81. Search in Rotated Sorted Array II","pathname":"/leetcode-solution/leetcode-81-search-in-rotated-sorted-array-ii","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MYZZnw6AQA-Rjb3MQAn","title":"LeetCode 124. Binary Tree Maximum Path Sum","pathname":"/leetcode-solution/leetcode-124-binary-tree-maximum-path-sum","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MYJdWtpOH1Jufq4vdHh","title":"LeetCode 125. Valid Palindrome","pathname":"/leetcode-solution/leetcode-125-valid-palindrome","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWLGE23u8J4kiiESN4R","title":"LeetCode 153. Find Minimum in Rotated Sorted Array","pathname":"/leetcode-solution/leetcode-153-find-minimum-in-rotated-sorted-array","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MWLT7ByUtjaxKYrJVF0","title":"LeetCode 154. Find Minimum in Rotated Sorted Array II","pathname":"/leetcode-solution/leetcode-154-find-minimum-in-rotated-sorted-array-ii","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MVmeYyDXpj4KgDJGCal","title":"LeetCode 157. Read N Characters Given Read4","pathname":"/leetcode-solution/leetcode-157-read-n-characters-given-read4","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVssdD_0W-j6nPL61QN","title":"LeetCode 158. Read N Characters Given Read4 II - Call multiple times","pathname":"/leetcode-solution/leetcode-158-read-n-characters-given-read4-ii-call-multiple-times","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWS-cbAip4qZG2xw9_K","title":"LeetCode 236. Lowest Common Ancestor of a Binary Tree","pathname":"/leetcode-solution/leetcode-236-lowest-common-ancestor-of-a-binary-tree","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MXpMPJ4dDlvOuX1PJPu","title":"LeetCode 238. Product of Array Except Self","pathname":"/leetcode-solution/leetcode-238-product-of-array-except-self","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWtyfyY3uOjdXUhtIc1","title":"LeetCode 269. Alien Dictionary","pathname":"/leetcode-solution/leetcode-269-alien-dictionary","siteSpaceId":"sitesp_QTvGB","description":"Topological Sort"},{"id":"-MSfN1dU-v1rFSF60wJQ","title":"Leetcode 295. Find Median from Data Stream","pathname":"/leetcode-solution/leetcode-295.-find-median-from-data-stream","siteSpaceId":"sitesp_QTvGB","description":"Heap | Priority Queue"},{"id":"-MSfHqGi34e4Xc_Ye4fp","title":"Leetcode 297. Serialize and Deserialize Binary Tree","pathname":"/leetcode-solution/leetcode-297-serialize-and-deserialize-binary-tree","siteSpaceId":"sitesp_QTvGB","description":"Binary Tree Serialization and Deserialization"},{"id":"-MSg8tuAGVzGmNElltTU","title":"LeetCode 300. Longest Increasing Subsequence","pathname":"/leetcode-solution/leetcode-300.-longest-increasing-subsequence","siteSpaceId":"sitesp_QTvGB","description":"Dynamic Programming | Binary Search"},{"id":"-MVL8fHHzcN2FyqaUzN4","title":"LeetCode 301. Remove Invalid Parentheses","pathname":"/leetcode-solution/leetcode-301-remove-invalid-parentheses","siteSpaceId":"sitesp_QTvGB","description":"BFS | DFS"},{"id":"-MYIPYY-HSZJ6RqrKPBw","title":"LeetCode 336. Palindrome Pairs","pathname":"/leetcode-solution/leetcode-336-palindrome-pairs","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXexXhOXYcU4p3rg5pL","title":"LeetCode 407. Trapping Rain Water II","pathname":"/leetcode-solution/leetcode-407-trapping-rain-water-ii","siteSpaceId":"sitesp_QTvGB","description":"Priority Queue"},{"id":"-MYZG_kwWU_u16GJ6wUx","title":"LeetCode 415. Add Strings","pathname":"/leetcode-solution/leetcode-415-add-strings","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVegP_3Vh0SpBKJjZUi","title":"LeetCode 426. Convert Binary Search Tree to Sorted Doubly Linked List","pathname":"/leetcode-solution/leetcode-426-convert-binary-search-tree-to-sorted-doubly-linked-list","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWjswSZoSswodqi2qmZ","title":"LeetCode 489. Robot Room Cleaner","pathname":"/leetcode-solution/leetcode-489-robot-room-cleaner","siteSpaceId":"sitesp_QTvGB","description":"DFS"},{"id":"-MVyX7HxXAnB4FHtAlDK","title":"LeetCode 560. Subarray Sum Equals K","pathname":"/leetcode-solution/leetcode-560-subarray-sum-equals-k","siteSpaceId":"sitesp_QTvGB","description":"Prefix Sum"},{"id":"-MYOayFe-KEU41SxzDVz","title":"LeetCode 680. Valid Palindrome II","pathname":"/leetcode-solution/leetcode-680-valid-palindrome-ii","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MW86GUFr74_EkP2Mjug","title":"LeetCode 710. Random Pick with Blacklist","pathname":"/leetcode-solution/leetcode-710-random-pick-with-blacklist","siteSpaceId":"sitesp_QTvGB","description":"Linear Search | Binary Search | HashMap"},{"id":"-MVhQEEcftDfl4aHpe6h","title":"LeetCode 721. Accounts Merge","pathname":"/leetcode-solution/leetcode-721-accounts-merge","siteSpaceId":"sitesp_QTvGB","description":"DFS | Union Find"},{"id":"-MWrcErcRZis9h8DULie","title":"LeetCode 863. All Nodes Distance K in Binary Tree","pathname":"/leetcode-solution/leetcode-863-all-nodes-distance-k-in-binary-tree","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MXevuWm0aMV_4aCz2l2","title":"LeetCode 918. Maximum Sum Circular Subarray","pathname":"/leetcode-solution/leetcode-918-maximum-sum-circular-subarray","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVQ2DPbL7SxIdW0ovGC","title":"LeetCode 953. Verifying an Alien Dictionary","pathname":"/leetcode-solution/leetcode-953-verifying-an-alien-dictionary","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV_2-9vSQkEz4RNdhAT","title":"LeetCode 973. K Closest Points to Origin","pathname":"/leetcode-solution/leetcode-973-k-closest-points-to-origin","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYE5OK3e6h0gAsTp6wx","title":"LeetCode 1249. Minimum Remove to Make Valid Parentheses","pathname":"/leetcode-solution/leetcode-1249-minimum-remove-to-make-valid-parentheses","siteSpaceId":"sitesp_QTvGB","description":"stack"},{"id":"-MVUTHZ7t-OA26aerDBd","title":"LeetCode 1428. Leftmost Column with at Least a One","pathname":"/leetcode-solution/leetcode-1428-leftmost-column-with-at-least-a-one","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MYOnhy-co8Tk47WBIR7","title":"LeetCode 1570. Dot Product of Two Sparse Vectors","pathname":"/leetcode-solution/leetcode-1570-dot-product-of-two-sparse-vectors","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWXfI3ZshiVDq5jE7np","title":"LeetCode 1644. Lowest Common Ancestor of a Binary Tree II","pathname":"/leetcode-solution/leetcode-1644-lowest-common-ancestor-of-a-binary-tree-ii","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MWbaKiD3_qGQ6JJlHUG","title":"LeetCode 1650. Lowest Common Ancestor of a Binary Tree III","pathname":"/leetcode-solution/leetcode-1650-lowest-common-ancestor-of-a-binary-tree-iii","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MWjiVe_YyGHNLvhHrqm","title":"LeetCode 1676. Lowest Common Ancestor of a Binary Tree IV","pathname":"/leetcode-solution/leetcode-1676-lowest-common-ancestor-of-a-binary-tree-iv","siteSpaceId":"sitesp_QTvGB","description":"Tree"},{"id":"-MSfPqP-jwAsjF4YQ6rc","title":"Leetcode 1727. Largest Submatrix With Rearrangements","pathname":"/leetcode-solution/leetcode-1727.-largest-submatrix-with-rearrangements","siteSpaceId":"sitesp_QTvGB","description":"Greedy | Sort"},{"id":"-MSyNPF4t9jfcf_yu7iK","title":"LeetCode 1751. Maximum Number of Events That Can Be Attended II","pathname":"/leetcode-solution/leetcode-1751-maximum-number-of-events-that-can-be-attended-ii","siteSpaceId":"sitesp_QTvGB","description":"Dynamic Programming + Binary Search"},{"id":"-MSumCC-QW0haFSpAXHY","title":"LeetCode 1754. Largest Merge Of Two Strings","pathname":"/leetcode-solution/leetcode-1754-largest-merge-of-two-strings","siteSpaceId":"sitesp_QTvGB","description":"Greedy"},{"id":"-MSva5XMwbJphzNAP4kn","title":"LeetCode 1755. Closest Subsequence Sum","pathname":"/leetcode-solution/leetcode-1755-closest-subsequence-sum","siteSpaceId":"sitesp_QTvGB","description":"Brute Force + Binary Search + Meet in the Middle"},{"id":"-MTTqMhF2AJkAWLoCA34","title":"LeetCode 1760. Minimum Limit of Balls in a Bag","pathname":"/leetcode-solution/leetcode-1760-minimum-limit-of-balls-in-a-bag","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MTUVxC3uy-p0NGn_lCi","title":"LeetCode 1761. Minimum Degree of a Connected Trio in a Graph","pathname":"/leetcode-solution/leetcode-1761-minimum-degree-of-a-connected-trio-in-a-graph","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MU0bTamjpWiS3y3-2Sp","title":"LeetCode 1764. Form Array by Concatenating Subarrays of Another Array","pathname":"/leetcode-solution/leetcode-1764-form-array-by-concatenating-subarrays-of-another-array","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MU02JynemxqSFjBrRB1","title":"LeetCode 1765. Map of Highest Peak","pathname":"/leetcode-solution/leetcode-1765-map-of-highest-peak","siteSpaceId":"sitesp_QTvGB","description":"BFS"},{"id":"-MU0FlCByJ8bGKFaP1Ls","title":"LeetCode 1766. Tree of Coprimes","pathname":"/leetcode-solution/leetcode-1766-tree-of-coprimes","siteSpaceId":"sitesp_QTvGB","description":"DFS"},{"id":"-MU1kk5oC23UsFKmauxe","title":"LeetCode 1770. Maximum Score from Performing Multiplication Operations","pathname":"/leetcode-solution/leetcode-1770-maximum-score-from-performing-multiplication-operations","siteSpaceId":"sitesp_QTvGB","description":"DP"},{"id":"-MU1r_dQPew3GfWlSVz2","title":"LeetCode 1771. Maximize Palindrome Length From Subsequences","pathname":"/leetcode-solution/leetcode-1771-maximize-palindrome-length-from-subsequences","siteSpaceId":"sitesp_QTvGB","description":"DP"},{"id":"-MUatdlS-3gq1qIBZWJW","title":"LeetCode 1774. Closest Dessert Cost","pathname":"/leetcode-solution/leetcode-1774-closest-dessert-cost","siteSpaceId":"sitesp_QTvGB","description":"DP"},{"id":"-MUapBtj_CReBYYQ_4IX","title":"LeetCode. 1775 Equal Sum Arrays With Minimum Number of Operations","pathname":"/leetcode-solution/leetcode-1775-equal-sum-arrays-with-minimum-number-of-operations","siteSpaceId":"sitesp_QTvGB","description":"Greedy"},{"id":"-MUc0vzwBnlYOPwczcmn","title":"LeetCode 1776. Car Fleet II","pathname":"/leetcode-solution/leetcode-1776-car-fleet-ii","siteSpaceId":"sitesp_QTvGB","description":"Stack"},{"id":"-MV67RNn_ID0M_TmKrvY","title":"LeetCode 1778. Shortest Path in a Hidden Grid","pathname":"/leetcode-solution/leetcode-1778.-shortest-path-in-a-hidden-grid","siteSpaceId":"sitesp_QTvGB","description":"DFS+BFS"},{"id":"-MV8O7hFU9S8N7oqQY9Z","title":"LeetCode 1779. Find Nearest Point That Has the Same X or Y Coordinate","pathname":"/leetcode-solution/leetcode-1779-find-nearest-point-that-has-the-same-x-or-y-coordinate","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV8NMQ77ev8Cdcwr0Hl","title":"LeetCode 1780. Check if Number is a Sum of Powers of Three","pathname":"/leetcode-solution/leetcode-1780-check-if-number-is-a-sum-of-powers-of-three","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV8M0sv6iTrvAFxFZBL","title":"LeetCode 1781. Sum of Beauty of All Substrings","pathname":"/leetcode-solution/leetcode-1781-sum-of-beauty-of-all-substrings","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV7dKakxGxbJjuOzu7T","title":"LeetCode 1782. Count Pairs Of Nodes","pathname":"/leetcode-solution/leetcode-1782-count-pairs-of-nodes","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVAX6cYqAZljOqetccN","title":"LeetCode 1784. Check if Binary String Has at Most One Segment of Ones","pathname":"/leetcode-solution/leetcode-1784-check-if-binary-string-has-at-most-one-segment-of-ones","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVA9tx_DoDhdofTfD2A","title":"LeetCode 1785. Minimum Elements to Add to Form a Given Sum","pathname":"/leetcode-solution/leetcode-1785-minimum-elements-to-add-to-form-a-given-sum","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MV9wl34UT25EIumundt","title":"LeetCode 1786. Number of Restricted Paths From First to Last Node","pathname":"/leetcode-solution/leetcode-1786-number-of-restricted-paths-from-first-to-last-node","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVBF_ZtRtMdV4xYe_dx","title":"LeetCode 1787. Make the XOR of All Segments Equal to Zero","pathname":"/leetcode-solution/leetcode-1787-make-the-xor-of-all-segments-equal-to-zero","siteSpaceId":"sitesp_QTvGB","description":"DP"},{"id":"-MVVGbwuxbm3mK_zdy8U","title":"LeetCode 1788. Maximize the Beauty of the Garden","pathname":"/leetcode-solution/leetcode-1788-maximize-the-beauty-of-the-garden","siteSpaceId":"sitesp_QTvGB","description":"Prefix Sum"},{"id":"-MVj9doomlnlFxTv0UZD","title":"LeetCode 1790. Check if One String Swap Can Make Strings Equal","pathname":"/leetcode-solution/leetcode-1790-check-if-one-string-swap-can-make-strings-equal","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MVj67ENsLALc89Nxlmp","title":"LeetCode 1791. Find Center of Star Graph","pathname":"/leetcode-solution/leetcode-1791-find-center-of-star-graph","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MViuqX98nuyxjMBcjky","title":"LeetCode 1792. Maximum Average Pass Ratio","pathname":"/leetcode-solution/leetcode-1792-maximum-average-pass-ratio","siteSpaceId":"sitesp_QTvGB","description":"Greedy + Priority Queue"},{"id":"-MVj0GrXIk-IVXUFBjRK","title":"LeetCode 1793. Maximum Score of a Good Subarray","pathname":"/leetcode-solution/leetcode-1793-maximum-score-of-a-good-subarray","siteSpaceId":"sitesp_QTvGB","description":"Greedy"},{"id":"-MWGfZuGmdvi0mPdZi_s","title":"LeetCode 1794. Count Pairs of Equal Substrings With Minimum Difference","pathname":"/leetcode-solution/leetcode-1794-count-pairs-of-equal-substrings-with-minimum-difference","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWG-28zRoAPK6W45wan","title":"LeetCode 1796. Second Largest Digit in a String","pathname":"/leetcode-solution/leetcode-1796-second-largest-digit-in-a-string","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWFyhKt40eFZ25SKNKj","title":"LeetCode 1797. Design Authentication Manager","pathname":"/leetcode-solution/leetcode-1797-design-authentication-manager","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWFniJR3_zIHsFF2fi6","title":"LeetCode 1798. Maximum Number of Consecutive Values You Can Make","pathname":"/leetcode-solution/leetcode-1798-maximum-number-of-consecutive-values-you-can-make","siteSpaceId":"sitesp_QTvGB","description":"Greedy"},{"id":"-MWG7PXhxHGNO60AVvje","title":"LeetCode 1799. Maximize Score After N Operations","pathname":"/leetcode-solution/leetcode-1799-maximize-score-after-n-operations","siteSpaceId":"sitesp_QTvGB","description":"Backtracking + Cache"},{"id":"-MWI-ec8q8nnJAIw3aV_","title":"LeetCode 1800. Maximum Ascending Subarray Sum","pathname":"/leetcode-solution/leetcode-1800-maximum-ascending-subarray-sum","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWI0SicvbTqlPljNt7A","title":"LeetCode 1801. Number of Orders in the Backlog","pathname":"/leetcode-solution/leetcode-1801-number-of-orders-in-the-backlog","siteSpaceId":"sitesp_QTvGB","description":"Priority Queue"},{"id":"-MWHxXFhNP1Z7pY5zqif","title":"LeetCode 1802. Maximum Value at a Given Index in a Bounded Array","pathname":"/leetcode-solution/leetcode-1802-maximum-value-at-a-given-index-in-a-bounded-array","siteSpaceId":"sitesp_QTvGB","description":"Binary Search"},{"id":"-MWIGhedSsXvj5LjbRwO","title":"LeetCode 1803. Count Pairs With XOR in a Range","pathname":"/leetcode-solution/leetcode-1803-count-pairs-with-xor-in-a-range","siteSpaceId":"sitesp_QTvGB","description":"Trie"},{"id":"-MWfEqaZgjLrZBFaCtVv","title":"LeetCode 1804. Implement Trie II (Prefix Tree)","pathname":"/leetcode-solution/leetcode-1804-implement-trie-ii-prefix-tree","siteSpaceId":"sitesp_QTvGB","description":"Trie"},{"id":"-MWr9kNiQQNFid0v-ssz","title":"LeetCode 1805. Number of Different Integers in a String","pathname":"/leetcode-solution/leetcode-1805-number-of-different-integers-in-a-string","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWrAaMq_P0Z09LWOfD2","title":"LeetCode 1807. Evaluate the Bracket Pairs of a String","pathname":"/leetcode-solution/leetcode-1807-evaluate-the-bracket-pairs-of-a-string","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MWr0fAdig0KCZ2tR65x","title":"LeetCode 1808. Maximize Number of Nice Divisors","pathname":"/leetcode-solution/leetcode-1808-maximize-number-of-nice-divisors","siteSpaceId":"sitesp_QTvGB","description":"Math"},{"id":"-MXEwO3lQVz1itfG2RmK","title":"LeetCode 1810. Minimum Path Cost in a Hidden Grid","pathname":"/leetcode-solution/leetcode-1810-minimum-path-cost-in-a-hidden-grid","siteSpaceId":"sitesp_QTvGB","description":"Graph"},{"id":"-MXNxXT7nf3CW-GWxNMD","title":"LeetCode 1812. Determine Color of a Chessboard Square","pathname":"/leetcode-solution/leetcode-1812-determine-color-of-a-chessboard-square","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXO09KNl6OKFlAV81KU","title":"LeetCode 1813. Sentence Similarity III","pathname":"/leetcode-solution/leetcode-1813-sentence-similarity-iii","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXNwMj27yZRaUIogMkA","title":"LeetCode 1814. Count Nice Pairs in an Array","pathname":"/leetcode-solution/leetcode-1814-count-nice-pairs-in-an-array","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXO9vdlynHqsD22dARx","title":"LeetCode 1815. Maximum Number of Groups Getting Fresh Donuts","pathname":"/leetcode-solution/leetcode-1815-maximum-number-of-groups-getting-fresh-donuts","siteSpaceId":"sitesp_QTvGB","description":"Greedy+DFS"},{"id":"-MXey9Q6pl0AIJOJrzf0","title":"LeetCode 1816. Truncate Sentence","pathname":"/leetcode-solution/leetcode-1816-truncate-sentence","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXeyTS-h1UPU8S66sv8","title":"LeetCode 1817. Finding the Users Active Minutes","pathname":"/leetcode-solution/leetcode-1817-finding-the-users-active-minutes","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXeymJ8dzB5Eo3C8liL","title":"LeetCode 1818. Minimum Absolute Sum Difference","pathname":"/leetcode-solution/leetcode-1818-minimum-absolute-sum-difference","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXQNmyb78dL5RYh9joq","title":"LeetCode 1819. Number of Different Subsequences GCDs","pathname":"/leetcode-solution/leetcode-1819-number-of-different-subsequences-gcds","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXp7fwvAlfVMT1lavyi","title":"LeetCode 1820. Maximum Number of Accepted Invitations","pathname":"/leetcode-solution/leetcode-1820-maximum-number-of-accepted-invitations","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXztN3gnd-Qbg0WeA1p","title":"LeetCode 1822. Sign of the Product of an Array","pathname":"/leetcode-solution/leetcode-1822-sign-of-the-product-of-an-array","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXz8OgK-F7bKQOT-w9x","title":"LeetCode 1824. Minimum Sideway Jumps","pathname":"/leetcode-solution/leetcode-1824-minimum-sideway-jumps","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MXzcINpFDTKHCaD8atL","title":"LeetCode 1825. Finding MK Average","pathname":"/leetcode-solution/leetcode-1825-finding-mk-average","siteSpaceId":"sitesp_QTvGB","description":"MultiSet"},{"id":"-MYJ2cCiElpMvxsDK7vg","title":"LeetCode 1826. Faulty Sensor","pathname":"/leetcode-solution/1826-faulty-sensor","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYX-DIpD5l5WctDeFS8","title":"LeetCode 1827. Minimum Operations to Make the Array Increasing","pathname":"/leetcode-solution/leetcode-1827-minimum-operations-to-make-the-array-increasing","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYWxt6iVa9-hDfOB6G9","title":"LeetCode 1828. Queries on Number of Points Inside a Circle","pathname":"/leetcode-solution/leetcode-1828-queries-on-number-of-points-inside-a-circle","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYWvdVtwAC5q_OadwvX","title":"LeetCode 1829. Maximum XOR for Each Query","pathname":"/leetcode-solution/leetcode-1829-maximum-xor-for-each-query","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYWZJdx__HWwE8xex1R","title":"LeetCode 1830. Minimum Number of Operations to Make String Sorted","pathname":"/leetcode-solution/leetcode-1830-minimum-number-of-operations-to-make-string-sorted","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYYHG9PuK7lNv8fNa1t","title":"LeetCode 1832. Check if the Sentence Is Pangram","pathname":"/leetcode-solution/leetcode-1832-check-if-the-sentence-is-pangram","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYYGCyo7tDiwl_wVfZB","title":"LeetCode 1833. Maximum Ice Cream Bars","pathname":"/leetcode-solution/leetcode-1833-maximum-ice-cream-bars","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYYF-NupJwxbMMmF3sp","title":"LeetCode 1834. Single-Threaded CPU","pathname":"/leetcode-solution/leetcode-1834-single-threaded-cpu","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MYY6mZZeCLxWs-ihQlw","title":"LeetCode 1835. Find XOR Sum of All Pairs Bitwise AND","pathname":"/leetcode-solution/leetcode-1835-find-xor-sum-of-all-pairs-bitwise-and","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZ1UJBACg7OmsLOGcwD","title":"LeetCode 1836. Remove Duplicates From an Unsorted Linked List","pathname":"/leetcode-solution/leetcode-1836-remove-duplicates-from-an-unsorted-linked-list","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZ9E7vXiQSqyq57yVZG","title":"LeetCode 1837. Sum of Digits in Base K","pathname":"/leetcode-solution/leetcode-1837-sum-of-digits-in-base-k","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZ6q_Z-epE-SGH2JL3W","title":"LeetCode 1839. Longest Substring Of All Vowels in Order","pathname":"/leetcode-solution/leetcode-1839-longest-substring-of-all-vowels-in-order","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZ6Pu_ehobmLOx_fnBk","title":"LeetCode 1840. Maximum Building Height","pathname":"/leetcode-solution/leetcode-1840-maximum-building-height","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZjMspcxkzMtecAH7WE","title":"LeetCode 1847. Closest Room","pathname":"/leetcode-solution/leetcode-1847-closest-room","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZkqGGBqeUjek-ES3_-","title":"LeetCode 1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number","pathname":"/leetcode-solution/leetcode-1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number","siteSpaceId":"sitesp_QTvGB","description":""},{"id":"-MZjsCZBtYBhdgDo6e-N","title":"LeetCode 1851. Minimum Interval to Include Each Query","pathname":"/leetcode-solution/leetcode-1851-minimum-interval-to-include-each-query","siteSpaceId":"sitesp_QTvGB","description":""}]}