{"id":15423902,"url":"https://github.com/arcturuszhang/playedbyleetcode","last_synced_at":"2025-07-31T03:39:22.213Z","repository":{"id":108542192,"uuid":"111370013","full_name":"ArcturusZhang/PlayedByLeetCode","owner":"ArcturusZhang","description":"My leetcode solution repo","archived":false,"fork":false,"pushed_at":"2018-10-17T15:49:49.000Z","size":603,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-29T09:32:53.971Z","etag":null,"topics":["leetcode","solutions"],"latest_commit_sha":null,"homepage":"","language":"Java","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/ArcturusZhang.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":"SupportUtil/out/artifacts/SupportUtil_jar/SupportUtil.jar","governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-11-20T06:20:39.000Z","updated_at":"2022-10-20T06:50:19.000Z","dependencies_parsed_at":"2023-04-15T21:00:36.963Z","dependency_job_id":null,"html_url":"https://github.com/ArcturusZhang/PlayedByLeetCode","commit_stats":{"total_commits":111,"total_committers":5,"mean_commits":22.2,"dds":"0.25225225225225223","last_synced_commit":"67623515aadca997087990c48edfedf50ad97d55"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcturusZhang%2FPlayedByLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcturusZhang%2FPlayedByLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcturusZhang%2FPlayedByLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcturusZhang%2FPlayedByLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ArcturusZhang","download_url":"https://codeload.github.com/ArcturusZhang/PlayedByLeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249728894,"owners_count":21316971,"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":["leetcode","solutions"],"created_at":"2024-10-01T17:44:43.113Z","updated_at":"2025-04-19T15:39:48.803Z","avatar_url":"https://github.com/ArcturusZhang.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# My solutions for LeetCode\n\nI will put my solutions (of course, the accepted ones) of [Leetcode Problems](https://leetcode.com/problemset/algorithms/) in this repo. Every problem will be done in Java.\n\n## Problems\n\n| ID | Problem | Relative Topic |\n| --- | :--- | :--- |\n| 001 | [Two Sum](https://leetcode.com/problems/two-sum/description/) | Brutal Force, Hash Table |\n| 002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/description/) | Integer Addition |\n| 003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/) | Double Pointers |\n| 004 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/description/) | Merge Sort |\n| 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Dynamic Programming |\n| 006 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | Brutal Force |\n| 007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | Brutal Force |\n| 008 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Brutal Force |\n| 009 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | Brutal Force (Reverse Half) |\n| 010 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/description/) | Brutal Force |\n| 011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | Greedy |\n| 012 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/description/) | Brutal Force |\n| 013 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/) | Brutal Force |\n| 014 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | Brutal Force, Divide and Conquer (Not Implemented) |\n| 015 | [3Sum](https://leetcode.com/problems/3sum) | Binary Search |\n| 016 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | Binary Search |\n| 017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Backtracking (DFS) |\n| 018 | [4Sum](https://leetcode.com/problems/4sum) | Binary Search |\n| 019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/) | Double Pointers |\n| 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Stack |\n| 021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Merge Sort |\n| 022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | Dynamic Programming |\n| 023 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Merge Sort (Using Priority Queue) |\n| 024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/) | Double Pointers, Stack |\n| 025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) | Stack |\n| 026 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) | Brutal Force |\n| 027 | [Remove Element](https://leetcode.com/problems/remove-element) | Brutal Force |\n| 028 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/description/) | Brutal Force |\n| 029 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/description/) | Binary Long Division |\n| 030 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/) | Hash Table |\n| 031 | [Next Permutation](https://leetcode.com/problems/next-permutation/description/) | Single Pass Approach |\n| 032 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/description/) | Stack, Dynamic Programming |\n| 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/description/) | Binary Search |\n| 034 | [Search for a Range](https://leetcode.com/problems/search-for-a-range/description/) | Binary Search |\n| 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/description/) | Brutal Force, Binary Search |\n| 036 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/description/) | Brutal Force, Hash Table |\n| 037 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/description/) | Backtracking (DFS) |\n| 038 | [Count and Say](https://leetcode.com/problems/count-and-say/description/) | Brutal Force |\n| 039 | [Combination Sum](https://leetcode.com/problems/combination-sum/description/) | Backtracking (DFS) |\n| 040 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/description/) | Backtracking (DFS) |\n| 041 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/) | Bucket Sort |\n| 043 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/description/) | Integer Long Multiplication |\n| 044 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/description/) | Brutal Force, Dynamic Programming |\n| 046 | [Permutations](https://leetcode.com/problems/permutations/description/) | Backtracking (DFS) |\n| 047 | [Permutations II](https://leetcode.com/problems/permutations-ii/description/) | Backtracking (DFS) |\n| 048 | [Rotate Image](https://leetcode.com/problems/rotate-image/description/) | Brutal Force |\n| 049 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/description/) | Hash Table |\n| 050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/description/) | Divide and Conquer |\n| 051 | [N-Queens](https://leetcode.com/problems/n-queens/description/) | Backtracking (DFS) |\n| 052 | [N-Queens-II](https://leetcode.com/problems/n-queens-ii/description/) | Backtracking (DFS) |\n| 053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/) | Dynamic Programming |\n| 056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/description/) | Brutal Force |\n| 057 | [Insert Interval](https://leetcode.com/problems/insert-interval/description/) | Brutal Force |\n| 058 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/description/) | Brutal Force |\n| 060 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/description/) | Brutal Force (Reuse 031) |\n| 061 | [Rotate List](https://leetcode.com/problems/rotate-list/description/) | Linked List |\n| 062 | [Unique Paths](https://leetcode.com/problems/unique-paths/description/) | Dynamic Programming |\n| 063 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/description/) | Dynamic Programming |\n| 064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/description/) | Dynamic Programming |\n| 065 | [Valid Number](https://leetcode.com/problems/valid-number/description/) | Brutal Force |\n| 066 | [Plus One](https://leetcode.com/problems/plus-one/description/) | Integer Addition |\n| 067 | [Add Binary](https://leetcode.com/problems/add-binary/description/) | Binary Integer Addition |\n| 068 | [Text Justification](https://leetcode.com/problems/text-justification/description/) | Brutal Force |\n| 069 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/description/) | Brutal Force, Newton Method |\n| 070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/) | Dynamic Programming (Fibonacci) |\n| 071 | [Simplify Path](https://leetcode.com/problems/simplify-path/description/) | Stack |\n| 072 | [Edit Distance](https://leetcode.com/problems/edit-distance/description/) | Dynamic Programming |\n| 073 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/description/) | Hash Table |\n| 074 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/description/) | Binary Search |\n| 075 | [Sort Colors](https://leetcode.com/problems/sort-colors/discuss/) | Hash Table |\n| 076 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/) | Hash Table |\n| 077 | [Combinations](https://leetcode.com/problems/combinations/description/) | Backtracking (DFS) |\n| 078 | [Subsets](https://leetcode.com/problems/subsets/description/) | Backtracking (DFS) |\n| 079 | [Word Search](https://leetcode.com/problems/word-search/description/) | Backtracking (DFS) |\n| 080 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/) | Brutal Force |\n| 082 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/) | Linked List |\n| 083 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/) | Linked List |\n| 085 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/description/) | Dynamic Programming |\n| 086 | [Partition List](https://leetcode.com/problems/partition-list/description/) | Linked List |\n| 087 | [Scramble String](https://leetcode.com/problems/scramble-string/description/) | Dynamic Programming |\n| 089 | [Gray Code](https://leetcode.com/problems/gray-code/description/) | Bit Manipulation, Brutal Force |\n| 090 | [Subsets II](https://leetcode.com/problems/subsets-ii/description/) | Backtracking (DFS) |\n| 091 | [Decode Ways](https://leetcode.com/problems/decode-ways/description/) | Backtracking, Dynamic Programming |\n| 092 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/) | Stack |\n| 093 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/description/) | Backtracking (DFS) |\n| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Binary Tree Traversal |\n| 095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/description/) | |\n| 096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/description/) | Dynamic Programming |\n| 098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | Binary Tree Traversal |\n| 099 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/description/) | Binary Tree Traversal |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/description/) | Binary Tree |\n| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/description/) | Binary Tree |\n| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | Binary Tree Traversal |\n| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/) | Binary Tree Traversal |\n| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | Binary Tree |\n| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) | Binary Tree Traversal |\n| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/) | Binary Tree Traversal |\n| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/) | Binary Tree Traversal |\n| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/) | Binary Tree |\n| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/description/) | Binary Tree \u0026 Linked List |\n| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/description/) | Binary Tree Traversal |\n| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/) | Binary Tree Traversal |\n| 112 | [Path Sum](https://leetcode.com/problems/path-sum/description/) | Binary Tree |\n| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/description/) | Binary Tree \u0026 Backtracking (DFS) |\n| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) | Binary Tree Traversal |\n| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/description/) | Dynamic Programming |\n| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/discuss/) | Binary Tree \u0026 Linked List |\n| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/) | Binary Tree \u0026 Linked List |\n| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/description/) | Brutal Force |\n| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/description/) | Brutal Force |\n| 120 | [Triangle](https://leetcode.com/problems/triangle/description/) | Dynamic Programming |\n| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/) | Dynamic Programming |\n| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/) | Greedy |\n| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/) | Dynamic Programming |\n| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/) | String (Palindrome) |\n| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/description/) | BFS \u0026 DFS, Graph (optimal path) |\n| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/description/) | BFS |\n| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/description/) | Sorting, Hash Table |\n| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/description/) | Binary Tree Traversal (DFS) |\n| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/description/) | DFS |\n| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph/description/) | DFS |\n| 136 | [Single Number](https://leetcode.com/problems/single-number/description/) | Hash Table, Bit Manipulation |\n| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/description/) | Hash Table, Bit Manipulation |\n| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/description/) | Linked List |\n| 139 | [Word Break](https://leetcode.com/problems/word-break/description/) | BFS, Dynamic Programming |\n| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii/description/) | cached DFS |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/description/) | Double Pointers, Hash Table |\n| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/description/) | Double Pointers |\n| 143 | [Reorder List](https://leetcode.com/problems/reorder-list/description/) | Linked List |\n| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/description/) | Binary Tree Traversal |\n| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/description/) | Binary Tree Traversal |\n| 148 | [Sort List](https://leetcode.com/problems/sort-list/description/) | Merge Sort |\n| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/description/) | Hash table |\n| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/description/) | Hash Table, Linked List |\n| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) | Binary Search |\n| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/description/) | Math |\n| 169 | [Majority Element](https://leetcode.com/problems/majority-element/description/) | Hash Map |\n| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/description/) | Math |\n| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/description/) | Math |\n| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/description/) | Binary Tree Inorder Traversal |\n| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/description/) | Dynamic Programming |\n| 179 | [Largest Number](https://leetcode.com/problems/largest-number/description/) | Sort |\n| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/) | Dynamic Programming |\n| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/description/) | Arrays |\n| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/description/) | Bit Manipulation |\n| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/) | Bit Manipulation |\n| 198 | [House Robber](https://leetcode.com/problems/house-robber/description/) | Dynamic Programming |\n| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/description/) | DFS, BFS |\n| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/description/) | Bit Manipulation |\n| 202 | [Happy Number](https://leetcode.com/problems/happy-number/description/) | Hash Table |\n| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/description/) | Linked List |\n| 204 | [Count Primes](https://leetcode.com/problems/count-primes/description/) | Sheive Method |\n| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/) | Hash Table |\n| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/) | Linked List, Stack |\n| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/description/) | Graph Topological Sort (DFS \u0026 BFS), Cyclic Path Detection |\n| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/description/) | Trie |\n| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii/description/) | Backtracking (DFS), Trie |\n| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/) | Heap Sort |\n| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/description/) | Linked List |\n| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square/description/) | Dynamic Programming |\n| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/description/) | Stack, Queue |\n| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/) | Binary Search Tree |\n| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/description/) | Bit Manipulation |\n| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/description/) | Queue, Stack |\n| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one/description/) | Math |\n| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/) | Linked List |\n| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/) | Binary Tree |\n| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/) | Binary Tree |\n| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | BFS |\n| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/) | Binary Tree Traversal |\n| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/description/) | Bit Manipulation |\n| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/description/) | Stack, Queue |\n| 268 | [Missing Number](https://leetcode.com/problems/missing-number/description/) | Math, Bit Manipulation |\n| 287 | [Find the Duplicated Number](https://leetcode.com/problems/find-the-duplicate-number/description/) | Brutal Force, Two Pointers, Divide and Conquer |\n| 292 | [Nim Game](https://leetcode.com/problems/nim-game/description/) | Math |\n| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) | Bit Manipulation |\n| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/description/) | Dynamic Programming |\n| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/description/) | Backtracking (DFS) |\n| 476 | [Number Complement](https://leetcode.com/problems/number-complement/description/) | Bit Manipulation |\n| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number/description/) | Math |\n| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/description/) | Dynamic Programming |\n| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/description/) | Backtracking (DFS) |\n| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/description/) | Linked List |","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcturuszhang%2Fplayedbyleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farcturuszhang%2Fplayedbyleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcturuszhang%2Fplayedbyleetcode/lists"}