{"id":21967407,"url":"https://github.com/keke-li/go-structures-algorithm","last_synced_at":"2026-03-14T16:34:43.580Z","repository":{"id":38257788,"uuid":"219469060","full_name":"KeKe-Li/go-structures-algorithm","owner":"KeKe-Li","description":"go structures for algorithm","archived":false,"fork":false,"pushed_at":"2024-06-19T02:25:34.000Z","size":1496,"stargazers_count":21,"open_issues_count":0,"forks_count":8,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-30T07:22:29.857Z","etag":null,"topics":["algorithms","go","structure"],"latest_commit_sha":null,"homepage":"https://github.com/KeKe-Li/go-structures-algorithm","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/KeKe-Li.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-11-04T09:56:45.000Z","updated_at":"2024-06-19T02:25:37.000Z","dependencies_parsed_at":"2023-01-21T22:15:52.370Z","dependency_job_id":null,"html_url":"https://github.com/KeKe-Li/go-structures-algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KeKe-Li%2Fgo-structures-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KeKe-Li%2Fgo-structures-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KeKe-Li%2Fgo-structures-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/KeKe-Li%2Fgo-structures-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/KeKe-Li","download_url":"https://codeload.github.com/KeKe-Li/go-structures-algorithm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250572639,"owners_count":21452334,"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","go","structure"],"created_at":"2024-11-29T13:26:28.301Z","updated_at":"2026-03-14T16:34:43.570Z","avatar_url":"https://github.com/KeKe-Li.png","language":"Go","readme":"### go-structures-algorithm\n\n\u003cp align='left'\u003e\n\u003cimg src=\"https://img.shields.io/badge/build-passing-brightgreen.svg\"\u003e\n\u003ca href=\"https://twitter.com/perfactsen\"\u003e\u003cimg src=\"https://img.shields.io/badge/twitter-keke-green.svg?style=flat\u0026colorA=009df2\"\u003e\u003c/a\u003e\n\u003ca href=\"https://www.zhihu.com/people/sencoed.com/activities\"\u003e\u003cimg src=\"https://img.shields.io/badge/%E7%9F%A5%E4%B9%8E-keke-green.svg?style=flat\u0026colorA=009df2\"\u003e\u003c/a\u003e\n\u003ca href=\"https://golang.google.cn\"\u003e\u003cimg src=\"https://img.shields.io/badge/Go-1.13-blue.svg\"\u003e\u003c/a\u003e\n\u003c/p\u003e\n\nGo 的数据结构和算法 , 以及一些在leetcode上的一些题目的解答集合.\n\n#### Data Structures\n\n数据结构:是相互之间存在-种或多种特定关系的数据元素的集合。按照视点的不同,我们把数据结构分为逻辑结构和物理结构。\n\n* 逻辑结构\n\n逻辑结构指反映数据元素之间的逻辑关系的数据结构，其中的逻辑关系是指数据元素之间的前后关系，而与他们在计算机中的存储位置无关。\n\n逻辑结构分为以下四类：\n\n1. 集合结构\n\n集合结构中的数据元素同属于一个集合，他们之间是并列的关系，除此之外没有其他关系。\n\n2. 线性结构\n\n线性结构中的元素存在一对一的相互关系。主要包括:数组，栈，队列，链表，哈希表.\n\n3. 树形结构\n\n树形结构中的元素存在一对多的相互关系。主要包括:二叉树，二分搜索树，AVL，红黑树，Treap，Splay，堆，Trie，线段树，K-D树，并查集，哈夫曼树...\n\n\n4. 图形结构\n\n图形结构中的元素存在多对多的相互关系。主要包括:邻接矩阵，邻接表.\n\n* 物理结构\n\n物理结构:是指数据的逻辑结构在计算机中的存储形式。物理结构又叫存储结构，指数据的逻辑结构在计算机存储空间的存放形式。通俗的讲，物理结构研究的是数据在存储器中存放的形式。 \n\n数据元素的存储结构形式有两种:顺序存储和链式存储。 \n\n1. 顺序存储结构\n\n顺序存储结构:是把数据元素存放在地址连续的存储单元里，其数据间的逻辑关 系和物理关系是一致的.\n\n这种存储结构其实很简单，说白了 ， 就是排队占位。大家都按顺序排好，每个人 占一小段空间，大家谁也别插谁的队。 我们之前学计算机语言时，数组就是这样的顺 序存储结构。\n\n2. 链式存储结构\n\n链式存储结构:是把数据元素存放在任意的存储单元里，这组存储单元可以是连 续的，也可以是不连续的.\n\n数据元素的存储关系并不能反映其逻辑关系，因此需要用 一个指针存放数据元素的地址，这样通过地址就可以找到相关联数据元素的位置.\n\n显然，链式存储就灵活多了，数据存在哪里不重要，只要有一个指针存放了相应的地址就能找到白了 。\n\n数据结构类型:\n\n* [Augmented Tree](https://github.com/KeKe-Li/go-structures-algorithm/blob/master/src/structures/augmentedtree/atree.go)\n* [Bitarray](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/bitarray/bitarray.go)\n* [Queue](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/queue/queue.go)\n* [Fibonacci Heap](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/fibheap/fibheap.go)\n* [Range Tree](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/rangetree/interface.go)\n* [AVL Tree](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/tree/avl/avl.go)\n* [hashmap](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/hashmap/fastinteger/hashmap.go)\n* [Skiplist](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/skiplist/skiplist.go)\n* [B+ Tree](https://github.com/KeKe-Li/go-structures-algorithm/blob/feature-keke/src/structures/btree/palm/tree.go)\n\n跳跃表 (Skiplist)\n\n增加了向前指针的链表叫作跳表。跳表全称叫做跳跃表，简称跳表。跳表是一个随机化的数据结构，实质就是一种可以进行二分查找的有序链表。\n\n跳表在原有的有序链表上面增加了多级索引，通过索引来实现快速查找。跳表不仅能提高搜索性能，同时也可以提高插入和删除操作的性能。采用Redis底层类似的实现，在每层上增加了偏移量的记录，好处是在按排行取元素的时候可以先从上层按偏移量快速定位到目标位置，不需要在底层链表进行遍历定位。\n\n#### Algorithms \n\n| # | Title | Solution | Acceptance | Difficulty | Frequency |\n|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|\n| 0001 | Two Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0001.%20Two%20Sum) | 44.30% | Easy | |\n| 0002 | Add Two Numbers | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0002.%20Add%20Two%20Numbers) | 31.30% | Medium | |\n| 0003 | Longest Substring Without Repeating Characters | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0003.%20Longest%20Substring%20Without%20Repeating%20Characters) | 28.50% | Medium | |\n| 0004 | Median of Two Sorted Arrays | | 26.60% | Hard | |\n| 0005 | Longest Palindromic Substring | | 27.50% | Medium | |\n| 0006 | ZigZag Conversion | | 32.20% | Medium | |\n| 0007 | Reverse Integer |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0007.%20Reverse%20Integer) | 25.40% | Easy | |\n| 0008 | String to Integer (atoi) | | 14.70% | Medium | |\n| 0009 | Palindrome Number | | 43.70% | Easy | |\n| 0010 | Regular Expression Matching | | 25.40% | Hard | |\n| 0011 | Container With Most Water | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0011.%20Container%20With%20Most%20Water) | 45.10% | Medium | |\n| 0012 | Integer to Roman | | 51.30% | Medium | |\n| 0013 | Roman to Integer | | 52.60% | Easy | |\n| 0014 | Longest Common Prefix | | 33.70% | Easy | |\n| 0015 | 3Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0015.%203Sum) | 24.20% | Medium | |\n| 0016 | 3Sum Closest | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0016.%203Sum%20Closest) | 45.80% | Medium | |\n| 0017 | Letter Combinations of a Phone Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0017.%20Letter%20Combinations%20of%20a%20Phone%20Number) | 41.90% | Medium | |\n| 0018 | 4Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0018.%204Sum) | 30.80% | Medium | |\n| 0019 | Remove Nth Node From End of List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0019.%20Remove%20Nth%20Node%20From%20End%20of%20List) | 34.30% | Medium | |\n| 0020 | Valid Parentheses | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0020.%20Valid-Parentheses) | 36.70% | Easy | |\n| 0021 | Merge Two Sorted Lists | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0021.%20Merge%20Two%20Sorted%20Lists) | 47.70% | Easy | |\n| 0022 | Generate Parentheses | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0022.%20Generate%20Parentheses) | 55.50% | Medium | |\n| 0023 | Merge k Sorted Lists | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0023.%20Merge%20k%20Sorted%20Lists) | 34.90% | Hard | |\n| 0024 | Swap Nodes in Pairs | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0024.%20Swap%20Nodes%20in%20Pairs) | 45.10% | Medium | |\n| 0025 | Reverse Nodes in k-Group | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0025.%20Reverse%20Nodes%20in%20k%20Group) | 36.80% | Hard | |\n| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array) | 41.00% | Easy | |\n| 0027 | Remove Element | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0027.%20Remove%20Element) | 44.80% | Easy | |\n| 0028 | Implement strStr() | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0028.%20Implement%20strStr()) | 32.20% | Easy | |\n| 0029 | Divide Two Integers | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0029.%20Divide%20Two%20Integers) | 16.10% | Medium | |\n| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)(是否还有更优解) | 23.70% | Hard | |\n| 0031 | Next Permutation | | 30.60% | Medium | |\n| 0032 | Longest Valid Parentheses | | 25.70% | Hard | |\n| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0033.%20Search%20in%20Rotated%20Sorted%20Array) | 33.00% | Medium | |\n| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array) | 33.70% | Medium | |\n| 0035 | Search Insert Position | | 40.90% | Easy | |\n| 0036 | Valid Sudoku | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0036.%20Valid%20Sudoku) | 43.50% | Medium | |\n| 0037 | Sudoku Solver | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0037.%20Sudoku%20Solver) | 37.40% | Hard | |\n| 0038 | Count and Say | | 40.80% | Easy | |\n| 0039 | Combination Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0039.%20Combination%20Sum) | 49.10% | Medium | |\n| 0040 | Combination Sum II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0040.%20Combination%20Sum%20II) | 42.10% | Medium | |\n| 0041 | First Missing Positive | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0041.%20First-Missing-Positive) | 29.10% | Hard | |\n| 0042 | Trapping Rain Water | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0042.%20Trapping%20Rain%20Water) | 43.50% | Hard | |\n| 0043 | Multiply Strings | | 30.90% | Medium | |\n| 0044 | Wildcard Matching | | 23.00% | Hard | |\n| 0045 | Jump Game II | | 28.20% | Hard | |\n| 0046 | Permutations | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0046.%20Permutations) | 55.70% | Medium | |\n| 0047 | Permutations II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0047.%20Permutations%20II) | 40.90% | Medium | |\n| 0048 | Rotate Image | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0048.%20Rotate%20Image) | 49.00% | Medium | |\n| 0049 | Group Anagrams | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0049.%20Group%20Anagrams) | 47.40% | Medium | |\n| 0050 | Pow(x, n) | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0050.%20Pow(x%2C%20n)) | 28.10% | Medium |\n| 0051 | N-Queens | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0051.%20N-Queens) | 39.80% | Hard | |\n| 0052 | N-Queens II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0052.%20N-Queens%20II) | 52.40% | Hard | |\n| 0053 | Maximum Subarray | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0053.%20Maximum%20Subarray) | 43.80% | Easy | |\n| 0054 | Spiral Matrix | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0054.%20Spiral%20Matrix) | 30.70% | Medium | |\n| 0055 | Jump Game | | 32.10% | Medium | |\n| 0056 | Merge Intervals | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0056.%20Merge%20Intervals) | 35.90% | Medium | |\n| 0057 | Insert Interval | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0057.%20Insert%20Interval) | 31.40% | Hard | |\n| 0058 | Length of Last Word | | 32.30% | Easy | |\n| 0059 | Spiral Matrix II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0059.%20Spiral%20Matrix%20II) | 47.00% | Medium | |\n| 0060 | Permutation Sequence | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0060.%20Permutation%20Sequence) | 33.40% | Medium | |\n| 0061 | Rotate List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0061.%20Rotate%20List) | 27.30% | Medium | |\n| 0062 | Unique Paths | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0062.%20Unique%20Paths) | 48.00% | Medium | |\n| 0063 | Unique Paths II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0063.%20Unique%20Paths%20II) | 33.50% | Medium | |\n| 0064 | Minimum Path Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0064.%20Minimum%20Path%20Sum) | 47.30% | Medium | |\n| 0065 | Valid Number | | 14.10% | Hard | |\n| 0066 | Plus One | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0066.%20Plus%20One) | 41.40% | Easy | |\n| 0067 | Add Binary | | 39.50% | Easy | |\n| 0068 | Text Justification | | 23.50% | Hard | |\n| 0069 | Sqrt(x) | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0069.%20Sqrt(x)) | 31.50% | Easy | |\n| 0070 | Climbing Stairs | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0070.%20Climbing%20Stairs) | 44.40% | Easy | |\n| 0071 | Simplify Path | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0071.%20Simplify%20Path) | 29.00% | Medium | |\n| 0072 | Edit Distance | | 38.20% | Hard | |\n| 0073 | Set Matrix Zeroes | | 40.10% | Medium | |\n| 0074 | Search a 2D Matrix | | 35.00% | Medium | |\n| 0075 | Sort Colors | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0075.%20Sort%20Colors) | 42.40% | Medium | |\n| 0076 | Minimum Window Substring | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0076.%20Minimum%20Window%20Substring) | 31.10% | Hard | |\n| 0077 | Combinations | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0077.%20Combinations) | 48.20% | Medium | |\n| 0078 | Subsets | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0078.%20Subsets) | 53.40% | Medium | |\n| 0079 | Word Search | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0079.%20Word%20Search) | 31.50% | Medium | |\n| 0080 | Remove Duplicates from Sorted Array II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II) | 40.60% | Medium | |\n| 0081 | Search in Rotated Sorted Array II | | 32.70% | Medium | |\n| 0082 | Remove Duplicates from Sorted List II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0082.%20Remove%20Duplicates%20from%20Sorted%20List%20II) | 33.30% | Medium | |\n| 0083 | Remove Duplicates from Sorted List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0083.%20Remove%20Duplicates%20from%20Sorted%20List) | 42.80% | Easy | |\n| 0084 | Largest Rectangle in Histogram | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0084.%20Largest%20Rectangle%20in%20Histogram) | 31.40% | Hard | |\n| 0085 | Maximal Rectangle | | 33.60% | Hard | |\n| 0086 | Partition List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0086.%20Partition%20List) | 37.60% | Medium | |\n| 0087 | Scramble String | | 31.70% | Hard | |\n| 0088 | Merge Sorted Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0088.%20Merge-Sorted-Array) | 36.00% | Easy | |\n| 0089 | Gray Code | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0089.%20Gray%20Code) | 46.00% | Medium | |\n| 0090 | Subsets II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0090.%20Subsets%20II) | 42.70% | Medium | |\n| 0091 | Decode Ways | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0091.%20Decode%20Ways) | 22.50% | Medium | |\n| 0092 | Reverse Linked List II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0092.%20Reverse%20Linked%20List%20II) | 35.20% | Medium | |\n| 0093 | Restore IP Addresses | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0093.%20Restore%20IP%20Addresses) | 31.70% | Medium | |\n| 0094 | Binary Tree Inorder Traversal | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0094.%20Binary%20Tree%20Inorder%20Traversal) | 57.10% | Medium | |\n| 0095 | Unique Binary Search Trees II |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0095.%20Unique%20Binary%20Search%20Trees%20II) | 36.00% | Medium | |\n| 0096 | Unique Binary Search Trees | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0096.%20Unique%20Binary%20Search%20Trees) | 46.60% | Medium | |\n| 0097 | Interleaving String | | 28.20% | Hard | |\n| 0098 | Validate Binary Search Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0098.%20Validate%20Binary%20Search%20Tree) | 25.90% | Medium | |\n| 0099 | Recover Binary Search Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0099.%20Recover%20Binary%20Search%20Tree) | 34.90% | Hard | |\n| 0100 | Same Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0100.%20Same%20Tree) | 50.20% | Easy | |\n| 0101 | Symmetric Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0101.%20Symmetric%20Tree) | 43.70% | Easy | |\n| 0102 | Binary Tree Level Order Traversal | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0102.%20Binary%20Tree%20Level%20Order%20Traversal) | 48.90% | Medium | |\n| 0103 | Binary Tree Zigzag Level Order Traversal | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal) | 42.10% | Medium | |\n| 0104 | Maximum Depth of Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0104.%20Maximum%20Depth%20of%20Binary%20Tree) | 60.90% | Easy | |\n| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | | 41.60% | Medium | |\n| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | | 39.70% | Medium | |\n| 0107 | Binary Tree Level Order Traversal II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0107.%20Binary%20Tree%20Level%20Order%20Traversal%20II) | 47.20% | Easy | |\n| 0108 | Convert Sorted Array to Binary Search Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree) | 51.20% | Easy | |\n| 0109 | Convert Sorted List to Binary Search Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree) | 41.20% | Medium | |\n| 0110 | Balanced Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0110.%20Balanced%20Binary%20Tree) | 41.20% | Easy | |\n| 0111 | Minimum Depth of Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0111.%20Minimum%20Depth%20of%20Binary%20Tree) | 35.40% | Easy | |\n| 0112 | Path Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0112.%20Path%20Sum) | 38.00% | Easy | |\n| 0113 | Path Sum II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0113.%20Path%20Sum%20II) | 41.00% | Medium | |\n| 0114 | Flatten Binary Tree to Linked List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0114.%20Flatten%20Binary%20Tree%20to%20Linked%20List) | 42.80% | Medium | |\n| 0115 | Distinct Subsequences | | 35.20% | Hard | |\n| 0116 | Populating Next Right Pointers in Each Node | | 38.20% | Medium | |\n| 0117 | Populating Next Right Pointers in Each Node II | | 34.70% | Medium | |\n| 0118 | Pascal's Triangle | | 46.50% | Easy | |\n| 0119 | Pascal's Triangle II | | 44.00% | Easy | |\n| 0120 | Triangle | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0120.%20Triangle) | 39.70% | Medium | |\n| 0121 | Best Time to Buy and Sell Stock | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock) | 47.50% | Easy | |\n| 0122 | Best Time to Buy and Sell Stock II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II) | 52.20% | Easy | |\n| 0123 | Best Time to Buy and Sell Stock III | | 33.90% | Hard | |\n| 0124 | Binary Tree Maximum Path Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0124.%20Binary%20Tree%20Maximum%20Path%20Sum) | 30.20% | Hard | |\n| 0125 | Valid Palindrome | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0125.%20Valid-Palindrome) | 31.40% | Easy | |\n| 0126 | Word Ladder II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0126.%20Word%20Ladder%20II) | 18.00% | Hard | |\n| 0127 | Word Ladder | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0127.%20Word%20Ladder) | 24.40% | Medium | |\n| 0128 | Longest Consecutive Sequence | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0128.%20Longest%20Consecutive%20Sequence) | 41.90% | Hard | |\n| 0129 | Sum Root to Leaf Numbers | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0129.%20Sum%20Root%20to%20Leaf%20Numbers) | 42.80% | Medium | |\n| 0130 | Surrounded Regions | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0130.%20Surrounded%20Regions) | 23.10% | Medium | |\n| 0131 | Palindrome Partitioning | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0131.%20Palindrome%20Partitioning) | 41.30% | Medium | |\n| 0132 | Palindrome Partitioning II | | 27.60% | Hard | |\n| 0133 | Clone Graph | | 27.00% | Medium | |\n| 0134 | Gas Station | | 34.10% | Medium | |\n| 0135 | Candy | | 28.60% | Hard | |\n| 0136 | Single Number |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0136.%20Single%20Number) | 60.50% | Easy | |\n| 0137 | Single Number II |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0137.%20Single%20Number%20II) | 46.20% | Medium | |\n| 0138 | Copy List with Random Pointer | | 27.50% | Medium | |\n| 0139 | Word Break | | 35.60% | Medium | |\n| 0140 | Word Break II | | 27.50% | Hard | |\n| 0141 | Linked List Cycle | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0141.%20Linked%20List%20Cycle) | 37.20% | Easy | |\n| 0142 | Linked List Cycle II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0142.%20Linked%20List%20Cycle%20II) | 32.40% | Medium | |\n| 0143 | Reorder List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0143.%20Reorder%20List) | 31.20% | Medium | |\n| 0144 | Binary Tree Preorder Traversal | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0144.%20Binary%20Tree%20Preorder%20Traversal) | 51.70% | Medium | |\n| 0145 | Binary Tree Postorder Traversal | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0145.%20Binary%20Tree%20Postorder%20Traversal) | 48.90% | Hard | |\n| 0146 | LRU Cache | | 25.90% | Medium | |\n| 0147 | Insertion Sort List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0147.%20Insertion%20Sort%20List) | 37.60% | Medium | |\n| 0148 | Sort List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0148.%20Sort%20List) | 35.80% | Medium | |\n| 0149 | Max Points on a Line | | 15.80% | Hard | |\n| 0150 | Evaluate Reverse Polish Notation | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0150.%20Evaluate%20Reverse%20Polish%20Notation) | 32.50% | Medium | |\n| 0151 | Reverse Words in a String | | 17.00% | Medium | |\n| 0152 | Maximum Product Subarray | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0152.%20Maximum%20Product%20Subarray) | 29.40% | Medium | |\n| 0153 | Find Minimum in Rotated Sorted Array | | 43.10% | Medium | |\n| 0154 | Find Minimum in Rotated Sorted Array II | | 39.40% | Hard | |\n| 0155 | Min Stack | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0155.%20Min%20Stack) | 37.50% | Easy | |\n| 0156 | Binary Tree Upside Down | | 51.10% | Medium | |\n| 0157 | Read N Characters Given Read4 | | 29.70% | Easy | |\n| 0158 | Read N Characters Given Read4 II - Call multiple times | | 26.60% | Hard | |\n| 0159 | Longest Substring with At Most Two Distinct Characters | | 47.20% | Hard | |\n| 0160 | Intersection of Two Linked Lists | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0160.%20Intersection%20of%20Two%20Linked%20Lists) | 34.30% | Easy | |\n| 0161 | One Edit Distance | | 31.70% | Medium | |\n| 0162 | Find Peak Element | | 41.40% | Medium | |\n| 0163 | Missing Ranges | | 23.30% | Medium | |\n| 0164 | Maximum Gap | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0164.%20Maximum%20Gap) | 32.70% | Hard | |\n| 0165 | Compare Version Numbers | | 23.80% | Medium | |\n| 0166 | Fraction to Recurring Decimal | | 19.60% | Medium | |\n| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted) | 50.60% | Easy | |\n| 0168 | Excel Sheet Column Title | | 29.10% | Easy | |\n| 0169 | Majority Element |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0169.%20Majority%20Element) | 53.00% | Easy | |\n| 0170 | Two Sum III - Data structure design | | 30.60% | Easy | |\n| 0171 | Excel Sheet Column Number | | 51.70% | Easy | |\n| 0172 | Factorial Trailing Zeroes | | 37.40% | Easy | |\n| 0173 | Binary Search Tree Iterator | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0173.%20Binary%20Search%20Tree%20Iterator) | 49.00% | Medium | |\n| 0174 | Dungeon Game | | 27.30% | Hard | |\n| 0175 | Combine Two Tables | | 52.40% | Easy | |\n| 0176 | Second Highest Salary | | 27.50% | Easy | |\n| 0177 | Nth Highest Salary | | 26.60% | Medium | |\n| 0178 | Rank Scores | | 37.10% | Medium | |\n| 0179 | Largest Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0179.%20Largest%20Number) | 26.00% | Medium | |\n| 0180 | Consecutive Numbers | | 34.00% | Medium | |\n| 0181 | Employees Earning More Than Their Managers | | 48.90% | Easy | |\n| 0182 | Duplicate Emails | | 55.20% | Easy | |\n| 0183 | Customers Who Never Order | | 45.40% | Easy | |\n| 0184 | Department Highest Salary | | 29.40% | Medium | |\n| 0185 | Department Top Three Salaries | | 26.50% | Hard | |\n| 0186 | Reverse Words in a String II | | 38.10% | Medium | |\n| 0187 | Repeated DNA Sequences |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0187.%20Repeated%20DNA%20Sequences) | 36.30% | Medium | |\n| 0188 | Best Time to Buy and Sell Stock IV | | 26.40% | Hard | |\n| 0189 | Rotate Array | | 30.50% | Easy | |\n| 0190 | Reverse Bits |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0190.%20Reverse%20Bits) | 31.70% | Easy | |\n| 0191 | Number of 1 Bits | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0191.%20Number%20of%201%20Bits) | 43.60% | Easy | |\n| 0192 | Word Frequency | | 26.80% | Medium | |\n| 0193 | Valid Phone Numbers | | 25.20% | Easy | |\n| 0194 | Transpose File | | 22.90% | Medium | |\n| 0195 | Tenth Line | | 33.90% | Easy | |\n| 0196 | Delete Duplicate Emails | | 33.40% | Easy | |\n| 0197 | Rising Temperature | | 35.10% | Easy | |\n| 0198 | House Robber | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0198.%20House%20Robber) | 41.10% | Easy | |\n| 0199 | Binary Tree Right Side View | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0199.%20Binary%20Tree%20Right%20Side%20View) | 48.30% | Medium | |\n| 0200 | Number of Islands | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0200.%20Number%20of%20Islands) | 41.90% | Medium | |\n| 0201 | Bitwise AND of Numbers Range |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0201.%20Bitwise%20AND%20of%20Numbers%20Range) | 36.10% | Medium | |\n| 0202 | Happy Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0202.%20Happy%20Number) | 45.60% | Easy | |\n| 0203 | Remove Linked List Elements | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0203.%20Remove%20Linked%20List%20Elements) | 35.90% | Easy | |\n| 0204 | Count Primes |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0204.%20Count%20Primes) | 29.20% | Easy | |\n| 0205 | Isomorphic Strings | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0205.%20Isomorphic%20Strings) | 37.60% | Easy | |\n| 0206 | Reverse Linked List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0206.%20Reverse-Linked-List) | 55.30% | Easy | |\n| 0207 | Course Schedule | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0207.%20Course%20Schedule) | 38.20% | Medium | |\n| 0208 | Implement Trie (Prefix Tree) | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0208.%20Implement%20Trie%20(Prefix%20Tree)) | 39.00% | Medium | |\n| 0209 | Minimum Size Subarray Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0209.%20Minimum%20Size%20Subarray%20Sum) | 35.10% | Medium | |\n| 0210 | Course Schedule II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0210.%20Course%20Schedule%20II) | 35.20% | Medium | |\n| 0211 | Add and Search Word - Data structure design | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design) | 30.70% | Medium | |\n| 0212 | Word Search II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0212.%20Word%20Search%20II) | 29.00% | Hard | |\n| 0213 | House Robber II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0213.%20House%20Robber%20II) | 35.40% | Medium | |\n| 0214 | Shortest Palindrome | | 27.70% | Hard | |\n| 0215 | Kth Largest Element in an Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0215.%20Kth%20Largest%20Element%20in%20an%20Array) | 48.30% | Medium | |\n| 0216 | Combination Sum III | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0216.%20Combination%20Sum%20III) | 51.90% | Medium | |\n| 0217 | Contains Duplicate | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0217.%20Contains%20Duplicate) | 52.30% | Easy | |\n| 0218 | The Skyline Problem | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0218.%20The%20Skyline%20Problem) | 31.80% | Hard | |\n| 0219 | Contains Duplicate II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0219.%20Contains%20Duplicate%20II) | 35.50% | Easy | |\n| 0220 | Contains Duplicate III | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III) | 19.80% | Medium | |\n| 0221 | Maximal Square | | 33.30% | Medium | |\n| 0222 | Count Complete Tree Nodes | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0222.%20Count%20Complete%20Tree%20Nodes) | 34.40% | Medium | |\n| 0223 | Rectangle Area | | 36.00% | Medium | |\n| 0224 | Basic Calculator | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0224.%20Basic%20Calculator) | 33.00% | Hard | |\n| 0225 | Implement Stack using Queues | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0225.%20Implement%20Stack%20using%20Queues) | 39.60% | Easy | |\n| 0226 | Invert Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0226.%20Invert%20Binary%20Tree) | 58.50% | Easy | |\n| 0227 | Basic Calculator II | | 33.70% | Medium | |\n| 0228 | Summary Ranges | | 36.20% | Medium | |\n| 0229 | Majority Element II |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0229.%20Majority%20Element%20II) | 32.30% | Medium | |\n| 0230 | Kth Smallest Element in a BST | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0230.%20Kth%20Smallest%20Element%20in%20a%20BST) | 51.90% | Medium | |\n| 0231 | Power of Two | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0231.%20Power%20of%20Two) | 42.10% | Easy | |\n| 0232 | Implement Queue using Stacks | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0232.%20Implement%20Queue%20using%20Stacks) | 43.70% | Easy | |\n| 0233 | Number of Digit One | | 30.30% | Hard | |\n| 0234 | Palindrome Linked List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0234.%20Palindrome%20Linked%20List) | 36.30% | Easy | |\n| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree) | 45.10% | Easy | |\n| 0236 | Lowest Common Ancestor of a Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree) | 37.90% | Medium | |\n| 0237 | Delete Node in a Linked List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0237.%20Delete%20Node%20in%20a%20Linked%20List) | 54.00% | Easy | |\n| 0238 | Product of Array Except Self | | 55.40% | Medium | |\n| 0239 | Sliding Window Maximum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0239.%20Sliding%20Window%20Maximum) | 38.40% | Hard | |\n| 0240 | Search a 2D Matrix II | | 41.00% | Medium | |\n| 0241 | Different Ways to Add Parentheses | | 50.30% | Medium | |\n| 0242 | Valid Anagram | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0242.%20Valid%20Anagram) | 52.50% | Easy | |\n| 0243 | Shortest Word Distance | | 57.60% | Easy | |\n| 0244 | Shortest Word Distance II | | 47.60% | Medium | |\n| 0245 | Shortest Word Distance III | | 53.60% | Medium | |\n| 0246 | Strobogrammatic Number | | 42.40% | Easy | |\n| 0247 | Strobogrammatic Number II | | 44.60% | Medium | |\n| 0248 | Strobogrammatic Number III | | 36.70% | Hard | |\n| 0249 | Group Shifted Strings | | 49.10% | Medium | |\n| 0250 | Count Univalue Subtrees | | 49.10% | Medium | |\n| 0251 | Flatten 2D Vector | | 43.90% | Medium | |\n| 0252 | Meeting Rooms | | 52.30% | Easy | |\n| 0253 | Meeting Rooms II | | 43.10% | Medium | |\n| 0254 | Factor Combinations | | 44.50% | Medium | |\n| 0255 | Verify Preorder Sequence in Binary Search Tree | | 43.70% | Medium | |\n| 0256 | Paint House | | 49.10% | Easy | |\n| 0257 | Binary Tree Paths | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0257.%20Binary%20Tree%20Paths) | 46.30% | Easy | |\n| 0258 | Add Digits | | 54.30% | Easy | |\n| 0259 | 3Sum Smaller | | 45.10% | Medium | |\n| 0260 | Single Number III |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0260.%20Single%20Number%20III) | 57.30% | Medium | |\n| 0261 | Graph Valid Tree | | 40.00% | Medium | |\n| 0262 | Trips and Users | | 25.40% | Hard | |\n| 0263 | Ugly Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0263.%20Ugly%20Number) | 40.70% | Easy | |\n| 0264 | Ugly Number II | | 36.60% | Medium | |\n| 0265 | Paint House II | | 41.70% | Hard | |\n| 0266 | Palindrome Permutation | | 60.20% | Easy | |\n| 0267 | Palindrome Permutation II | | 33.90% | Medium | |\n| 0268 | Missing Number |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0268.%20Missing%20Number) | 48.60% | Easy | |\n| 0269 | Alien Dictionary | | 31.30% | Hard | |\n| 0270 | Closest Binary Search Tree Value | | 44.00% | Easy | |\n| 0271 | Encode and Decode Strings | | 27.00% | Medium | |\n| 0272 | Closest Binary Search Tree Value II | | 45.40% | Hard | |\n| 0273 | Integer to English Words | | 24.50% | Hard | |\n| 0274 | H-Index | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0274.%20H-Index) | 34.70% | Medium | |\n| 0275 | H-Index II | | 35.50% | Medium | |\n| 0276 | Paint Fence | | 36.60% | Easy | |\n| 0277 | Find the Celebrity | | 37.10% | Medium | |\n| 0278 | First Bad Version | | 30.30% | Easy | |\n| 0279 | Perfect Squares | | 42.30% | Medium | |\n| 0280 | Wiggle Sort | | 61.20% | Medium | |\n| 0281 | Zigzag Iterator | | 56.10% | Medium | |\n| 0282 | Expression Add Operators | | 32.90% | Hard | |\n| 0283 | Move Zeroes | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0283.%20Move%20Zeroes) | 54.50% | Easy | |\n| 0284 | Peeking Iterator | | 40.90% | Medium | |\n| 0285 | Inorder Successor in BST | | 35.10% | Medium | |\n| 0286 | Walls and Gates | | 49.80% | Medium | |\n| 0287 | Find the Duplicate Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0287.%20Find%20the%20Duplicate%20Number) | 50.00% | Medium | |\n| 0288 | Unique Word Abbreviation | | 20.10% | Medium | |\n| 0289 | Game of Life | | 45.90% | Medium | |\n| 0290 | Word Pattern | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0290.%20Word%20Pattern) | 35.20% | Easy | |\n| 0291 | Word Pattern II | | 41.10% | Hard | |\n| 0292 | Nim Game | | 55.70% | Easy | |\n| 0293 | Flip Game | | 59.00% | Easy | |\n| 0294 | Flip Game II | | 48.40% | Medium | |\n| 0295 | Find Median from Data Stream | | 37.10% | Hard | |\n| 0296 | Best Meeting Point | | 55.00% | Hard | |\n| 0297 | Serialize and Deserialize Binary Tree | | 41.30% | Hard | |\n| 0298 | Binary Tree Longest Consecutive Sequence | | 44.20% | Medium | |\n| 0299 | Bulls and Cows | | 39.70% | Medium | |\n| 0300 | Longest Increasing Subsequence | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0300.%20Longest%20Increasing%20Subsequence) | 41.00% | Medium | |\n| 0301 | Remove Invalid Parentheses | | 39.50% | Hard | |\n| 0302 | Smallest Rectangle Enclosing Black Pixels | | 49.40% | Hard | |\n| 0303 | Range Sum Query - Immutable | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0303.%20Range%20Sum%20Query%20-%20Immutable) | 38.40% | Easy | |\n| 0304 | Range Sum Query 2D - Immutable | | 32.70% | Medium | |\n| 0305 | Number of Islands II | | 41.70% | Hard | |\n| 0306 | Additive Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0306.%20Additive%20Number) | 28.40% | Medium | |\n| 0307 | Range Sum Query - Mutable | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0307.%20Range%20Sum%20Query%20-%20Mutable) | 29.00% | Medium | |\n| 0308 | Range Sum Query 2D - Mutable | | 32.20% | Hard | |\n| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown) | 44.20% | Medium | |\n| 0310 | Minimum Height Trees | | 30.30% | Medium | |\n| 0311 | Sparse Matrix Multiplication | | 56.70% | Medium | |\n| 0312 | Burst Balloons | | 47.50% | Hard | |\n| 0313 | Super Ugly Number | | 41.70% | Medium | |\n| 0314 | Binary Tree Vertical Order Traversal | | 41.20% | Medium | |\n| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0315.%20Count%20of%20Smaller%20Numbers%20After%20Self) | 38.40% | Hard | |\n| 0316 | Remove Duplicate Letters | | 32.80% | Hard | |\n| 0317 | Shortest Distance from All Buildings | | 38.10% | Hard | |\n| 0318 | Maximum Product of Word Lengths |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0318.%20Maximum%20Product%20of%20Word%20Lengths) | 48.70% | Medium | |\n| 0319 | Bulb Switcher | | 44.00% | Medium | |\n| 0320 | Generalized Abbreviation | | 48.90% | Medium | |\n| 0321 | Create Maximum Number | | 25.50% | Hard | |\n| 0322 | Coin Change | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0322.%20Coin%20Change) | 30.80% | Medium | |\n| 0323 | Number of Connected Components in an Undirected Graph | | 52.30% | Medium | |\n| 0324 | Wiggle Sort II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II) | 28.10% | Medium | |\n| 0325 | Maximum Size Subarray Sum Equals k | | 44.80% | Medium | |\n| 0326 | Power of Three | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0326.%20Power%20of%20Three) | 41.70% | Easy | |\n| 0327 | Count of Range Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0327.%20Count%20of%20Range%20Sum) | 32.90% | Hard | |\n| 0328 | Odd Even Linked List | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0328.%20Odd%20Even%20Linked%20List) | 49.50% | Medium | |\n| 0329 | Longest Increasing Path in a Matrix | | 40.30% | Hard | |\n| 0330 | Patching Array | | 33.40% | Hard | |\n| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0331.%20Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree) | 38.80% | Medium | |\n| 0332 | Reconstruct Itinerary | | 31.70% | Medium | |\n| 0333 | Largest BST Subtree | | 33.20% | Medium | |\n| 0334 | Increasing Triplet Subsequence | | 39.60% | Medium | |\n| 0335 | Self Crossing | | 27.00% | Hard | |\n| 0336 | Palindrome Pairs | | 31.10% | Hard | |\n| 0337 | House Robber III | | 48.30% | Medium | |\n| 0338 | Counting Bits | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0338.%20Counting%20Bits) | 64.90% | Medium | |\n| 0339 | Nested List Weight Sum | | 68.50% | Easy | |\n| 0340 | Longest Substring with At Most K Distinct Characters | | 40.00% | Hard | |\n| 0341 | Flatten Nested List Iterator | | 48.20% | Medium | |\n| 0342 | Power of Four | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0342.%20Power%20of%20Four) | 40.40% | Easy | |\n| 0343 | Integer Break | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0343.%20Integer%20Break) | 48.00% | Medium | |\n| 0344 | Reverse String | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0344.%20Reverse%20String) | 63.50% | Easy | |\n| 0345 | Reverse Vowels of a String | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0345.%20Reverse%20Vowels%20of%20a%20String) | 41.70% | Easy | |\n| 0346 | Moving Average from Data Stream | | 66.50% | Easy | |\n| 0347 | Top K Frequent Elements | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0347.%20Top%20K%20Frequent%20Elements) | 55.30% | Medium | |\n| 0348 | Design Tic-Tac-Toe | | 50.00% | Medium | |\n| 0349 | Intersection of Two Arrays | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0349.%20Intersection%20of%20Two%20Arrays) | 55.10% | Easy | |\n| 0350 | Intersection of Two Arrays II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0350.%20Intersection%20of%20Two%20Arrays%20II) | 48.10% | Easy | |\n| 0351 | Android Unlock Patterns | | 46.00% | Medium | |\n| 0352 | Data Stream as Disjoint Intervals | | 43.70% | Hard | |\n| 0353 | Design Snake Game | | 30.80% | Medium | |\n| 0354 | Russian Doll Envelopes | | 34.10% | Hard | |\n| 0355 | Design Twitter | | 27.50% | Medium | |\n| 0356 | Line Reflection | | 30.90% | Medium | |\n| 0357 | Count Numbers with Unique Digits | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0357.%20Count%20Numbers%20with%20Unique%20Digits) | 47.10% | Medium | |\n| 0358 | Rearrange String k Distance Apart | | 32.90% | Hard | |\n| 0359 | Logger Rate Limiter | | 65.40% | Easy | |\n| 0360 | Sort Transformed Array | | 46.90% | Medium | |\n| 0361 | Bomb Enemy | | 43.60% | Medium | |\n| 0362 | Design Hit Counter | | 59.20% | Medium | |\n| 0363 | Max Sum of Rectangle No Larger Than K | | 35.30% | Hard | |\n| 0364 | Nested List Weight Sum II | | 58.00% | Medium | |\n| 0365 | Water and Jug Problem | | 29.00% | Medium | |\n| 0366 | Find Leaves of Binary Tree | | 66.00% | Medium | |\n| 0367 | Valid Perfect Square | | 40.00% | Easy | |\n| 0368 | Largest Divisible Subset | | 34.90% | Medium | |\n| 0369 | Plus One Linked List | | 56.40% | Medium | |\n| 0370 | Range Addition | | 60.60% | Medium | |\n| 0371 | Sum of Two Integers |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0371.%20Sum%20of%20Two%20Integers) | 50.90% | Easy | |\n| 0372 | Super Pow | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0372.%20Super%20Pow) | 35.70% | Medium | |\n| 0373 | Find K Pairs with Smallest Sums | | 34.00% | Medium | |\n| 0374 | Guess Number Higher or Lower | | 39.60% | Easy | |\n| 0375 | Guess Number Higher or Lower II | | 37.80% | Medium | |\n| 0376 | Wiggle Subsequence | | 37.60% | Medium | |\n| 0377 | Combination Sum IV | | 43.70% | Medium | |\n| 0378 | Kth Smallest Element in a Sorted Matrix | | 49.70% | Medium | |\n| 0379 | Design Phone Directory | | 41.70% | Medium | |\n| 0380 | Insert Delete GetRandom O(1) | | 43.00% | Medium | |\n| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | | 32.10% | Hard | |\n| 0382 | Linked List Random Node | | 49.40% | Medium | |\n| 0383 | Ransom Note | | 50.10% | Easy | |\n| 0384 | Shuffle an Array | | 50.30% | Medium | |\n| 0385 | Mini Parser | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0385.%20Mini%20Parser) | 31.90% | Medium | |\n| 0386 | Lexicographical Numbers | | 46.50% | Medium | |\n| 0387 | First Unique Character in a String |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0387.%20First%20Unique%20Character%20in%20a%20String) | 50.20% | Easy | |\n| 0388 | Longest Absolute File Path | | 39.30% | Medium | |\n| 0389 | Find the Difference |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0389.%20Find%20the%20Difference) | 53.20% | Easy | |\n| 0390 | Elimination Game | | 43.40% | Medium | |\n| 0391 | Perfect Rectangle | | 28.30% | Hard | |\n| 0392 | Is Subsequence | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0392.%20Is%20Subsequence) | 46.90% | Medium | |\n| 0393 | UTF-8 Validation |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0393.%20UTF-8%20Validation) | 36.00% | Medium | |\n| 0394 | Decode String |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0394.%20Decode%20String) | 45.20% | Medium | |\n| 0395 | Longest Substring with At Least K Repeating Characters | | 38.80% | Medium | |\n| 0396 | Rotate Function | | 35.20% | Medium | |\n| 0397 | Integer Replacement |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0397.%20Integer%20Replacement) | 31.50% | Medium | |\n| 0398 | Random Pick Index | | 50.20% | Medium | |\n| 0399 | Evaluate Division | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0399.%20Evaluate%20Division) | 47.80% | Medium | |\n| 0400 | Nth Digit | | 30.40% | Easy | |\n| 0401 | Binary Watch | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0401.%20Binary%20Watch) | 45.40% | Easy | |\n| 0402 | Remove K Digits | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0402.%20Remove%20K%20Digits) | 26.70% | Medium | |\n| 0403 | Frog Jump | | 36.40% | Hard | |\n| 0404 | Sum of Left Leaves | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0404.%20Sum%20of%20Left%20Leaves) | 49.20% | Easy | |\n| 0405 | Convert a Number to Hexadecimal |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0405.%20Convert%20a%20Number%20to%20Hexadecimal) | 42.00% | Easy | |\n| 0406 | Queue Reconstruction by Height | | 60.10% | Medium | |\n| 0407 | Trapping Rain Water II | | 39.40% | Hard | |\n| 0408 | Valid Word Abbreviation | | 29.60% | Easy | |\n| 0409 | Longest Palindrome |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0409.%20Longest%20Palindrome) | 48.20% | Easy | |\n| 0410 | Split Array Largest Sum | | 42.60% | Hard | |\n| 0411 | Minimum Unique Word Abbreviation | | 35.10% | Hard | |\n| 0412 | Fizz Buzz | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0412.%20Fizz%20Buzz) | 59.70% | Easy | |\n| 0413 | Arithmetic Slices | | 56.00% | Medium | |\n| 0414 | Third Maximum Number |\n[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0414.%20Third%20Maximum%20Number) | 29.10% | Easy | |\n| 0415 | Add Strings | | 43.90% | Easy | |\n| 0416 | Partition Equal Subset Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0416.%20Partition%20Equal%20Subset%20Sum) | 40.90% | Medium | |\n| 0417 | Pacific Atlantic Water Flow | | 37.60% | Medium | |\n| 0418 | Sentence Screen Fitting | | 31.20% | Medium | |\n| 0419 | Battleships in a Board | | 65.90% | Medium | |\n| 0420 | Strong Password Checker | | 17.20% | Hard | |\n| 0421 | Maximum XOR of Two Numbers in an Array |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0421.%20Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array) | 51.20% | Medium | |\n| 0422 | Valid Word Square | | 36.60% | Easy | |\n| 0423 | Reconstruct Original Digits from English | | 45.70% | Medium | |\n| 0424 | Longest Repeating Character Replacement | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0424.%20Longest%20Repeating%20Character%20Replacement) | 44.30% | Medium | |\n| 0425 | Word Squares | | 44.50% | Hard | |\n| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | | 52.50% | Medium | |\n| 0427 | Construct Quad Tree | | 57.20% | Medium | |\n| 0428 | Serialize and Deserialize N-ary Tree | | 54.20% | Hard | |\n| 0429 | N-ary Tree Level Order Traversal | | 59.80% | Easy | |\n| 0430 | Flatten a Multilevel Doubly Linked List | | 42.60% | Medium | |\n| 0431 | Encode N-ary Tree to Binary Tree | | 64.20% | Hard | |\n| 0432 | All O`one Data Structure | | 29.70% | Hard | |\n| 0433 | Minimum Genetic Mutation | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0433.%20Minimum%20Genetic%20Mutation) | 38.40% | Medium | |\n| 0434 | Number of Segments in a String | | 37.00% | Easy | |\n| 0435 | Non-overlapping Intervals | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0435.%20Non-overlapping%20Intervals) | 41.60% | Medium | |\n| 0436 | Find Right Interval | | 42.90% | Medium | |\n| 0437 | Path Sum III | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0437.%20Path%20Sum%20III) | 43.00% | Easy | |\n| 0438 | Find All Anagrams in a String | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0438.%20Find%20All%20Anagrams%20in%20a%20String) | 37.50% | Easy | |\n| 0439 | Ternary Expression Parser | | 53.70% | Medium | |\n| 0440 | K-th Smallest in Lexicographical Order | | 26.60% | Hard | |\n| 0441 | Arranging Coins |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0441.%20Arranging%20Coins) | 38.10% | Easy | |\n| 0442 | Find All Duplicates in an Array | | 61.30% | Medium | |\n| 0443 | String Compression | | 37.90% | Easy | |\n| 0444 | Sequence Reconstruction | | 20.50% | Medium | |\n| 0445 | Add Two Numbers II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0445.%20Add%20Two%20Numbers%20II) | 50.40% | Medium | |\n| 0446 | Arithmetic Slices II - Subsequence | | 30.30% | Hard | |\n| 0447 | Number of Boomerangs | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0447.%20Number%20of%20Boomerangs) | 50.00% | Easy | |\n| 0448 | Find All Numbers Disappeared in an Array | | 53.60% | Easy | |\n| 0449 | Serialize and Deserialize BST | | 47.50% | Medium | |\n| 0450 | Delete Node in a BST | | 40.20% | Medium | |\n| 0451 | Sort Characters By Frequency | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0451.%20Sort%20Characters%20By%20Frequency) | 56.40% | Medium | |\n| 0452 | Minimum Number of Arrows to Burst Balloons | | 46.60% | Medium | |\n| 0453 | Minimum Moves to Equal Array Elements | | 49.30% | Easy | |\n| 0454 | 4Sum II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0454.%204Sum%20II) | 50.80% | Medium | |\n| 0455 | Assign Cookies | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0455.%20Assign%20Cookies) | 48.50% | Easy | |\n| 0456 | 132 Pattern | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0456.%20132%20Pattern) | 27.40% | Medium | |\n| 0457 | Circular Array Loop |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0457.%20Circular%20Array%20Loop) | 27.70% | Medium | |\n| 0458 | Poor Pigs | | 45.50% | Hard | |\n| 0459 | Repeated Substring Pattern | | 40.00% | Easy | |\n| 0460 | LFU Cache | | 29.00% | Hard | |\n| 0461 | Hamming Distance |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0461.%20Hamming%20Distance) | 70.40% | Easy | |\n| 0462 | Minimum Moves to Equal Array Elements II | | 52.50% | Medium | |\n| 0463 | Island Perimeter |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0463.%20Island%20Perimeter) | 61.20% | Easy | |\n| 0464 | Can I Win | | 27.30% | Medium | |\n| 0465 | Optimal Account Balancing | | 42.90% | Hard | |\n| 0466 | Count The Repetitions | | 27.30% | Hard | |\n| 0467 | Unique Substrings in Wraparound String | | 34.10% | Medium | |\n| 0468 | Validate IP Address | | 21.40% | Medium | |\n| 0469 | Convex Polygon | | 35.50% | Medium | |\n| 0470 | Implement Rand10() Using Rand7() | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0470.%20Implement%20Rand10()%20Using%20Rand7()) | 45.10% | Medium | |\n| 0471 | Encode String with Shortest Length | | 45.20% | Hard | |\n| 0472 | Concatenated Words | | 35.10% | Hard | |\n| 0473 | Matchsticks to Square | | 36.00% | Medium | |\n| 0474 | Ones and Zeroes | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0474.%20Ones%20and%20Zeroes) | 39.80% | Medium | |\n| 0475 | Heaters | | 31.90% | Easy | |\n| 0476 | Number Complement |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0476.%20Number%20Complement) | 62.50% | Easy | |\n| 0477 | Total Hamming Distance |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0477.%20Total%20Hamming%20Distance) | 49.00% | Medium | |\n| 0478 | Generate Random Point in a Circle | | 36.90% | Medium | |\n| 0479 | Largest Palindrome Product | | 27.50% | Hard | |\n| 0480 | Sliding Window Median | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0480.%20Sliding%20Window%20Median) | 32.80% | Hard | |\n| 0481 | Magical String | | 46.30% | Medium | |\n| 0482 | License Key Formatting | | 41.10% | Easy | |\n| 0483 | Smallest Good Base | | 34.20% | Hard | |\n| 0484 | Find Permutation | | 57.80% | Medium | |\n| 0485 | Max Consecutive Ones | | 55.10% | Easy | |\n| 0486 | Predict the Winner | | 46.80% | Medium | |\n| 0487 | Max Consecutive Ones II | | 46.70% | Medium | |\n| 0488 | Zuma Game | | 39.10% | Hard | |\n| 0489 | Robot Room Cleaner | | 64.70% | Hard | |\n| 0490 | The Maze | | 47.60% | Medium | |\n| 0491 | Increasing Subsequences | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0491.%20Increasing%20Subsequences) | 42.20% | Medium | |\n| 0492 | Construct the Rectangle | | 48.80% | Easy | |\n| 0493 | Reverse Pairs | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0493.%20Reverse%20Pairs) | 23.30% | Hard | |\n| 0494 | Target Sum | | 45.40% | Medium | |\n| 0495 | Teemo Attacking | | 52.30% | Medium | |\n| 0496 | Next Greater Element I | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0496.%20Next%20Greater%20Element%20I) | 59.80% | Easy | |\n| 0497 | Random Point in Non-overlapping Rectangles | | 35.90% | Medium | |\n| 0498 | Diagonal Traverse | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0498.%20Diagonal%20Traverse) | 45.40% | Medium | |\n| 0499 | The Maze III | | 37.40% | Hard | |\n| 0500 | Keyboard Row |[Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0500.%20Keyboard%20Row) | 62.40% | Easy | |\n| 0501 | Find Mode in Binary Search Tree | | 39.60% | Easy | |\n| 0502 | IPO | | 38.00% | Hard | |\n| 0503 | Next Greater Element II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0503.%20Next%20Greater%20Element%20II) | 51.30% | Medium | |\n| 0504 | Base 7 | | 45.00% | Easy | |\n| 0505 | The Maze II | | 44.10% | Medium | |\n| 0506 | Relative Ranks | | 48.40% | Easy | |\n| 0507 | Perfect Number | | 34.40% | Easy | |\n| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0508.%20Most%20Frequent%20Subtree%20Sum) | 54.80% | Medium | |\n| 0509 | Fibonacci Number | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0509.%20Fibonacci%20Number) | 66.70% | Easy | |\n| 0510 | Inorder Successor in BST II | | 53.30% | Medium | |\n| 0511 | Game Play Analysis I | | 74.40% | Easy | |\n| 0512 | Game Play Analysis II | | 56.80% | Easy | |\n| 0513 | Find Bottom Left Tree Value | | 58.60% | Medium | |\n| 0514 | Freedom Trail | | 40.70% | Hard | |\n| 0515 | Find Largest Value in Each Tree Row | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row) | 58.00% | Medium | |\n| 0516 | Longest Palindromic Subsequence | | 47.10% | Medium | |\n| 0517 | Super Washing Machines | | 37.00% | Hard | |\n| 0518 | Coin Change 2 | | 43.10% | Medium | |\n| 0519 | Random Flip Matrix | | 33.00% | Medium | |\n| 0520 | Detect Capital | | 52.60% | Easy | |\n| 0521 | Longest Uncommon Subsequence I | | 56.50% | Easy | |\n| 0522 | Longest Uncommon Subsequence II | | 32.90% | Medium | |\n| 0523 | Continuous Subarray Sum | | 24.20% | Medium | |\n| 0524 | Longest Word in Dictionary through Deleting | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0524.%20Longest%20Word%20in%20Dictionary%20through%20Deleting) | 46.00% | Medium | |\n| 0525 | Contiguous Array | | 42.80% | Medium | |\n| 0526 | Beautiful Arrangement | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0526.%20Beautiful%20Arrangement) | 54.80% | Medium | |\n| 0527 | Word Abbreviation | | 50.20% | Hard | |\n| 0528 | Random Pick with Weight | | 42.80% | Medium | |\n| 0529 | Minesweeper | | 53.10% | Medium | |\n| 0530 | Minimum Absolute Difference in BST | | 50.70% | Easy | |\n| 0531 | Lonely Pixel I | | 57.60% | Medium | |\n| 0532 | K-diff Pairs in an Array | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0532.%20K-diff%20Pairs%20in%20an%20Array) | 30.00% | Easy | |\n| 0533 | Lonely Pixel II | | 46.20% | Medium | |\n| 0534 | Game Play Analysis III | | 64.60% | Medium | |\n| 0535 | Encode and Decode TinyURL | | 76.90% | Medium | |\n| 0536 | Construct Binary Tree from String | | 45.20% | Medium | |\n| 0537 | Complex Number Multiplication | | 65.70% | Medium | |\n| 0538 | Convert BST to Greater Tree | | 51.30% | Easy | |\n| 0539 | Minimum Time Difference | | 48.10% | Medium | |\n| 0540 | Single Element in a Sorted Array | | 57.40% | Medium | |\n| 0541 | Reverse String II | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0541.%20Reverse%20String%20II) | 45.70% | Easy | |\n| 0542 | 01 Matrix | [Go](https://github.com/KeKe-Li/go-structures-algorithm/tree/master/Algorithms/0542.%2001%20Matrix) | 36.00% | Medium | |\n| 0543 | Diameter of Binary Tree | | 46.90% | Easy | |\n| 0544 | Output Contest Matches | | 73.50% | Medium | |\n| 0545 | B\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeke-li%2Fgo-structures-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkeke-li%2Fgo-structures-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeke-li%2Fgo-structures-algorithm/lists"}