{"id":16590658,"url":"https://github.com/shyam-chen/typescript-solutions","last_synced_at":"2025-03-21T13:31:16.671Z","repository":{"id":39695030,"uuid":"122425305","full_name":"Shyam-Chen/TypeScript-Solutions","owner":"Shyam-Chen","description":":whale: LeetCode of algorithms with JavaScript solutions written in TypeScript.","archived":false,"fork":false,"pushed_at":"2024-10-23T07:41:39.000Z","size":33270,"stargazers_count":9,"open_issues_count":0,"forks_count":2,"subscribers_count":5,"default_branch":"main","last_synced_at":"2024-10-24T19:39:02.976Z","etag":null,"topics":["algorithms","ecmascript","javascript","leetcode","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Shyam-Chen.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-02-22T03:19:13.000Z","updated_at":"2024-10-23T07:41:42.000Z","dependencies_parsed_at":"2024-05-28T12:20:13.035Z","dependency_job_id":"630875cc-8ee5-4a4e-8aa9-4a4dc9d9e4f1","html_url":"https://github.com/Shyam-Chen/TypeScript-Solutions","commit_stats":null,"previous_names":["shyam-chen/typescript-solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shyam-Chen%2FTypeScript-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shyam-Chen%2FTypeScript-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shyam-Chen%2FTypeScript-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shyam-Chen%2FTypeScript-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Shyam-Chen","download_url":"https://codeload.github.com/Shyam-Chen/TypeScript-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244806091,"owners_count":20513378,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","ecmascript","javascript","leetcode","typescript"],"created_at":"2024-10-11T23:13:52.703Z","updated_at":"2025-03-21T13:31:16.657Z","avatar_url":"https://github.com/Shyam-Chen.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TypeScript Solutions\n\n🐳 [LeetCode of algorithms](https://leetcode.com/problemset/algorithms/) with JavaScript solutions written in TypeScript.\n\n## Usage\n\n1. Clone this project\n\n```sh\n$ git clone https://github.com/Shyam-Chen/TypeScript-Solutions\n$ cd TypeScript-Solutions\n```\n\n2. Install dependencies\n\n```sh\n$ pnpm install\n```\n\n3. Run tests\n\n```sh\n$ pnpm test\n\n# run a specific test file\n$ pnpm test \u003cFILE_NAME\u003e\n# e.g.\n$ pnpm test twoSum.test.ts\n```\n\n## Beginning - Algorithms\n\n解題前應該學會的思路與技巧\n\n1. [陣列 (Array)](./algorithms/1.array/README.md)\n2. [鏈結串列 (Linked List)](./algorithms/2.linked-list/README.md)\n3. [堆疊 (Stack)](./algorithms/3.stack/README.md)\n4. [佇列 (Queue)](./algorithms/4.queue/README.md)\n5. [雜湊表 (Hash Table)](./algorithms/5.hash-table/README.md)\n6. [樹 (Tree)](./algorithms/6.tree/README.md)\n7. [堆積 (Heap)](./algorithms/7.heap/README.md)\n8. [圖 (Graph)](./algorithms/8.graph/README.md)\n9. [字典樹 (Trie)](./algorithms/9.trie/README.md)\n10. [排序 (Sorting)](./algorithms/10.sorting/README.md)\n11. [搜尋 (Searching)](./algorithms/11.searching/README.md)\n12. [分治 (Divide and Conquer)](./algorithms/12.divide-and-conquer/README.md)\n13. [回溯 (Backtracking)](./algorithms/13.backtracking/README.md)\n14. [動態規劃 (Dynamic Programming)](./algorithms/14.dynamic-programming/README.md)\n15. [貪婪 (Greedy)](./algorithms/15.greedy/README.md)\n16. [位元操作 (Bit Manipulation)](./algorithms/16.bit-manipulation/README.md)\n\n## Basic - LeetCode 75\n\nAce Coding Interview with 75 Qs\n\n- 75 Essential \u0026 Trending Problems\n- Must-do problem list for interview prep\n- Best for 1~3 month of prep time\n\nProblems:\n\n| Array / String                                 |                  |        |                          |\n| ---------------------------------------------- | ---------------- | ------ | ------------------------ |\n| 1768. Merge Strings Alternately                | [Solution][1768] | Easy   | [詳解][1768-explanation] |\n| 1071. Greatest Common Divisor of Strings       | [Solution][1071] | Easy   | 詳解                     |\n| 1431. Kids With the Greatest Number of Candies | [Solution][1431] | Easy   | 詳解                     |\n| 605. Can Place Flowers                         | [Solution][605]  | Easy   | 詳解                     |\n| 345. Reverse Vowels of a String                | [Solution][345]  | Easy   | 詳解                     |\n| 151. Reverse Words in a String                 | [Solution][151]  | Medium | 詳解                     |\n| 238. Product of Array Except Self              | [Solution][238]  | Medium | 詳解                     |\n| 334. Increasing Triplet Subsequence            | [Solution][334]  | Medium | 詳解                     |\n| 443. String Compression                        | [Solution][443]  | Medium | 詳解                     |\n\n[1768]: ./src/page-17/1768.%20Merge%20Strings%20Alternately/mergeAlternately.ts\n[1768-explanation]: ./src/page-17/1768.%20Merge%20Strings%20Alternately/README.md\n[1071]: ./src/page-11/1071.%20Greatest%20Common%20Divisor%20of%20Strings/gcdOfStrings.ts\n[1431]: ./src/page-14/1431.%20Kids%20With%20the%20Greatest%20Number%20of%20Candies/kidsWithCandies.ts\n[605]: ./src/page-6/605.%20Can%20Place%20Flowers/canPlaceFlowers.ts\n[345]: ./src/page-4/345.%20Reverse%20Vowels%20of%20a%20String/reverseVowels.ts\n[151]: ./src/page-2/151.%20Reverse%20Words%20in%20a%20String/reverseWords.ts\n[238]: ./src/page-3/238.%20Product%20of%20Array%20Except%20Self/productExceptSelf.ts\n[334]: ./src/page-4/334.%20Increasing%20Triplet%20Subsequence/increasingTriplet.ts\n[443]: ./src/page-5/443.%20String%20Compression/compress.ts\n\n| Two Pointers                    |                  |        |                         |\n| ------------------------------- | ---------------- | ------ | ----------------------- |\n| 283. Move Zeroes                | [Solution][283]  | Easy   | [詳解][283-explanation] |\n| 392. Is Subsequence             | [Solution][392]  | Easy   | 詳解                    |\n| 11. Container With Most Water   | [Solution][11]   | Medium | 詳解                    |\n| 1679. Max Number of K-Sum Pairs | [Solution][1679] | Medium | 詳解                    |\n\n[283]: ./src/page-3/283.%20Move%20Zeroes/moveZeroes.ts\n[283-explanation]: ./src/page-3/283.%20Move%20Zeroes/README.md\n[392]: ./src/page-4/392.%20Is%20Subsequence/isSubsequence.ts\n[11]: ./src/page-1/11.%20Container%20With%20Most%20Water/maxArea.ts\n[1679]: ./src/page-16/1679.%20Max%20Number%20of%20K-Sum%20Pairs/maxOperations.ts\n\n| Sliding Window                                                |                  |        |      |\n| ------------------------------------------------------------- | ---------------- | ------ | ---- |\n| 643. Maximum Average Subarray I                               | [Solution][643]  | Easy   | 詳解 |\n| 1456. Maximum Number of Vowels in a Substring of Given Length | [Solution][1456] | Medium | 詳解 |\n| 1004. Max Consecutive Ones III                                | [Solution][1004] | Medium | 詳解 |\n| 1493. Longest Subarray of 1's After Deleting One Element      | [Solution][1493] | Medium | 詳解 |\n\n[643]: ./src/page-6/643.%20Maximum%20Average%20Subarray%20I/findMaxAverage.ts\n[1456]: ./src/page-14/1456.%20Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/maxVowels.ts\n[1004]: ./src/page-10/1004.%20Max%20Consecutive%20Ones%20III/longestOnes.ts\n[1493]: ./src/page-14/1493.%20Longest%20Subarray%20of%201's%20After%20Deleting%20One%20Element/longestSubarray.ts\n\n| Prefix Sum                      |                  |      |      |\n| ------------------------------- | ---------------- | ---- | ---- |\n| 1732. Find the Highest Altitude | [Solution][1732] | Easy | 詳解 |\n| 724. Find Pivot Index           | [Solution][724]  | Easy | 詳解 |\n\n[1732]: ./src/page-16/1732.%20Find%20the%20Highest%20Altitude/largestAltitude.ts\n[724]: ./src/page-7/724.%20Find%20Pivot%20Index/pivotIndex.ts\n\n| Hash Map / Set                           |                  |        |      |\n| ---------------------------------------- | ---------------- | ------ | ---- |\n| 2215. Find the Difference of Two Arrays  | [Solution][2215] | Easy   | 詳解 |\n| 1207. Unique Number of Occurrences       | [Solution][1207] | Easy   | 詳解 |\n| 1657. Determine if Two Strings Are Close | [Solution][1657] | Medium | 詳解 |\n| 2352. Equal Row and Column Pairs         | [Solution][2352] | Medium | 詳解 |\n\n[2215]: ./src/page-21/2215.%20Find%20the%20Difference%20of%20Two%20Arrays/findDifference.ts\n[1207]: ./src/page-12/1207.%20Unique%20Number%20of%20Occurrences/uniqueOccurrences.ts\n[1657]: ./src/page-16/1657.%20Determine%20if%20Two%20Strings%20Are%20Close/closeStrings.ts\n[2352]: ./src/page-22/2352.%20Equal%20Row%20and%20Column%20Pairs/equalPairs.ts\n\n| Stack                              |                  |        |      |\n| ---------------------------------- | ---------------- | ------ | ---- |\n| 2390. Removing Stars From a String | [Solution][2390] | Medium | 詳解 |\n| 735. Asteroid Collision            | [Solution][735]  | Medium | 詳解 |\n| 394. Decode String                 | [Solution][394]  | Medium | 詳解 |\n\n[2390]: ./src/page-22/2390.%20Removing%20Stars%20From%20a%20String/removeStars.ts\n[735]: ./src/page-7/735.%20Asteroid%20Collision/asteroidCollision.ts\n[394]: ./src/page-4/394.%20Decode%20String/decodeString.ts\n\n| Queue                       |                 |        |      |\n| --------------------------- | --------------- | ------ | ---- |\n| 933. Number of Recent Calls | [Solution][933] | Easy   | 詳解 |\n| 649. Dota2 Senate           | [Solution][649] | Medium | 詳解 |\n\n[933]: ./src/page-9/933.%20Number%20of%20Recent%20Calls/RecentCounter.ts\n[649]: ./src/page-6/649.%20Dota2%20Senate/predictPartyVictory.ts\n\n| Linked List                                   |                  |        |      |\n| --------------------------------------------- | ---------------- | ------ | ---- |\n| 2095. Delete the Middle Node of a Linked List | [Solution][2095] | Medium | 詳解 |\n| 328. Odd Even Linked List                     | [Solution][328]  | Medium | 詳解 |\n| 206. Reverse Linked List                      | [Solution][206]  | Easy   | 詳解 |\n| 2130. Maximum Twin Sum of a Linked List       | [Solution][2130] | Medium | 詳解 |\n\n[2095]: ./src/page-19/2095.%20Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/deleteMiddle.ts\n[328]: ./src/page-4/328.%20Odd%20Even%20Linked%20List/oddEvenList.ts\n[206]: ./src/page-2/206.%20Reverse%20Linked%20List/reverseList.ts\n[2130]: ./src/page-20/2130.%20Maximum%20Twin%20Sum%20of%20a%20Linked%20List/pairSum.ts\n\n| Binary Tree - DFS                            |                  |        |      |\n| -------------------------------------------- | ---------------- | ------ | ---- |\n| 104. Maximum Depth of Binary Tree            | [Solution][104]  | Easy   | 詳解 |\n| 872. Leaf-Similar Trees                      | [Solution][872]  | Easy   | 詳解 |\n| 1448. Count Good Nodes in Binary Tree        | [Solution][1448] | Medium | 詳解 |\n| 437. Path Sum III                            | [Solution][437]  | Medium | 詳解 |\n| 1372. Longest ZigZag Path in a Binary Tree   | [Solution][1372] | Medium | 詳解 |\n| 236. Lowest Common Ancestor of a Binary Tree | [Solution][236]  | Medium | 詳解 |\n\n[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/maxDepth.ts\n[872]: ./src/page-9/872.%20Leaf-Similar%20Trees/leafSimilar.ts\n[1448]: ./src/page-14/1448.%20Count%20Good%20Nodes%20in%20Binary%20Tree/goodNodes.ts\n[437]: ./src/page-5/437.%20Path%20Sum%20III/pathSum.ts\n[1372]: ./src/page-13/1372.%20Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/longestZigZag.ts\n[236]: ./src/page-3/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/lowestCommonAncestor.ts\n\n| Binary Tree - BFS                        |                  |        |      |\n| ---------------------------------------- | ---------------- | ------ | ---- |\n| 199. Binary Tree Right Side View         | [Solution][199]  | Medium | 詳解 |\n| 1161. Maximum Level Sum of a Binary Tree | [Solution][1161] | Medium | 詳解 |\n\n[199]: ./src/page-2/199.%20Binary%20Tree%20Right%20Side%20View/rightSideView.ts\n[1161]: ./src/page-11/1161.%20Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/maxLevelSum.ts\n\n| Binary Search Tree                  |                 |        |      |\n| ----------------------------------- | --------------- | ------ | ---- |\n| 700. Search in a Binary Search Tree | [Solution][700] | Easy   | 詳解 |\n| 450. Delete Node in a BST           | [Solution][450] | Medium | 詳解 |\n\n[700]: ./src/page-7/700.%20Search%20in%20a%20Binary%20Search%20Tree/searchBST.ts\n[450]: ./src/page-5/450.%20Delete%20Node%20in%20a%20BST/deleteNode.ts\n\n| Graphs - DFS                                                 |                  |        |      |\n| ------------------------------------------------------------ | ---------------- | ------ | ---- |\n| 841. Keys and Rooms                                          | [Solution][841]  | Medium | 詳解 |\n| 547. Number of Provinces                                     | [Solution][547]  | Medium | 詳解 |\n| 1466. Reorder Routes to Make All Paths Lead to the City Zero | [Solution][1466] | Medium | 詳解 |\n| 399. Evaluate Division                                       | [Solution][399]  | Medium | 詳解 |\n\n[841]: ./src/page-8/841.%20Keys%20and%20Rooms/canVisitAllRooms.ts\n[547]: ./src/page-6/547.%20Number%20of%20Provinces/findCircleNum.ts\n[1466]: ./src/page-14/1466.%20Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/minReorder.ts\n[399]: ./src/page-4/399.%20Evaluate%20Division/calcEquation.ts\n\n| Graphs - BFS                             |                  |        |      |\n| ---------------------------------------- | ---------------- | ------ | ---- |\n| 1926. Nearest Exit from Entrance in Maze | [Solution][1926] | Medium | 詳解 |\n| 994. Rotting Oranges                     | [Solution][994]  | Medium | 詳解 |\n\n[1926]: ./src/page-18/1926.%20Nearest%20Exit%20from%20Entrance%20in%20Maze/nearestExit.ts\n[994]: ./src/page-10/994.%20Rotting%20Oranges/orangesRotting.ts\n\n| Heap / Priority Queue                 |                  |        |      |\n| ------------------------------------- | ---------------- | ------ | ---- |\n| 215. Kth Largest Element in an Array  | [Solution][215]  | Medium | 詳解 |\n| 2336. Smallest Number in Infinite Set | [Solution][2336] | Medium | 詳解 |\n| 2542. Maximum Subsequence Score       | [Solution][2542] | Medium | 詳解 |\n| 2462. Total Cost to Hire K Workers    | [Solution][2462] | Medium | 詳解 |\n\n[215]: ./src/page-2/215.%20Kth%20Largest%20Element%20in%20an%20Array/findKthLargest.ts\n[2336]: ./src/page-22/2336.%20Smallest%20Number%20in%20Infinite%20Set/SmallestInfiniteSet.ts\n[2542]: ./src/page-24/2542.%20Maximum%20Subsequence%20Score/maxScore.ts\n[2462]: ./src/page-23/2462.%20Total%20Cost%20to%20Hire%20K%20Workers/totalCost.ts\n\n| Binary Search                                |                  |        |      |\n| -------------------------------------------- | ---------------- | ------ | ---- |\n| 374. Guess Number Higher or Lower            | [Solution][374]  | Easy   | 詳解 |\n| 2300. Successful Pairs of Spells and Potions | [Solution][2300] | Medium | 詳解 |\n| 162. Find Peak Element                       | [Solution][162]  | Medium | 詳解 |\n| 875. Koko Eating Bananas                     | [Solution][875]  | Medium | 詳解 |\n\n[374]: ./src/page-4/374.%20Guess%20Number%20Higher%20or%20Lower/guessNumber.ts\n[2300]: ./src/page-21/2300.%20Successful%20Pairs%20of%20Spells%20and%20Potions/successfulPairs.ts\n[162]: ./src/page-2/162.%20Find%20Peak%20Element/findPeakElement.ts\n[875]: ./src/page-9/875.%20Koko%20Eating%20Bananas/minEatingSpeed.ts\n\n| Backtracking                              |                 |        |      |\n| ----------------------------------------- | --------------- | ------ | ---- |\n| 17. Letter Combinations of a Phone Number | [Solution][17]  | Medium | 詳解 |\n| 216. Combination Sum III                  | [Solution][216] | Medium | 詳解 |\n\n[17]: ./src/page-1/17.%20Letter%20Combinations%20of%20a%20Phone%20Number/letterCombinations.ts\n[216]: ./src/page-2/216.%20Combination%20Sum%20III/combinationSum3.ts\n\n| DP - 1D                        |                  |        |      |\n| ------------------------------ | ---------------- | ------ | ---- |\n| 1137. N-th Tribonacci Number   | [Solution][1137] | Easy   | 詳解 |\n| 746. Min Cost Climbing Stairs  | [Solution][746]  | Easy   | 詳解 |\n| 198. House Robber              | [Solution][198]  | Medium | 詳解 |\n| 790. Domino and Tromino Tiling | [Solution][790]  | Medium | 詳解 |\n\n[1137]: ./src/page-11/1137.%20N-th%20Tribonacci%20Number/tribonacci.ts\n[746]: ./src/page-7/746.%20Min%20Cost%20Climbing%20Stairs/minCostClimbingStairs.ts\n[198]: ./src/page-2/198.%20House%20Robber/rob.ts\n[790]: ./src/page-8/790.%20Domino%20and%20Tromino%20Tiling/numTilings.ts\n\n| DP - Multidimensional                                     |                  |        |                         |\n| --------------------------------------------------------- | ---------------- | ------ | ----------------------- |\n| 62. Unique Paths                                          | [Solution][62]   | Medium | 詳解                    |\n| 1143. Longest Common Subsequence                          | [Solution][1143] | Medium | 詳解                    |\n| 714. Best Time to Buy and Sell Stock with Transaction Fee | [Solution][714]  | Medium | [詳解][714-explanation] |\n| 72. Edit Distance                                         | [Solution][72]   | Medium | [詳解][72-explanation]  |\n\n[62]: ./src/page-1/62.%20Unique%20Paths/uniquePaths.ts\n[1143]: ./src/page-11/1143.%20Longest%20Common%20Subsequence/longestCommonSubsequence.ts\n[714]: ./src/page-7/714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/maxProfit.ts\n[714-explanation]: ./src/page-7/714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md\n[72]: ./src/page-1/72.%20Edit%20Distance/minDistance.ts\n[72-explanation]: ./src/page-1/72.%20Edit%20Distance/README.md\n\n| Bit Manipulation                              |                  |        |      |\n| --------------------------------------------- | ---------------- | ------ | ---- |\n| 338. Counting Bits                            | [Solution][338]  | Easy   | 詳解 |\n| 136. Single Number                            | [Solution][136]  | Easy   | 詳解 |\n| 1318. Minimum Flips to Make a OR b Equal to c | [Solution][1318] | Medium | 詳解 |\n\n[338]: ./src/page-4/338.%20Counting%20Bits/countBits.ts\n[136]: ./src/page-2/136.%20Single%20Number/singleNumber.ts\n[1318]: ./src/page-13/1318.%20Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/minFlips.ts\n\n| Trie                              |                  |        |      |\n| --------------------------------- | ---------------- | ------ | ---- |\n| 208. Implement Trie (Prefix Tree) | [Solution][208]  | Medium | 詳解 |\n| 1268. Search Suggestions System   | [Solution][1268] | Medium | 詳解 |\n\n[208]: ./src/page-2/208.%20Implement%20Trie%20(Prefix%20Tree)/Trie.ts\n[1268]: ./src/page-12/1268.%20Search%20Suggestions%20System/suggestedProducts.ts\n\n| Intervals                                       |                 |        |      |\n| ----------------------------------------------- | --------------- | ------ | ---- |\n| 435. Non-overlapping Intervals                  | [Solution][435] | Medium | 詳解 |\n| 452. Minimum Number of Arrows to Burst Balloons | [Solution][452] | Medium | 詳解 |\n\n[435]: ./src/page-5/435.%20Non-overlapping%20Intervals/eraseOverlapIntervals.ts\n[452]: ./src/page-5/452.%20Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/findMinArrowShots.ts\n\n| Monotonic Stack         |                 |        |      |\n| ----------------------- | --------------- | ------ | ---- |\n| 739. Daily Temperatures | [Solution][739] | Medium | 詳解 |\n| 901. Online Stock Span  | [Solution][901] | Medium | 詳解 |\n\n[739]: ./src/page-7/739.%20Daily%20Temperatures/dailyTemperatures.ts\n[901]: ./src/page-9/901.%20Online%20Stock%20Span/StockSpanner.ts\n\n## Advanced - Top Interview 150\n\nMust-do List for Interview Prep\n\n- 150 Original \u0026 Classic Questions\n- Covers comprehensive interview topics\n- Best for 3+ months of prep time\n- Problems support high-quality editorials\n\nProblems:\n\n| Array / String                                         |                 |        |      |\n| ------------------------------------------------------ | --------------- | ------ | ---- |\n| 88. Merge Sorted Array                                 | [Solution][88]  | Easy   | 詳解 |\n| 27. Remove Element                                     | [Solution][27]  | Easy   | 詳解 |\n| 26. Remove Duplicates from Sorted Array                | [Solution][26]  | Easy   | 詳解 |\n| 80. Remove Duplicates from Sorted Array II             | Solution        | Medium | 詳解 |\n| 169. Majority Element                                  | Solution        | Easy   | 詳解 |\n| 189. Rotate Array                                      | [Solution][189] | Medium | 詳解 |\n| 121. Best Time to Buy and Sell Stock                   | Solution        | Easy   | 詳解 |\n| 122. Best Time to Buy and Sell Stock II                | Solution        | Medium | 詳解 |\n| 55. Jump Game                                          | Solution        | Medium | 詳解 |\n| 45. Jump Game II                                       | Solution        | Medium | 詳解 |\n| 274. H-Index                                           | Solution        | Medium | 詳解 |\n| 380. Insert Delete GetRandom O(1)                      | Solution        | Medium | 詳解 |\n| 238. Product of Array Except Self                      | [Solution][238] | Medium | 詳解 |\n| 134. Gas Station                                       | Solution        | Medium | 詳解 |\n| 135. Candy                                             | Solution        | Hard   | 詳解 |\n| 42. Trapping Rain Water                                | Solution        | Hard   | 詳解 |\n| 13. Roman to Integer                                   | [Solution][13]  | Easy   | 詳解 |\n| 12. Integer to Roman                                   | Solution        | Medium | 詳解 |\n| 58. Length of Last Word                                | [Solution][58]  | Easy   | 詳解 |\n| 14. Longest Common Prefix                              | [Solution][14]  | Easy   | 詳解 |\n| 151. Reverse Words in a String                         | [Solution][151] | Medium | 詳解 |\n| 6. Zigzag Conversion                                   | [Solution][6]   | Medium | 詳解 |\n| 28. Find the Index of the First Occurrence in a String | [Solution][28]  | Easy   | 詳解 |\n| 68. Text Justification                                 | [Solution][68]  | Hard   | 詳解 |\n\n[88]: ./src/page-1//88.%20Merge%20Sorted%20Array/merge.ts\n[27]: ./src/page-1/27.%20Remove%20Element/removeElement.ts\n[26]: ./src/page-1/26.%20Remove%20Duplicates%20from%20Sorted%20Array/removeDuplicates.ts\n[189]: ./src/page-2/189.%20Rotate%20Array/rotate.ts\n[238]: ./src/page-3/238.%20Product%20of%20Array%20Except%20Self/productExceptSelf.ts\n[13]: ./src/page-1/13.%20Roman%20to%20Integer/romanToInt.ts\n[58]: ./src/page-1/58.%20Length%20of%20Last%20Word/lengthOfLastWord.ts\n[14]: ./src/page-1/14.%20Longest%20Common%20Prefix/longestCommonPrefix.ts\n[151]: ./src/page-2/151.%20Reverse%20Words%20in%20a%20String/reverseWords.ts\n[6]: ./src/page-1/6.%20Zigzag%20Conversion/convert.ts\n[28]: ./src/page-1/28.%20Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/strStr.ts\n[68]: ./src/page-1/68.%20Text%20Justification/fullJustify.ts\n\n| Two Pointers                            |                 |        |      |\n| --------------------------------------- | --------------- | ------ | ---- |\n| 125. Valid Palindrome                   | Solution        | Easy   | 詳解 |\n| 392. Is Subsequence                     | [Solution][392] | Easy   | 詳解 |\n| 167. Two Sum II - Input Array Is Sorted | Solution        | Medium | 詳解 |\n| 11. Container With Most Water           | [Solution][11]  | Medium | 詳解 |\n| 15. 3Sum                                | Solution        | Medium | 詳解 |\n\n[392]: ./src/page-4/392.%20Is%20Subsequence/isSubsequence.ts\n[11]: ./src/page-1/11.%20Container%20With%20Most%20Water/maxArea.ts\n\n| Sliding Window                                    |               |        |      |\n| ------------------------------------------------- | ------------- | ------ | ---- |\n| 209. Minimum Size Subarray Sum                    | Solution      | Medium | 詳解 |\n| 3. Longest Substring Without Repeating Characters | [Solution][3] | Medium | 詳解 |\n| 30. Substring with Concatenation of All Words     | Solution      | Hard   | 詳解 |\n| 76. Minimum Window Substring                      | Solution      | Hard   | 詳解 |\n\n[3]: ./src/page-1/3.%20Longest%20Substring%20Without%20Repeating%20Characters/lengthOfLongestSubstring.ts\n\n| Matrix                |          |        |      |\n| --------------------- | -------- | ------ | ---- |\n| 36. Valid Sudoku      | Solution | Medium | 詳解 |\n| 54. Spiral Matrix     | Solution | Medium | 詳解 |\n| 48. Rotate Image      | Solution | Medium | 詳解 |\n| 73. Set Matrix Zeroes | Solution | Medium | 詳解 |\n| 289. Game of Life     | Solution | Medium | 詳解 |\n\n| Hashmap                           |               |        |      |\n| --------------------------------- | ------------- | ------ | ---- |\n| 383. Ransom Note                  | Solution      | Easy   | 詳解 |\n| 205. Isomorphic Strings           | Solution      | Easy   | 詳解 |\n| 290. Word Pattern                 | Solution      | Easy   | 詳解 |\n| 242. Valid Anagram                | Solution      | Easy   | 詳解 |\n| 49. Group Anagrams                | Solution      | Medium | 詳解 |\n| 1. Two Sum                        | [Solution][1] | Easy   | 詳解 |\n| 202. Happy Number                 | Solution      | Easy   | 詳解 |\n| 219. Contains Duplicate II        | Solution      | Easy   | 詳解 |\n| 128. Longest Consecutive Sequence | Solution      | Medium | 詳解 |\n\n[1]: ./src/page-1/1.%20Two%20Sum/twoSum.ts\n\n| Intervals                                       |                 |        |      |\n| ----------------------------------------------- | --------------- | ------ | ---- |\n| 228. Summary Ranges                             | Solution        | Easy   | 詳解 |\n| 56. Merge Intervals                             | Solution        | Medium | 詳解 |\n| 57. Insert Interval                             | Solution        | Medium | 詳解 |\n| 452. Minimum Number of Arrows to Burst Balloons | [Solution][452] | Medium | 詳解 |\n\n[452]: ./src/page-5/452.%20Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/findMinArrowShots.ts\n\n| Stack                                 |                 |        |      |\n| ------------------------------------- | --------------- | ------ | ---- |\n| 20. Valid Parentheses                 | [Solution][20]  | Easy   | 詳解 |\n| 71. Simplify Path                     | Solution        | Medium | 詳解 |\n| 155. Min Stack                        | [Solution][155] | Medium | 詳解 |\n| 150. Evaluate Reverse Polish Notation | Solution        | Medium | 詳解 |\n| 224. Basic Calculator                 | Solution        | Hard   | 詳解 |\n\n[20]: ./src/page-1/20.%20Valid%20Parentheses/isValid.ts\n[155]: ./src/page-2/155.%20Min%20Stack/MinStack.ts\n\n| Linked List                               |                 |        |      |\n| ----------------------------------------- | --------------- | ------ | ---- |\n| 141. Linked List Cycle                    | [Solution][141] | Easy   | 詳解 |\n| 2. Add Two Numbers                        | [Solution][2]   | Medium | 詳解 |\n| 21. Merge Two Sorted Lists                | [Solution][21]  | Easy   | 詳解 |\n| 138. Copy List with Random Pointer        | Solution        | Medium | 詳解 |\n| 92. Reverse Linked List II                | Solution        | Medium | 詳解 |\n| 25. Reverse Nodes in k-Group              | Solution        | Hard   | 詳解 |\n| 19. Remove Nth Node From End of List      | Solution        | Medium | 詳解 |\n| 82. Remove Duplicates from Sorted List II | Solution        | Medium | 詳解 |\n| 61. Rotate List                           | Solution        | Medium | 詳解 |\n| 86. Partition List                        | Solution        | Medium | 詳解 |\n| 146. LRU Cache                            | Solution        | Medium | 詳解 |\n\n[141]: ./src/page-2/141.%20Linked%20List%20Cycle/hasCycle.ts\n[2]: ./src/page-1/2.%20Add%20Two%20Numbers/addTwoNumbers.ts\n[21]: ./src/page-1/21.%20Merge%20Two%20Sorted%20Lists/mergeTwoLists.ts\n\n| Binary Tree General                                             |                 |        |      |\n| --------------------------------------------------------------- | --------------- | ------ | ---- |\n| 104. Maximum Depth of Binary Tree                               | [Solution][104] | Easy   | 詳解 |\n| 100. Same Tree                                                  | [Solution][100] | Easy   | 詳解 |\n| 226. Invert Binary Tree                                         | Solution        | Easy   | 詳解 |\n| 101. Symmetric Tree                                             | [Solution][101] | Easy   | 詳解 |\n| 105. Construct Binary Tree from Preorder and Inorder Traversal  | Solution        | Medium | 詳解 |\n| 106. Construct Binary Tree from Inorder and Postorder Traversal | Solution        | Medium | 詳解 |\n| 117. Populating Next Right Pointers in Each Node II             | Solution        | Medium | 詳解 |\n| 114. Flatten Binary Tree to Linked List                         | Solution        | Medium | 詳解 |\n| 112. Path Sum                                                   | [Solution][112] | Easy   | 詳解 |\n| 129. Sum Root to Leaf Numbers                                   | Solution        | Medium | 詳解 |\n| 124. Binary Tree Maximum Path Sum                               | Solution        | Hard   | 詳解 |\n| 173. Binary Search Tree Iterator                                | Solution        | Medium | 詳解 |\n| 222. Count Complete Tree Nodes                                  | Solution        | Easy   | 詳解 |\n| 236. Lowest Common Ancestor of a Binary Tree                    | [Solution][236] | Medium | 詳解 |\n\n[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/maxDepth.ts\n[100]: ./src/page-1/100.%20Same%20Tree/isSameTree.ts\n[101]: ./src/page-2/101.%20Symmetric%20Tree/isSymmetric.ts\n[112]: ./src/page-2/112.%20Path%20Sum/hasPathSum.ts\n[236]: ./src/page-3/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/lowestCommonAncestor.ts\n\n| Binary Tree BFS                               |                 |        |      |\n| --------------------------------------------- | --------------- | ------ | ---- |\n| 199. Binary Tree Right Side View              | [Solution][199] | Medium | 詳解 |\n| 637. Average of Levels in Binary Tree         | Solution        | Easy   | 詳解 |\n| 102. Binary Tree Level Order Traversal        | Solution        | Medium | 詳解 |\n| 103. Binary Tree Zigzag Level Order Traversal | Solution        | Medium | 詳解 |\n\n[199]: ./src/page-2/199.%20Binary%20Tree%20Right%20Side%20View/rightSideView.ts\n\n| Binary Search Tree                      |          |        |      |\n| --------------------------------------- | -------- | ------ | ---- |\n| 530. Minimum Absolute Difference in BST | Solution | Easy   | 詳解 |\n| 230. Kth Smallest Element in a BST      | Solution | Medium | 詳解 |\n| 98. Validate Binary Search Tree         | Solution | Medium | 詳解 |\n\n| Graph General           |                 |        |      |\n| ----------------------- | --------------- | ------ | ---- |\n| 200. Number of Islands  | Solution        | Medium | 詳解 |\n| 130. Surrounded Regions | Solution        | Medium | 詳解 |\n| 133. Clone Graph        | Solution        | Medium | 詳解 |\n| 399. Evaluate Division  | [Solution][399] | Medium | 詳解 |\n| 207. Course Schedule    | Solution        | Medium | 詳解 |\n| 210. Course Schedule II | Solution        | Medium | 詳解 |\n\n[399]: ./src/page-4/399.%20Evaluate%20Division/calcEquation.ts\n\n| Graph BFS                     |          |        |      |\n| ----------------------------- | -------- | ------ | ---- |\n| 909. Snakes and Ladders       | Solution | Medium | 詳解 |\n| 433. Minimum Genetic Mutation | Solution | Medium | 詳解 |\n| 127. Word Ladder              | Solution | Hard   | 詳解 |\n\n| Trie                                            |                 |        |      |\n| ----------------------------------------------- | --------------- | ------ | ---- |\n| 208. Implement Trie (Prefix Tree)               | [Solution][208] | Medium | 詳解 |\n| 211. Design Add and Search Words Data Structure | Solution        | Medium | 詳解 |\n| 212. Word Search II                             | Solution        | Hard   | 詳解 |\n\n[208]: ./src/page-2/208.%20Implement%20Trie%20(Prefix%20Tree)/Trie.ts\n\n| Backtracking                              |                |        |      |\n| ----------------------------------------- | -------------- | ------ | ---- |\n| 17. Letter Combinations of a Phone Number | [Solution][17] | Medium | 詳解 |\n| 77. Combinations                          | Solution       | Medium | 詳解 |\n| 46. Permutations                          | [Solution][46] | Medium | 詳解 |\n| 39. Combination Sum                       | [Solution][39] | Medium | 詳解 |\n| 52. N-Queens II                           | Solution       | Hard   | 詳解 |\n| 22. Generate Parentheses                  | Solution       | Medium | 詳解 |\n| 79. Word Search                           | Solution       | Medium | 詳解 |\n\n[17]: ./src/page-1/17.%20Letter%20Combinations%20of%20a%20Phone%20Number/letterCombinations.ts\n[46]: ./src/page-1/46.%20Permutations/permute.ts\n[39]: ./src/page-1/39.%20Combination%20Sum/combinationSum.ts\n\n| Divide \u0026 Conquer                                |                 |        |      |\n| ----------------------------------------------- | --------------- | ------ | ---- |\n| 108. Convert Sorted Array to Binary Search Tree | [Solution][108] | Easy   | 詳解 |\n| 148. Sort List                                  | Solution        | Medium | 詳解 |\n| 427. Construct Quad Tree                        | Solution        | Medium | 詳解 |\n| 23. Merge k Sorted Lists                        | Solution        | Hard   | 詳解 |\n\n[108]: ./src/page-2/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/sortedArrayToBST.ts\n\n| Kadane's Algorithm                 |                |        |      |\n| ---------------------------------- | -------------- | ------ | ---- |\n| 53. Maximum Subarray               | [Solution][53] | Medium | 詳解 |\n| 918. Maximum Sum Circular Subarray | Solution       | Medium | 詳解 |\n\n[53]: ./src/page-1/53.%20Maximum%20Subarray/maxSubArray.ts\n\n| Binary Search                                               |                 |        |      |\n| ----------------------------------------------------------- | --------------- | ------ | ---- |\n| 35. Search Insert Position                                  | [Solution][35]  | Easy   | 詳解 |\n| 74. Search a 2D Matrix                                      | Solution        | Medium | 詳解 |\n| 162. Find Peak Element                                      | [Solution][162] | Medium | 詳解 |\n| 33. Search in Rotated Sorted Array                          | Solution        | Medium | 詳解 |\n| 34. Find First and Last Position of Element in Sorted Array | [Solution][34]  | Medium | 詳解 |\n| 153. Find Minimum in Rotated Sorted Array                   | Solution        | Medium | 詳解 |\n| 4. Median of Two Sorted Arrays                              | [Solution][4]   | Hard   | 詳解 |\n\n[35]: ./src/page-1/35.%20Search%20Insert%20Position/searchInsert.ts\n[162]: ./src/page-2/162.%20Find%20Peak%20Element/findPeakElement.ts\n[34]: ./src/page-1/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/searchRange.ts\n[4]: ./src/page-1/4.%20Median%20of%20Two%20Sorted%20Arrays/findMedianSortedArrays.ts\n\n| Heap                                 |                 |        |      |\n| ------------------------------------ | --------------- | ------ | ---- |\n| 215. Kth Largest Element in an Array | [Solution][215] | Medium | 詳解 |\n| 502. IPO                             | Solution        | Hard   | 詳解 |\n| 373. Find K Pairs with Smallest Sums | Solution        | Medium | 詳解 |\n| 295. Find Median from Data Stream    | Solution        | Hard   | 詳解 |\n\n[215]: ./src/page-2/215.%20Kth%20Largest%20Element%20in%20an%20Array/findKthLargest.ts\n\n| Bit Manipulation                  |                 |        |      |\n| --------------------------------- | --------------- | ------ | ---- |\n| 67. Add Binary                    | [Solution][67]  | Easy   | 詳解 |\n| 190. Reverse Bits                 | [Solution][190] | Easy   | 詳解 |\n| 191. Number of 1 Bits             | [Solution][191] | Easy   | 詳解 |\n| 136. Single Number                | [Solution][136] | Easy   | 詳解 |\n| 137. Single Number II             | Solution        | Medium | 詳解 |\n| 201. Bitwise AND of Numbers Range | Solution        | Medium | 詳解 |\n\n[67]: ./src/page-1/67.%20Add%20Binary/addBinary.ts\n[190]: ./src/page-2/190.%20Reverse%20Bits/reverseBits.ts\n[191]: ./src/page-2/191.%20Number%20of%201%20Bits/hammingWeight.ts\n[136]: ./src/page-2/136.%20Single%20Number/singleNumber.ts\n\n| Math                           |                |        |      |\n| ------------------------------ | -------------- | ------ | ---- |\n| 9. Palindrome Number           | [Solution][9]  | Easy   | 詳解 |\n| 66. Plus One                   | [Solution][66] | Easy   | 詳解 |\n| 172. Factorial Trailing Zeroes | Solution       | Medium | 詳解 |\n| 69. Sqrt(x)                    | [Solution][69] | Easy   | 詳解 |\n| 50. Pow(x, n)                  | [Solution][50] | Medium | 詳解 |\n| 149. Max Points on a Line      | Solution       | Hard   | 詳解 |\n\n[9]: ./src/page-1/9.%20Palindrome%20Number/isPalindrome.ts\n[66]: ./src/page-1/66.%20Plus%20One/plusOne.ts\n[69]: ./src/page-1/69.%20Sqrt(x)/mySqrt.ts\n[50]: ./src/page-1/50.%20Pow(x,%20n)/myPow.ts\n\n| 1D DP                               |                 |        |      |\n| ----------------------------------- | --------------- | ------ | ---- |\n| 70. Climbing Stairs                 | [Solution][70]  | Easy   | 詳解 |\n| 198. House Robber                   | [Solution][198] | Medium | 詳解 |\n| 139. Word Break                     | [Solution][139] | Medium | 詳解 |\n| 322. Coin Change                    | Solution        | Medium | 詳解 |\n| 300. Longest Increasing Subsequence | Solution        | Medium | 詳解 |\n\n[70]: ./src/page-1/70.%20Climbing%20Stairs/climbStairs.ts\n[198]: ./src/page-2/198.%20House%20Robber/rob.ts\n[139]: ./src/page-2/139.%20Word%20Break/wordBreak.ts\n\n| Multidimensional DP                      |                |        |                        |\n| ---------------------------------------- | -------------- | ------ | ---------------------- |\n| 120. Triangle                            | Solution       | Medium | 詳解                   |\n| 64. Minimum Path Sum                     | Solution       | Medium | 詳解                   |\n| 63. Unique Paths II                      | Solution       | Medium | 詳解                   |\n| 5. Longest Palindromic Substring         | [Solution][5]  | Medium | 詳解                   |\n| 97. Interleaving String                  | Solution       | Medium | 詳解                   |\n| 72. Edit Distance                        | [Solution][72] | Medium | [詳解][72-explanation] |\n| 123. Best Time to Buy and Sell Stock III | Solution       | Hard   | 詳解                   |\n| 188. Best Time to Buy and Sell Stock IV  | Solution       | Hard   | 詳解                   |\n| 221. Maximal Square                      | Solution       | Medium | 詳解                   |\n\n[5]: ./src/page-1/5.%20Longest%20Palindromic%20Substring/longestPalindrome.ts\n[72]: ./src/page-1/72.%20Edit%20Distance/minDistance.ts\n[72-explanation]: ./src/page-1/72.%20Edit%20Distance/README.md\n\n## Impactful - Top 100 Liked\n\n100 Best Rated Problems\n\n- 100 most liked problems by LeetCoders\n- Organized based on hot topics that help improve coding skills in interviews\n\nProblems:\n\n| Backtracking                              |                |        |      |\n| ----------------------------------------- | -------------- | ------ | ---- |\n| 17. Letter Combinations of a Phone Number | [Solution][17] | Medium | 詳解 |\n| 22. Generate Parentheses                  | Solution       | Medium | 詳解 |\n| 39. Combination Sum                       | [Solution][39] | Medium | 詳解 |\n| 46. Permutations                          | [Solution][46] | Medium | 詳解 |\n| 51. N-Queens                              | Solution       | Hard   | 詳解 |\n| 78. Subsets                               | Solution       | Medium | 詳解 |\n| 79. Word Search                           | Solution       | Medium | 詳解 |\n| 131. Palindrome Partitioning              | Solution       | Medium | 詳解 |\n\n[17]: ./src/page-1/17.%20Letter%20Combinations%20of%20a%20Phone%20Number/letterCombinations.ts\n[39]: ./src/page-1/39.%20Combination%20Sum/combinationSum.ts\n[46]: ./src/page-1/46.%20Permutations/permute.ts\n\n| Binary Search                                               |                |        |      |\n| ----------------------------------------------------------- | -------------- | ------ | ---- |\n| 4. Median of Two Sorted Arrays                              | [Solution][4]  | Hard   | 詳解 |\n| 33. Search in Rotated Sorted Array                          | Solution       | Medium | 詳解 |\n| 34. Find First and Last Position of Element in Sorted Array | [Solution][34] | Medium | 詳解 |\n| 35. Search Insert Position                                  | [Solution][35] | Easy   | 詳解 |\n| 74. Search a 2D Matrix                                      | Solution       | Medium | 詳解 |\n| 124. Binary Tree Maximum Path Sum                           | Solution       | Hard   | 詳解 |\n| 153. Find Minimum in Rotated Sorted Array                   | Solution       | Medium | 詳解 |\n\n[4]: ./src/page-1/4.%20Median%20of%20Two%20Sorted%20Arrays/findMedianSortedArrays.ts\n[34]: ./src/page-1/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/searchRange.ts\n[35]: ./src/page-1/35.%20Search%20Insert%20Position/searchInsert.ts\n\n| Binary Tree                                                    |                 |        |      |\n| -------------------------------------------------------------- | --------------- | ------ | ---- |\n| 94. Binary Tree Inorder Traversal                              | [Solution][94]  | Easy   | 詳解 |\n| 98. Validate Binary Search Tree                                | Solution        | Medium | 詳解 |\n| 101. Symmetric Tree                                            | [Solution][101] | Easy   | 詳解 |\n| 102. Binary Tree Level Order Traversal                         | Solution        | Medium | 詳解 |\n| 104. Maximum Depth of Binary Tree                              | [Solution][104] | Easy   | 詳解 |\n| 105. Construct Binary Tree from Preorder and Inorder Traversal | Solution        | Medium | 詳解 |\n| 108. Convert Sorted Array to Binary Search Tree                | [Solution][108] | Easy   | 詳解 |\n| 114. Flatten Binary Tree to Linked List                        | Solution        | Medium | 詳解 |\n| 199. Binary Tree Right Side View                               | [Solution][199] | Medium | 詳解 |\n| 226. Invert Binary Tree                                        | Solution        | Easy   | 詳解 |\n| 230. Kth Smallest Element in a BST                             | Solution        | Medium | 詳解 |\n| 236. Lowest Common Ancestor of a Binary Tree                   | [Solution][236] | Medium | 詳解 |\n| 437. Path Sum III                                              | [Solution][437] | Medium | 詳解 |\n| 543. Diameter of Binary Tree                                   | Solution        | Easy   | 詳解 |\n\n[94]: ./src/page-1/94.%20Binary%20Tree%20Inorder%20Traversal/inorderTraversal.ts\n[101]: ./src/page-2/101.%20Symmetric%20Tree/isSymmetric.ts\n[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/maxDepth.ts\n[108]: ./src/page-2/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/sortedArrayToBST.ts\n[199]: ./src/page-2/199.%20Binary%20Tree%20Right%20Side%20View/rightSideView.ts\n[236]: ./src/page-3/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/lowestCommonAncestor.ts\n[437]: ./src/page-5/437.%20Path%20Sum%20III/pathSum.ts\n\n| Dynamic Programming                 |                  |        |                        |\n| ----------------------------------- | ---------------- | ------ | ---------------------- |\n| 5. Longest Palindromic Substring    | [Solution][5]    | Medium | 詳解                   |\n| 32. Longest Valid Parentheses       | Solution         | Hard   | 詳解                   |\n| 62. Unique Paths                    | [Solution][62]   | Medium | 詳解                   |\n| 64. Minimum Path Sum                | Solution         | Medium | 詳解                   |\n| 70. Climbing Stairs                 | [Solution][70]   | Easy   | 詳解                   |\n| 72. Edit Distance                   | [Solution][72]   | Medium | [詳解][72-explanation] |\n| 118. Pascal's Triangle              | [Solution][118]  | Easy   | 詳解                   |\n| 139. Word Break                     | [Solution][139]  | Medium | 詳解                   |\n| 152. Maximum Product Subarray       | Solution         | Medium | 詳解                   |\n| 198. House Robber                   | [Solution][198]  | Medium | 詳解                   |\n| 279. Perfect Squares                | Solution         | Medium | 詳解                   |\n| 300. Longest Increasing Subsequence | Solution         | Medium | 詳解                   |\n| 322. Coin Change                    | Solution         | Medium | 詳解                   |\n| 416. Partition Equal Subset Sum     | Solution         | Medium | 詳解                   |\n| 1143. Longest Common Subsequence    | [Solution][1143] | Medium | 詳解                   |\n\n[5]: ./src/page-1/5.%20Longest%20Palindromic%20Substring/longestPalindrome.ts\n[62]: ./src/page-1/62.%20Unique%20Paths/uniquePaths.ts\n[70]: ./src/page-1/70.%20Climbing%20Stairs/climbStairs.ts\n[72]: ./src/page-1/72.%20Edit%20Distance/minDistance.ts\n[72-explanation]: ./src/page-1/72.%20Edit%20Distance/README.md\n[118]: ./src/page-2/118.%20Pascal's%20Triangle/generate.ts\n[139]: ./src/page-2/139.%20Word%20Break/wordBreak.ts\n[198]: ./src/page-2/198.%20House%20Robber/rob.ts\n[1143]: ./src/page-11/1143.%20Longest%20Common%20Subsequence/longestCommonSubsequence.ts\n\n| Graph                  |                 |        |      |\n| ---------------------- | --------------- | ------ | ---- |\n| 200. Number of Islands | Solution        | Medium | 詳解 |\n| 207. Course Schedule   | Solution        | Medium | 詳解 |\n| 994. Rotting Oranges   | [Solution][994] | Medium | 詳解 |\n\n[994]: ./src/page-10/994.%20Rotting%20Oranges/orangesRotting.ts\n\n| Greedy                               |          |        |      |\n| ------------------------------------ | -------- | ------ | ---- |\n| 45. Jump Game II                     | Solution | Medium | 詳解 |\n| 55. Jump Game                        | Solution | Medium | 詳解 |\n| 121. Best Time to Buy and Sell Stock | Solution | Easy   | 詳解 |\n| 763. Partition Labels                | Solution | Medium | 詳解 |\n\n| Hashing                           |               |        |      |\n| --------------------------------- | ------------- | ------ | ---- |\n| 1. Two Sum                        | [Solution][1] | Easy   | 詳解 |\n| 49. Group Anagrams                | Solution      | Medium | 詳解 |\n| 128. Longest Consecutive Sequence | Solution      | Medium | 詳解 |\n| 560. Subarray Sum Equals K        | Solution      | Medium | 詳解 |\n\n[1]: ./src/page-1/1.%20Two%20Sum/twoSum.ts\n\n| Heap                                 |                 |        |      |\n| ------------------------------------ | --------------- | ------ | ---- |\n| 215. Kth Largest Element in an Array | [Solution][215] | Medium | 詳解 |\n| 295. Find Median from Data Stream    | Solution        | Hard   | 詳解 |\n| 347. Top K Frequent Elements         | Solution        | Medium | 詳解 |\n\n[215]: ./src/page-2/215.%20Kth%20Largest%20Element%20in%20an%20Array/findKthLargest.ts\n\n| Linked Lists                          |                 |        |      |\n| ------------------------------------- | --------------- | ------ | ---- |\n| 2. Add Two Numbers                    | [Solution][2]   | Medium | 詳解 |\n| 19. Remove Nth Node From End of List  | Solution        | Medium | 詳解 |\n| 21. Merge Two Sorted Lists            | [Solution][21]  | Easy   | 詳解 |\n| 23. Merge k Sorted Lists              | Solution        | Hard   | 詳解 |\n| 24. Swap Nodes in Pairs               | Solution        | Medium | 詳解 |\n| 25. Reverse Nodes in k-Group          | Solution        | Hard   | 詳解 |\n| 138. Copy List with Random Pointer    | Solution        | Medium | 詳解 |\n| 141. Linked List Cycle                | [Solution][141] | Easy   | 詳解 |\n| 142. Linked List Cycle II             | Solution        | Medium | 詳解 |\n| 146. LRU Cache                        | Solution        | Medium | 詳解 |\n| 148. Sort List                        | Solution        | Medium | 詳解 |\n| 160. Intersection of Two Linked Lists | Solution        | Easy   | 詳解 |\n| 206. Reverse Linked List              | [Solution][206] | Easy   | 詳解 |\n| 234. Palindrome Linked List           | Solution        | Easy   | 詳解 |\n\n[2]: ./src/page-1/2.%20Add%20Two%20Numbers/addTwoNumbers.ts\n[21]: ./src/page-1/21.%20Merge%20Two%20Sorted%20Lists/mergeTwoLists.ts\n[141]: ./src/page-2/141.%20Linked%20List%20Cycle/hasCycle.ts\n[206]: ./src/page-2/206.%20Reverse%20Linked%20List/reverseList.ts\n\n| Matrix                     |                |        |      |\n| -------------------------- | -------------- | ------ | ---- |\n| 48. Rotate Image           | Solution       | Medium | 詳解 |\n| 54. Spiral Matrix          | [Solution][54] | Medium | 詳解 |\n| 73. Set Matrix Zeroes      | Solution       | Medium | 詳解 |\n| 240. Search a 2D Matrix II | Solution       | Medium | 詳解 |\n\n[54]: ./src/page-1/54.%20Spiral%20Matrix/spiralOrder.ts\n\n| Sliding Window                                    |          |        |      |\n| ------------------------------------------------- | -------- | ------ | ---- |\n| 3. Longest Substring Without Repeating Characters | Solution | Medium | 詳解 |\n| 76. Minimum Window Substring                      | Solution | Hard   | 詳解 |\n| 239. Sliding Window Maximum                       | Solution | Hard   | 詳解 |\n| 438. Find All Anagrams in a String                | Solution | Medium | 詳解 |\n\n[3]: ./src/page-1/3.%20Longest%20Substring%20Without%20Repeating%20Characters/lengthOfLongestSubstring.ts\n\n| Stack                              |                 |        |      |\n| ---------------------------------- | --------------- | ------ | ---- |\n| 20. Valid Parentheses              | [Solution][20]  | Easy   | 詳解 |\n| 84. Largest Rectangle in Histogram | Solution        | Hard   | 詳解 |\n| 155. Min Stack                     | [Solution][155] | Medium | 詳解 |\n| 394. Decode String                 | [Solution][394] | Medium | 詳解 |\n| 739. Daily Temperatures            | [Solution][739] | Medium | 詳解 |\n\n[20]: ./src/page-1/20.%20Valid%20Parentheses/isValid.ts\n[155]: ./src/page-2/155.%20Min%20Stack/MinStack.ts\n[394]: ./src/page-4/394.%20Decode%20String/decodeString.ts\n[739]: ./src/page-7/739.%20Daily%20Temperatures/dailyTemperatures.ts\n\n| Two Pointers                  |                 |        |                         |\n| ----------------------------- | --------------- | ------ | ----------------------- |\n| 11. Container With Most Water | [Solution][11]  | Medium | 詳解                    |\n| 15. 3Sum                      | Solution        | Medium | 詳解                    |\n| 42. Trapping Rain Water       | Solution        | Hard   | 詳解                    |\n| 283. Move Zeroes              | [Solution][283] | Easy   | [詳解][283-explanation] |\n\n[11]: ./src/page-1/11.%20Container%20With%20Most%20Water/maxArea.ts\n[283]: ./src/page-3/283.%20Move%20Zeroes/moveZeroes.ts\n[283-explanation]: ./src/page-3/283.%20Move%20Zeroes/README.md\n\n| Trie                              |                 |        |      |\n| --------------------------------- | --------------- | ------ | ---- |\n| 208. Implement Trie (Prefix Tree) | [Solution][208] | Medium | 詳解 |\n\n[208]: ./src/page-2/208.%20Implement%20Trie%20(Prefix%20Tree)/Trie.ts\n\n| Misc                              |                 |        |                         |\n| --------------------------------- | --------------- | ------ | ----------------------- |\n| 31. Next Permutation              | Solution        | Medium | 詳解                    |\n| 41. First Missing Positive        | Solution        | Hard   | 詳解                    |\n| 53. Maximum Subarray              | [Solution][53]  | Medium | 詳解                    |\n| 56. Merge Intervals               | Solution        | Medium | 詳解                    |\n| 75. Sort Colors                   | Solution        | Medium | 詳解                    |\n| 136. Single Number                | [Solution][136] | Easy   | 詳解                    |\n| 169. Majority Element             | Solution        | Easy   | 詳解                    |\n| 189. Rotate Array                 | [Solution][189] | Medium | 詳解                    |\n| 238. Product of Array Except Self | [Solution][238] | Medium | 詳解                    |\n| 287. Find the Duplicate Number    | [Solution][287] | Medium | [詳解][287-explanation] |\n\n[53]: ./src/page-1/53.%20Maximum%20Subarray/maxSubArray.ts\n[136]: ./src/page-2/136.%20Single%20Number/singleNumber.ts\n[189]: ./src/page-2/189.%20Rotate%20Array/rotate.ts\n[238]: ./src/page-3/238.%20Product%20of%20Array%20Except%20Self/productExceptSelf.ts\n[287]: ./src/page-3/287.%20Find%20the%20Duplicate%20Number/findDuplicate.ts\n[287-explanation]: ./src/page-3/287.%20Find%20the%20Duplicate%20Number/README.md\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshyam-chen%2Ftypescript-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshyam-chen%2Ftypescript-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshyam-chen%2Ftypescript-solutions/lists"}