# LeetCode 學習筆記 - [前言](/Vol8OVKqSGKKcbOCxO1CNQ) ## 最近更新 ## Grind 75 - [1. Two Sum](/x91vDhFJQumSSdzAMScmmQ) - [3. Longest Substring Without Repeating Characters](/s-3RPRARTZyE1WDSCPbEow) - [5. Longest Palindromic Substring](/WNlwh1ymR5G1-nX0nsMp-A) - [383. Ransom Note](/EMWOgSsGTxK3WUnwa9SKSA) - [8. String to Integer (atoi)](/J6OnSqhNRK6zSbEq2F6NhA) - [11. Container With Most Water](/trgyhkbvRGS0x8dyTfZe8g) - [139. Word Break](/jEhdHb7CQn6LHq7q9I1lNg) - [141. Linked List Cycle](/xK6xxciCTr-BTOoTPUNc1Q) - [876. Middle of the Linked List](/eViBFV7NSeu6_An2B4c_MA) - [15. 3Sum](/0wLflcPvR1esrA8JoGgwAg) - [994. Rotting Oranges](/Wj-7GQMXRUOTwvFsmmxmfA) - [17. Letter Combinations of a Phone Number](/fx94JbxbQR2eo56FE0kC_w) - [20. Valid Parentheses](/bMHq5CFGRSuikYZIO02mvA) - [409. Longest Palindrome](/3EuInRa5S32Xy0NkXkgCnA) - [322. Coin Change](/ZkVLggr0QiCqHp4S59s3cw) - [125. Valid Palindrome](/406c01ovRZWxp6bl_iQWBA) ## NeetCode 150 - [1. Two Sum](/x91vDhFJQumSSdzAMScmmQ) - [2. Add Two Numbers](/n9_JInKXS-efy5mecqiHzQ) - [3. Longest Substring Without Repeating Characters](/s-3RPRARTZyE1WDSCPbEow) - [5. Longest Palindromic Substring](/WNlwh1ymR5G1-nX0nsMp-A) - [7. Reverse Integer](/kpQ7hmY4SDasSU92andGcA) - [11. Container With Most Water](/trgyhkbvRGS0x8dyTfZe8g) - [994. Rotting Oranges](/Wj-7GQMXRUOTwvFsmmxmfA) - [17. Letter Combinations of a Phone Number](/fx94JbxbQR2eo56FE0kC_w) - [20. Valid Parentheses](/bMHq5CFGRSuikYZIO02mvA) - [66. Plus One](/YPSR-vkSSLq9S_JyZwfkIg) - [70. Climbing Stairs](/VAFNmb6rRbuvxIsyfzT7TQ) - [125. Valid Palindrome](/406c01ovRZWxp6bl_iQWBA) - [139. Word Break](/jEhdHb7CQn6LHq7q9I1lNg) - [141. Linked List Cycle](/xK6xxciCTr-BTOoTPUNc1Q) - [238. Product of Array Except Self](/YkAXCRwfSG65ap85ZUELOg) - [704. Binary Search](/5_cRDxq6QFy5lVyi0TNvug) - [322. Coin Change](/ZkVLggr0QiCqHp4S59s3cw) ## LeetCode 75 ### Array / String - [1768. Merge Strings Alternately](/S3-B0sEUTByiGEwX8xRwKg) - [1071. Greatest Common Divisor of Strings](/sfO_0eRCQOyNbrezVUXW4g) - [1431. Kids With the Greatest Number of Candies](/SqYgehJJRsGt8FBEACUrig) - [605. Can Place Flowers](/QMvPRedNRFCB2WpnxK1oIw) - [345. Reverse Vowels of a String](/nE0GlUa3Q6-NVgc3uuLZCA) - [151. Reverse Words in a String](/jxprJcHLSMmYqxe_WHSmQA) - [238. Product of Array Except Self](/YkAXCRwfSG65ap85ZUELOg) - [334. Increasing Triplet Subsequence](/bDxTN3IgSBeGpA2Ovdd3fA) - [443. String Compression](/G4iPehCgSs2nTI--GJTLIg) ### Two Pointers - [283. Move Zeroes](/wibnb6pKQN2JqqwqXCEVqQ) - [392. Is Subsequence](/tBn1Kx9kRH6Kb8IMiPNCSA) - [11. Container With Most Water](/trgyhkbvRGS0x8dyTfZe8g) - [1679. Max Number of K-Sum Pairs](/A89uMaXGRSWNuyrMBiSwww) ### Sliding Window - [643. Maximum Average Subarray I](/jpNAQ5EkSD-EP-0TA12XNQ) - [1456. Maximum Number of Vowels in a Substring of Given Length](/G0dk1bInTXmJccxeYj5ECQ) - [1004. Max Consecutive Ones III](/i1Ax_iivQXSuFZh_HxRpZg) - [1493. Longest Subarray of 1's After Deleting One Element](/u-NoR4_aSI-pGvPvgjS59w) ### Prefix Sum - [1732. Find the Highest Altitude](/Rv0hQ2YOR-uLk9KOZlNmDA) - [724. Find Pivot Index](/2z4nFERUTM6Ges9TRt8bXA) ### Hash Map / Set - [2215. Find the Difference of Two Arrays](/a2U3HYbERqqvUW-jkj0Z_g) - [1207. Unique Number of Occurrences](/OYuv3-YTQcituDVbfEZdKw) - [1657. Determine if Two Strings Are Close](/84CyuLq5Q3aDK8AHHt-9SQ) - [2352. Equal Row and Column Pairs](/rWoKMNBcSyOTIFlllhqo3w) ### Stack - [2390. Removing Stars From a String](/zPmiEThYTUGhdcuo64keTg) - [735. Asteroid Collision](/rJYpyj93RDmuAFkypSXaQA) - [394. Decode String](/8-z0-LmZRdam_111eIX_JA) ### Queue - [933. Number of Recent Calls](/UIZaOhBoRRG4o5bjpFSz5Q) - [649. Dota2 Senate](/vrh4bpK9SWa8mdsNwQnqTw) ### Linked List - [2095. Delete the Middle Node of a Linked List](/IZ471NvWR1WzOnugct7bqA) - [328. Odd Even Linked List](/wHjZu6RmTUWUZtpIel-zDw) - [206. Reverse Linked List](/JIECJF9gQR6A-yoMXhcptg) - [2130. Maximum Twin Sum of a Linked List](/GQLmiUumRD6C5dLnye7iiA) ### Binary Tree - DFS - [104. Maximum Depth of Binary Tree](/B-QbOscXQkyYYaaUjSyZGA) - [872. Leaf-Similar Trees](/E3CAjsNXQLWpFGh40ezWDw) - [1448. Count Good Nodes in Binary Tree](/c87mApsbT26gNdkKMbjJOQ) - [437. Path Sum III](/FpKAoFy_Tf6r76AXnfQjDg) - [1372. Longest ZigZag Path in a Binary Tree](/Tl0XNIG8SMuTRT_ZMO_n4g) - [236. Lowest Common Ancestor of a Binary Tree](/ue4cFy_SQp-D85tCKhmvxQ) ### Binary Tree - BFS - [199. Binary Tree Right Side View](/hyuCPRBVRtWA7R_tR_ZtSg) - [1161. Maximum Level Sum of a Binary Tree](/EMgOPqJDSDa-QW8vXNLL9Q) ### Binary Search Tree - [700. Search in a Binary Search Tree](/0qQCNJNkQyuxCMqrV7Y2Xw) - [450. Delete Node in a BST](/c8r2uRJXS8iMh2m-5Gbirw) ### Graphs - DFS - [841. Keys and Rooms](/BUJ0WriHSdezdUadyAoXmg) - [547. Number of Provinces](/DwHbuFakTP2FxzqmoCTBYQ) - [1466. Reorder Routes to Make All Paths Lead to the City Zero](/TdP1Gk0VQXSzdPiq_SvOGw) ### Graphs - BFS - [1926. Nearest Exit from Entrance in Maze](/rUAlrR7pRpW-lyrPyPvKmg) - [994. Rotting Oranges](/Wj-7GQMXRUOTwvFsmmxmfA) ### Heap / Priority Queue - [215. Kth Largest Element in an Array](/OVvIPIUkS6mT1f1rL_Xnfw) - [2336. Smallest Number in Infinite Set](/78WoPAsFQnu9XWE16oxO2w) - [2542. Maximum Subsequence Score](/xONQinDzS_GAwuTLGcgZXA) - [2462. Total Cost to Hire K Workers](/D8DBGRfkTPuKjNuSWzze9Q) ### Binary Search - [374. Guess Number Higher or Lower](/2J8R5tjmQMKJpHHGivWy-g) - [2300. Successful Pairs of Spells and Potions](/cQuhhaHCQm6jHaIhFVWztg) - [162. Find Peak Element](/42ZW7YR8Rhy1OohfZvY5yA) ### Backtracking - [17. Letter Combinations of a Phone Number](/fx94JbxbQR2eo56FE0kC_w) ### DP - 1D - [1137. N-th Tribonacci Number](/TEQyH2H2S62pQyM16SooiQ) - [746. Min Cost Climbing Stairs](/aSwC-zgpRbKWOnROCwKWsg) ## Top Interview 150 ### Array / String - [88. Merge Sorted Array](/EgUEAz21RxKVGdoZZUlKug) - [27. Remove Element](/g22alA9nTT-aTVIpveX2Eg) - [26. Remove Duplicates from Sorted Array](/XcQwYhiOQZWpqtvzrBmvBA) - [80. Remove Duplicates from Sorted Array II](/JDNhwZqoTDq56MPVQmfc0w) - [169. Majority Element](/XSy0kG0tS9iKrDC5zbYsQw) - [189. Rotate Array](/7mdd1WZcR6KAFg6fXiTx4w) - [121. Best Time to Buy and Sell Stock](/oekqtRvuREWpBMIVaysLCg) - [122. Best Time to Buy and Sell Stock II](/p0fF21WNTzmO7DThkAFIkw) - [55. Jump Game](/boUepxLzS_2Y3tiVy5hlPw) - [238. Product of Array Except Self](/YkAXCRwfSG65ap85ZUELOg) - [151. Reverse Words in a String](/jxprJcHLSMmYqxe_WHSmQA) - [6. Zigzag Conversion](/Y7T95LD-T_KIkMK1F7U1tA) - [28. Find the Index of the First Occurrence in a String](/r6Xt90v_Q-uBmryc9tijlA) ### Two Pointers - [125. Valid Palindrome](/406c01ovRZWxp6bl_iQWBA) - [392. Is Subsequence](/tBn1Kx9kRH6Kb8IMiPNCSA) - [11. Container With Most Water](/trgyhkbvRGS0x8dyTfZe8g) ### Sliding Window - [3. Longest Substring Without Repeating Characters](/s-3RPRARTZyE1WDSCPbEow) ### Hashmap - [383. Ransom Note](/EMWOgSsGTxK3WUnwa9SKSA) - [1. Two Sum](/x91vDhFJQumSSdzAMScmmQ) ### Stack - [20. Valid Parentheses](/bMHq5CFGRSuikYZIO02mvA) ### Backtracking - [17. Letter Combinations of a Phone Number](/fx94JbxbQR2eo56FE0kC_w) ### Math - [66. Plus One](/YPSR-vkSSLq9S_JyZwfkIg) ### 1D DP - [70. Climbing Stairs](/VAFNmb6rRbuvxIsyfzT7TQ) - [139. Word Break](/jEhdHb7CQn6LHq7q9I1lNg) ### Multidimensional DP - [5. Longest Palindromic Substring](/WNlwh1ymR5G1-nX0nsMp-A) ## Others - [9. Palindrome Number](/pPtJrZdzTjK7ee874cAG1A) - [12. Integer to Roman](/nUazZhOVQSm74f_jQRkrEQ) - [13. Roman to Integer](/3tQipee0QxGUs1pwRzQ6LQ) - [14. Longest Common Prefix](/hJod-xsvQnWPaYCu-C2IUQ) - [15. 3Sum](/0wLflcPvR1esrA8JoGgwAg) - [22. Generate Parentheses](/OZ1VqCfpRFajcVOf0jYb1w) - [29. Divide Two Integers](/ybuEyjXGQSCeTzldT2qWQw) - [53. Maximum Subarray](/Yzv7lq-JQgWzjoCvsFaEjA) - [56. Merge Intervals](/thUuHtfsSEm7JxJurlwiWg) - [60. Permutation Sequence](/o-MWbCcsRXWpRXcbTKXYTA) - [67. Add Binary](/aYcq4JAnSi-gfUdHIwvRCQ) - [84. Largest Rectangle in Histogram](/2YN04xPKSZaH9HMwcAqrZA) - [110. Balanced Binary Tree](/RGDfVIk3RzKBsxfq6depWQ) - [146. LRU Cache](/E16tBbEeR12M7sMEctoAew) - [150. Evaluate Reverse Polish Notation](/4eLrHdrwSaeU2CuRDE0i2Q) - [198. House Robber](/1qrWtKUlR0efSyAsa1An3g) - [200. Number of Islands](/OF3wGlbLRSGG38YWvH87yg) - [207. Course Schedule](/WNWE_zfDQ4aWHPfhh9SNJg) - [224. Basic Calculator](/ckcQYZe7TH6BdgE4QErYCg) - [231. Power of Two](/PtTgjm2dR8GS8RGVRhrtFQ) - [232. Implement Queue using Stacks](/kHP-8xdGQ3iPbxAJXt8tkw) - [316. Remove Duplicate Letters](/7G6YX1fJRTaSDd6W5dvz1g) - [326. Power of Three](/Nv8ERwHAT6yUyGV6NbnbmQ) - [342. Power of Four](/EbBusZFhTSGQvQvGq7MoOg) - [485. Max Consecutive Ones](/us2W4khtR1KlA2MxvK4MVw) - [518. Coin Change II](/CUGgwihNRLaMLZqCJo313A) - [520. Detect Capital](/OdTWybwdTmisiaMYjqrMxA) - [636. Exclusive Time of Functions](/LiExW9tQSLi5KNztMnLUPQ) - [645. Set Mismatch](/27eHm0tQS5eGsGpVkSoWYA) - [693. Binary Number with Alternating Bits](/vX6kyz4iRnahZf3x9eQNDA) - [739. Daily Temperatures](/tZ-LM0MoSpqaTsAm3UIa0g) - [744. Find Smallest Letter Greater Than Target](/c5fNsIIIRn--PA65eWIsyg) - [796. Rotate String](/UmLdrekcRMyP7iVM7EGqSw) - [799. Champagne Tower](/ENw11T59TsKaizlj09412A) - [941. Valid Mountain Array](/KZCq_iisSdWHAIwRP2ikBQ) - [1009. Complement of Base 10 Integer](/KZTOlYM-QmukLuJEZ7nYkw) - [1022. Sum of Root To Leaf Binary Numbers](/qZVvQY52TWiUgdcZ3EbYTg) - [1046. Last Stone Weight](/Lpqy2SJUT1WFp3t7gOSafQ) - [1200. Minimum Absolute Difference](/aMUSVVNdRX2vUizZx3gjFA) - [1266. Minimum Time Visiting All Points](/dhnyG7WKQvaqxxcXbRouZA) - [1344. Angle Between Hands of a Clock](/4vzbRCPIQqq51AWOdnbuzg) - [1356. Sort Integers by The Number of 1 Bits](/4r2uBCWMSA2pIWNY5L3TWw) - [1365. How Many Numbers Are Smaller Than the Current Number](/yl4v_SQ2Ru--BODyFVwSFA) - [1382. Balance a Binary Search Tree](/Hcq6CkCxSRaE24Ei69ssPA) - [1404. Number of Steps to Reduce a Number in Binary Representation to One](/U2GvL8vwSeC2uf9roiNBCA) - [1441. Build an Array With Stack Operations](/gfWlDd4_SX6aj5Y8YXaHaQ) - [1470. Shuffle the Array](/CKjBuzSjS_uY2V1Mdsl2IA) - [1475. Final Prices With a Special Discount in a Shop](/yhbcCKBnSMSCe0X5QUdOYw) - [1502. Can Make Arithmetic Progression From Sequence](/XMgxNDy3T2iTmp3lsoQVpg) - [1536. Minimum Swaps to Arrange a Binary Grid](/aT0Hiui6Ry2dfdVBOMfJGg) - [1545. Find Kth Bit in Nth Binary String](/2quwr-FySamkgiTLTpQljw) - [1582. Special Positions in a Binary Matrix](/XI_6nuyfR2uCkGHSMfeGlQ) - [1594. Maximum Non Negative Product in a Matrix](/GNIFrnFVTDueYjAKAlhh5w) - [1653. Minimum Deletions to Make String Balanced](/9G-nm5FcT8K23AJUwbPbRQ) - [1680. Concatenation of Consecutive Binary Numbers](/zU1bMhKIQgGFhXbr1or0yw) - [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](/DhZ8nLFGQQOUn9N9t6vliA) - [1700. Number of Students Unable to Eat Lunch](/ECjv_MztQx6HsyLXwZrpUw) - [1727. Largest Submatrix With Rearrangements](/jOe9RkggTAqPhpkX9p3M4Q) - [1758. Minimum Changes To Make Alternating Binary String](/jo8nhWv9R22ybhMtAmmtvA) - [1784. Check if Binary String Has at Most One Segment of Ones](/7Q2irWGFSv6pEvfSkQlbEQ) - [1877. Minimize Maximum Pair Sum in Array](/EEvtCpNBQO66soetOwql7A) - [1886. Determine Whether Matrix Can Be Obtained By Rotation](/14WIv1NwRzyfuzCAS3LBzw) - [1888. Minimum Number of Flips to Make the Binary String Alternating](/MyPqcOqMT7urap7eHyc6tg) - [1929. Concatenation of Array](/qkJEKBUwR8-LpL0AtmaubA) - [1980. Find Unique Binary String](/HDn9vuPvTLG-p2g1-AcKAA) - [2073. Time Needed to Buy Tickets](/UlWh1XD2QuWwM-Y38I-ngw) - [2124. Check if All A's Appears Before All B's](/J-em73flTmCpcYLOKVefww) - [2839. Check if Strings Can be Made Equal With Operations I](/eEdPTbi0QOSSDrU6pJjYnA) - [2840. Check if Strings Can be Made Equal With Operations II](/oj5hdAkqQ-mH_X4VoGGtcA) - [2906. Construct Product Matrix](/aABLCedsSU-BspWkJ5Qn6A) - [2946. Matrix Similarity After Cyclic Shifts](/hrqC7AJ7Ttuu5IWiFbccGg) - [3010. Divide an Array Into Subarrays With Minimum Cost I](/omKvblbjTSqAtnu4bSHsKQ) - [3070. Count Submatrices with Top-Left Element and Sum Less Than k](/kNvZtRZBSYiQtipWnYQbgg) - [3129. Find All Possible Stable Binary Arrays I](/W47oltkfSvWF9lMXn6ugRA) - [3212. Count Submatrices With Equal Frequency of X and Y](/-7yEk1vrS0qEQ--7_IkOHw) - [3314. Construct the Minimum Bitwise Array I](/h-go9DCAQi6vg4qivsx0wg) - [3379. Transformed Array](/A8Dop7ZeTS233Wy6BobtcQ) - [3507. Minimum Pair Removal to Sort Array I](/HlLW5X7DTqS8VTWtC_Huww) - [3546. Equal Sum Grid Partition I](/-qgyYUqiTGqC1EJtBhfmdQ) - [3567. Minimum Absolute Difference in Sliding Submatrix](/mbVenjd2TXiad7-tMBNmBA) - [3634. Minimum Removals to Balance Array](/rRFdyPo7QjuIhE5UDsRMWw) - [3637. Trionic Array I](/Y1plNQt8QyWct6JHQkIkSw) - [3640. Trionic Array II](/1wp-GI3uTGOaKIV1O03Ngw) - [3643. Flip Square Submatrix Vertically](/U6q6gNXlTySDPnzYiTskyA) - [3868. Minimum Cost to Equalize Arrays Using Swaps](/fdTzXTYpSG6cSEVY3E6Mag) ## Biweekly Contest 174 - [Q1. Best Reachable Tower](/7DfGPqBeRkmXXUXVJkxaKA) - [Q2. Minimum Operations to Reach Target Array](/cE1S9_1fQ4OSk-GkeWmECQ) ## Weekly Contest 485 - [Q1. Vowel-Consonant Score](/oQZppbajSQqOb8qLt5-uSA) - [Q2. Maximum Capacity Within Budget](/tqc5Z5clTey2NQOn0whb-g) - [Q3. Design Auction System](/TFegUdUCRyyL8BNFdueAeQ) ## Weekly Contest 486 - [Q1. Minimum Prefix Removal to Make Array Strictly Increasing](/y_qu69wDSUik_2TsDR05eA) - [Q2. Rotate Non-Negative Elements](/QR5cnMQ4T0eTLuOmALXLPQ) - [Q4. Find Nth Smallest Integer with K One Bits](/sECWk2uGQyGCImvh0SdXuw) ## Biweekly Contest 175 - [Q1. Reverse Letters Then Special Characters in a String](/0SPxS6MkRey6_it0a3IYvg) - [Q2. Minimum K to Reduce Array Within Limit](/razx35fuQ3-aQ42dALaclg) ## Weekly Contest 487 - [Q1. Count Monobit Integers](/gvhpU3qzSgC8FBtkoRXDsg) - [Q2. Final Element After Subarray Deletions](/vl7obK6zS2eMEpba5Vc7Fw) - [Q3. Design Ride Sharing System](/wkUFR16HRme9Km3qXRO4tg) - [Q4. Longest Alternating Subarray After Removing At Most One Element](/pZl0T3EoSHOOsgwKFQSVAQ) ## Weekly Contest 488 - [Q1. Count Dominant Indices](/ZwSlPx0NQMWCYUz1-Vyz9g) - [Q2. Merge Adjacent Equal Elements](/Ucg_xDemT_e1wfS089QJ-g) ## Biweekly Contest 176 - [Q1. Weighted Word Mapping](/rn0x8lhXTOCGDrX-iy-ulg) - [Q2. Number of Prefix Connected Groups](/qjUoNSjATyW7IMkSQEH14A) - [Q3. House Robber V](/nGKN2DqsSiiRJshb2Blo4g) ## Weekly Contest 489 - [Q1. Toggle Light Bulbs](/xCc6S357RjWoLeHM4_XHHQ) - [Q2. First Element with Unique Frequency](/YvS6bbdbQQObfCMas6AEyw) ## Weekly Contest 490 - [Q1. Find the Score Difference in a Game](/Oz-aoHaRT7OXQrtjK17OdQ) - [Q2. Check Digitorial Permutation](/cKB66ywcRXGOadjdSX1rdg) - [Q3. Maximum Bitwise XOR After Rearrangement](/p2hoynHkQbyzPpMDdb3pXg) ## Biweekly Contest 177 - [Q1. Smallest Pair With Different Frequencies](/U8zrdhgmRvqOpqeWnN3VnQ) - [Q2. Merge Close Characters](/L8qsveC2Tau_FI0oC2Uw0w) - [Q4. Sum of K-Digit Numbers in a Range](/CQi8wNikR2qvmVoZ-d9rKQ) ## Weekly Contest 491 - [Q1. Trim Trailing Vowels](/WnCegQBdQ6-BF72vTufcYg) - [Q2. Minimum Cost to Split into Ones](/3Wjl7zesSiesV5heFvOR_Q) - [Q3. Minimum Bitwise OR From Grid](/GbX8x5HwTICuN_sTEomdoA) ## Weekly Contest 492 - [Q1. Minimum Capacity Box](/i_5LEDJVRLytpEtqPjBXFw) - [Q2. Find the Smallest Balanced Index](/OUv2GR2cQdCX5YTepN6_LA) - [Q3. Minimum Operations to Sort a String](/7RfKuPnQSOGtNry7QIcjLQ) - [Q4. Minimum Cost to Partition a Binary String](/QmlnN2_PRDu2qArJXNrdQA) ## Biweekly Contest 178 - [Q1. First Unique Even Element](/9P0qXbdVQ5-NuQYV-U2VMg) - [Q2. Sum of GCD of Formed Pairs](/VWJUcKt7Te6D1yGPGoY1Vg) ## Weekly Contest 494 - [Q1. Construct Uniform Parity Array I](/-D9U0CQCQtOH_ydo0wCCqQ) - [Q2. Construct Uniform Parity Array II](/kIO9ccs6RU2ikBsfS3dBEQ) - [Q3. Minimum Removals to Achieve Target XOR](/M-MFMaIrR0qyPTHImUwC0Q) - [Q4. Count Good Subarrays](/nDgSyp0ZTB-BLzhTpnrZYg) ## Biweekly Contest 179 - [Q1. Minimum Absolute Difference Between Two Values](/WL-jFbqKRkaaXHqBgnf7wQ) - [Q2. Direction Assignments with Exactly K Visible People](/D5CyzaIwSHyB-iTSmfM7fg) - [Q3. Minimum XOR Path in a Grid](/Vdxujh3AT5yhITKYWsTMAA) ## Weekly Contest 495 - [Q1. First Matching Character From Both Ends](/B5sTk6EQQ1OaPVuKAVFiNw) - [Q2. Design Event Manager](/l6ApEaMaRD6rbnvpE360wA)
{"title":"Leetcode 學習筆記","lang":"zh-TW","image":"https://hackmd.io/_uploads/BkrLU1g4Zx.jpg","description":"本筆記記錄我在 LeetCode 解題過程中的完整學習軌跡， \n包含題目理解、解題思路、程式實作，以及常見錯誤與延伸觀念整理。\n\n內容以 **C++** 為主要語言，並依照資料結構與演算法類型進行系統化分類， \n適合作為：\n\n- 自我複習與觀念整理\n- 演算法與資料結構的長期筆記\n- 面試前的快速回顧與查閱手冊\n\n本筆記強調「**為什麼這樣想**」，而不只是「怎麼寫程式」， \n希望能將零散的解題經驗，整理成一本可持續擴充的學習筆記。","showTags":"false","contributors":"[{\"id\":\"7e10ebfb-96f9-432f-9d0c-1c75d07d0e89\",\"add\":18756,\"del\":2512,\"latestUpdatedAt\":1774854867335}]"}
Expand menu