剑指 Offer II 069 | 山峰数组的顶部 | Go | 71.2% | easy | Array, Binary Search |

剑指 Offer II 024 | 反转链表 | Go | 75.5% | easy | Recursion, Linked List |

剑指 Offer II 023 | 两个链表的第一个重合节点 | Go | 69.9% | easy | Hash Table, Linked List, Two Pointers |

剑指 Offer II 022 | 链表中环的入口节点 | Go | 55.2% | medium | Hash Table, Linked List, Two Pointers |

剑指 Offer II 021 | 删除链表的倒数第 n 个结点 | Go | 52.6% | medium | Linked List, Two Pointers |

剑指 Offer II 020 | 回文子字符串的个数 | Go | 71.9% | medium | String, Dynamic Programming |

剑指 Offer II 019 | 最多删除一个字符得到回文 | Go | 45.7% | easy | Greedy, Two Pointers, String |

剑指 Offer II 018 | 有效的回文 | Go | 51.5% | easy | Two Pointers, String |

剑指 Offer II 017 | 含有所有字符的最短字符串 | Go | 50.3% | hard | Hash Table, String, Sliding Window |

剑指 Offer II 016 | 不含重复字符的最长子字符串 | Go | 47.6% | medium | Hash Table, String, Sliding Window |

剑指 Offer II 015 | 字符串中的所有变位词 | Go | 61.9% | medium | Hash Table, String, Sliding Window |

剑指 Offer II 014 | 字符串中的变位词 | Go | 51.3% | medium | Hash Table, Two Pointers, String, Sliding Window |

剑指 Offer II 013 | 二维子矩阵的和 | Go | 66.0% | medium | Design, Array, Matrix, Prefix Sum |

剑指 Offer II 012 | 左右两边子数组的和相等 | Go | 66.9% | easy | Array, Prefix Sum |

剑指 Offer II 011 | 0 和 1 个数相同的子数组 | Go | 55.7% | medium | Array, Hash Table, Prefix Sum |

剑指 Offer II 010 | 和为 k 的子数组 | Go | 43.5% | medium | Array, Hash Table, Prefix Sum |

剑指 Offer II 009 | 乘积小于 K 的子数组 | Go | 53.7% | medium | Array, Sliding Window |

剑指 Offer II 008 | 和大于等于 target 的最短子数组 | Go | 48.9% | medium | Array, Binary Search, Prefix Sum, Sliding Window |

剑指 Offer II 007 | 数组中和为 0 的三个数 | Go | 44.2% | medium | Array, Two Pointers, Sorting |

剑指 Offer II 006 | 排序数组中两个数字之和 | Go | 64.2% | easy | Array, Two Pointers, Binary Search |

剑指 Offer II 005 | 单词长度的最大乘积 | Go | 70.7% | medium | Bit Manipulation, Array, String |

剑指 Offer II 004 | 只出现一次的数字 | Go | 70.8% | medium | Bit Manipulation, Array |

剑指 Offer II 002 | 二进制加法 | Go | 55.4% | easy | Bit Manipulation, Math, String, Simulation |

剑指 Offer II 003 | 前 n 个数字二进制中 1 的个数 | Go | 78.6% | easy | Bit Manipulation, Dynamic Programming |

剑指 Offer II 001 | 整数除法 | Go | 20.9% | easy | Bit Manipulation, Math |

剑指 Offer 68 - II | 二叉树的最近公共祖先 LCOF | Go | 70.3% | easy | Tree, Depth-First Search, Binary Tree |

剑指 Offer 68 - I | 二叉搜索树的最近公共祖先 LCOF | Python3 | 69.5% | easy | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

剑指 Offer 64 | 求1+2+…+n LCOF | Go | 85.9% | medium | Bit Manipulation, Recursion, Brainteaser |

剑指 Offer 63 | 股票的最大利润 LCOF | Go | 63.5% | medium | Array, Dynamic Programming |

剑指 Offer 62 | 圆圈中最后剩下的数字 LCOF | Go | 65.8% | easy | Recursion, Math |

剑指 Offer 55 - II | 平衡二叉树 LCOF | Go | 59.4% | easy | Tree, Depth-First Search, Binary Tree |

剑指 Offer 61 | 扑克牌中的顺子 LCOF | Go | 46.0% | easy | Array, Sorting |

剑指 Offer 67 | 把字符串转换成整数 LCOF | Python3 | 29.0% | medium | String |

剑指 Offer 66 | 构建乘积数组 LCOF | Go | 60.0% | medium | Array, Prefix Sum |

剑指 Offer 59 - II | 队列的最大值 LCOF | Go | 47.7% | medium | Design, Queue, Monotonic Queue |

剑指 Offer 59 - I | 滑动窗口的最大值 LCOF | Go | 44.6% | hard | Queue, Sliding Window, Monotonic Queue, Heap (Priority Queue) |

剑指 Offer 65 | 不用加减乘除做加法 LCOF | Go | 59.2% | easy | Bit Manipulation, Math |

剑指 Offer 54 | 二叉搜索树的第k大节点 LCOF | Go | 76.2% | easy | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

剑指 Offer 48 | 最长不含重复字符的子字符串 LCOF | Go | 46.4% | medium | Hash Table, String, Sliding Window |

剑指 Offer 53 - II | 缺失的数字 LCOF | Rust | 44.7% | easy | Bit Manipulation, Array, Hash Table, Math, Binary Search |

剑指 Offer 58 - II | 左旋转字符串 LCOF | Go, Rust | 86.0% | easy | Math, Two Pointers, String |

剑指 Offer 53 - I | 在排序数组中查找数字 LCOF | Go, Rust | 53.1% | easy | Array, Binary Search |

剑指 Offer 58 - I | 翻转单词顺序 LCOF | Python3 | 44.5% | easy | Two Pointers, String |

剑指 Offer 47 | 礼物的最大价值 LCOF | Go | 69.1% | medium | Array, Dynamic Programming, Matrix |

剑指 Offer 52 | 两个链表的第一个公共节点 LCOF | Go | 65.5% | easy | Hash Table, Linked List, Two Pointers |

剑指 Offer 46 | 把数字翻译成字符串 LCOF | Go | 52.3% | medium | String, Dynamic Programming |

剑指 Offer 57 - II | 和为s的连续正数序列 LCOF | Go | 71.0% | easy | Math, Two Pointers, Enumeration |

剑指 Offer 45 | 把数组排成最小的数 LCOF | Go | 55.6% | medium | Greedy, String, Sorting |

剑指 Offer 57 | 和为s的两个数字 LCOF | Go | 67.7% | easy | Array, Two Pointers, Binary Search |

剑指 Offer 56 - II | 数组中数字出现的次数 II LCOF | Python3 | 80.5% | medium | Bit Manipulation, Array |

剑指 Offer 56 - I | 数组中数字出现的次数 LCOF | Go | 69.3% | medium | Bit Manipulation, Array |

剑指 Offer 55 - I | 二叉树的深度 LCOF | Go | 79.2% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

剑指 Offer 34 | 二叉树中和为某一值的路径 LCOF | Python3 | 58.5% | medium | Tree, Depth-First Search, Backtracking, Binary Tree |

剑指 Offer 50 | 第一个只出现一次的字符 LCOF | Go, Rust | 62.1% | easy | Queue, Hash Table, String, Counting |

剑指 Offer 33 | 二叉搜索树的后序遍历序列 LCOF | Go | 56.0% | medium | Stack, Tree, Binary Search Tree, Recursion, Binary Tree, Monotonic Stack |

剑指 Offer 32 - III | 从上到下打印二叉树 III LCOF | Go | 58.7% | medium | Tree, Breadth-First Search, Binary Tree |

剑指 Offer 32 - II | 从上到下打印二叉树 II LCOF | Go | 68.8% | easy | Tree, Breadth-First Search, Binary Tree |

剑指 Offer 32 - I | 从上到下打印二叉树 LCOF | Go | 63.8% | medium | Tree, Breadth-First Search, Binary Tree |

剑指 Offer 39 | 数组中出现次数超过一半的数字 LCOF | Go | 69.9% | easy | Array, Hash Table, Divide and Conquer, Counting, Sorting |

剑指 Offer 38 | 字符串的排列 LCOF | Go | 58.0% | medium | String, Backtracking |

剑指 Offer 37 | 序列化二叉树 LCOF | Java | 56.8% | hard | Tree, Depth-First Search, Breadth-First Search, Design, String, Binary Tree |

剑指 Offer 31 | 栈的压入、弹出序列 LCOF | Go | 61.9% | medium | Stack, Array, Simulation |

剑指 Offer 36 | 二叉搜索树与双向链表 LCOF | Python3 | 65.2% | medium | Stack, Tree, Depth-First Search, Binary Search Tree, Linked List, Binary Tree, Doubly-Linked List |

剑指 Offer 42 | 连续子数组的最大和 LCOF | Go | 60.7% | easy | Array, Divide and Conquer, Dynamic Programming |

剑指 Offer 41 | 数据流中的中位数 LCOF | Go | 58.4% | hard | Design, Two Pointers, Data Stream, Sorting, Heap (Priority Queue) |

剑指 Offer 30 | 包含min函数的栈 LCOF | Rust | 55.2% | easy | Stack, Design |

剑指 Offer 40 | 最小的k个数 LCOF | Go | 57.3% | easy | Array, Divide and Conquer, Quickselect, Sorting, Heap (Priority Queue) |

剑指 Offer 35 | 复杂链表的复制 LCOF | Go | 71.6% | medium | Hash Table, Linked List |

剑指 Offer 18 | 删除链表的节点 LCOF | Go | 60.1% | easy | Linked List |

剑指 Offer 24 | 反转链表 LCOF | Rust | 74.3% | easy | Recursion, Linked List |

剑指 Offer 16 | 数值的整数次方 LCOF | Go | 34.5% | medium | Recursion, Math |

剑指 Offer 22 | 链表中倒数第k个节点 LCOF | Go | 80.2% | easy | Linked List, Two Pointers |

剑指 Offer 29 | 顺时针打印矩阵 LCOF | Go | 43.8% | easy | Array, Matrix, Simulation |

剑指 Offer 15 | 二进制中1的个数 LCOF | Go | 75.0% | easy | Bit Manipulation |

剑指 Offer 21 | 调整数组顺序使奇数位于偶数前面 LCOF | Go | 64.7% | easy | Array, Two Pointers, Sorting |

剑指 Offer 20 | 表示数值的字符串 LCOF | Go | 25.1% | medium | String |

剑指 Offer 28 | 对称的二叉树 LCOF | Go | 57.7% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

剑指 Offer 27 | 二叉树的镜像 LCOF | Go | 79.4% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

剑指 Offer 26 | 树的子结构 LCOF | Go | 46.7% | medium | Tree, Depth-First Search, Binary Tree |

剑指 Offer 25 | 合并两个排序的链表 LCOF | Go | 72.7% | easy | Recursion, Linked List |

剑指 Offer 14- I | 剪绳子 LCOF | Go | 57.2% | medium | Math, Dynamic Programming |

剑指 Offer 07 | 重建二叉树 LCOF | Go | 70.2% | medium | Tree, Array, Hash Table, Divide and Conquer, Binary Tree |

剑指 Offer 06 | 从尾到头打印链表 LCOF | Rust | 75.0% | easy | Stack, Recursion, Linked List, Two Pointers |

剑指 Offer 13 | 机器人的运动范围 LCOF | Python3 | 53.3% | medium | Depth-First Search, Breadth-First Search, Dynamic Programming |

剑指 Offer 05 | 替换空格 LCOF | Rust | 75.9% | easy | String |

剑指 Offer 12 | 矩阵中的路径 LCOF | Go | 45.3% | medium | Array, Backtracking, Matrix |

剑指 Offer 11 | 旋转数组的最小数字 LCOF | Rust | 49.2% | easy | Array, Binary Search |

剑指 Offer 10- II | 青蛙跳台阶问题 LCOF | Go | 45.4% | easy | Memoization, Math, Dynamic Programming |

剑指 Offer 04 | 二维数组中的查找 LCOF | Rust | 40.1% | medium | Array, Binary Search, Divide and Conquer, Matrix |

剑指 Offer 03 | 数组中重复的数字 LCOF | Go | 67.9% | easy | Array, Hash Table, Sorting |

剑指 Offer 10- I | 斐波那契数列 LCOF | Go | 36.2% | easy | Memoization, Math, Dynamic Programming |

剑指 Offer 09 | 用两个栈实现队列 LCOF | Rust | 70.9% | easy | Stack, Design, Queue |

2212 | Maximum Points in an Archery Competition | C++ | 46.5% | medium | Bit Manipulation, Recursion, Array, Enumeration |

2211 | Count Collisions on a Road | C++ | 38.5% | medium | Stack, String |

2210 | Count Hills and Valleys in an Array | Go | 57.6% | easy | Array |

2206 | Divide Array Into Equal Pairs | Go | 76.5% | easy | Bit Manipulation, Array, Hash Table, Counting |

2196 | Create Binary Tree From Descriptions | Python3 | 73.2% | medium | Tree, Depth-First Search, Breadth-First Search, Array, Hash Table, Binary Tree |

2195 | Append K Integers With Minimal Sum | Python3 | 22.9% | medium | Greedy, Array, Math, Sorting |

2194 | Cells in a Range on an Excel Sheet | Go | 85.0% | easy | String |

2182 | Construct String With Repeat Limit | Java | 47.7% | medium | Greedy, String, Counting, Heap (Priority Queue) |

2181 | Merge Nodes in Between Zeros | Go | 86.3% | medium | Linked List, Simulation |

2180 | Count Integers With Even Digit Sum | Go | 65.0% | easy | Math, Simulation |

2187 | Minimum Time to Complete Trips | Python3 | 26.0% | medium | Array, Binary Search |

2186 | Minimum Number of Steps to Make Two Strings Anagram II | Go | 71.6% | medium | Hash Table, String, Counting |

2185 | Counting Words With a Given Prefix | Go | 79.3% | easy | Array, String |

2170 | Minimum Operations to Make the Array Alternating | Python3 | 29.2% | medium | Greedy, Array, Hash Table, Counting |

2169 | Count Operations to Obtain Zero | Go | 76.0% | easy | Math, Simulation |

2177 | Find Three Consecutive Integers That Sum to a Given Number | Go | 68.9% | medium | Math, Simulation |

2176 | Count Equal and Divisible Pairs in an Array | Go | 80.9% | easy | Array |

2104 | Sum of Subarray Ranges | Go | 62.7% | medium | Stack, Array, Monotonic Stack |

2100 | Find Good Days to Rob the Bank | Go | 48.6% | medium | Array, Dynamic Programming, Prefix Sum |

2049 | Count Nodes With the Highest Score | Go | 51.7% | medium | Tree, Depth-First Search, Array, Binary Tree |

2044 | Count Number of Maximum Bitwise-OR Subsets | Go | 81.9% | medium | Bit Manipulation, Array, Backtracking |

2043 | Simple Bank System | Go | 67.6% | medium | Design, Array, Hash Table, Simulation |

2055 | Plates Between Candles | Go | 43.2% | medium | Array, String, Binary Search, Prefix Sum |

2028 | Find Missing Observations | Go | 50.7% | medium | Array, Math, Simulation |

2039 | The Time When the Network Becomes Idle | Go | 55.8% | medium | Breadth-First Search, Graph, Array |

2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Go | 63.7% | medium | Greedy, Math, String, Game Theory |

2016 | Maximum Difference Between Increasing Elements | Go | 60.3% | easy | Array |

2024 | Maximize the Confusion of an Exam | Go | 57.2% | medium | String, Binary Search, Prefix Sum, Sliding Window |

2000 | Reverse Prefix of Word | Go, Rust | 79.5% | easy | Two Pointers, String |

2006 | Count Number of Pairs With Absolute Difference K | Go, Rust | 85.5% | easy | Array, Hash Table, Counting |

1984 | Minimum Difference Between Highest and Lowest of K Scores | Go | 62.9% | easy | Array, Sorting, Sliding Window |

1994 | The Number of Good Subsets | Go | 56.8% | hard | Bit Manipulation, Array, Math, Dynamic Programming, Bitmask |

1791 | Find Center of Star Graph | Go | 84.0% | easy | Graph |

1765 | Map of Highest Peak | Rust | 66.5% | medium | Breadth-First Search, Array, Matrix |

1763 | Longest Nice Substring | Rust | 69.1% | easy | Bit Manipulation, Hash Table, String, Sliding Window |

1748 | Sum of Unique Elements | Go, Rust | 79.0% | easy | Array, Hash Table, Counting |

1725 | Number Of Rectangles That Can Form The Largest Square | Go, Rust | 83.4% | easy | Array |

1719 | Number Of Ways To Reconstruct A Tree | Go | 69.8% | hard | Tree, Graph, Topological Sort |

1631 | Path With Minimum Effort | Go | 49.9% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, Binary Search, Matrix, Heap (Priority Queue) |

1601 | Maximum Number of Achievable Transfer Requests | Go | 61.6% | hard | Bit Manipulation, Array, Backtracking, Enumeration |

1606 | Find Servers That Handled Most Number of Requests | Go | 48.2% | hard | Greedy, Array, Ordered Set, Heap (Priority Queue) |

1584 | Min Cost to Connect All Points | Go | 66.2% | medium | Union Find, Array, Minimum Spanning Tree |

1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Go | 61.9% | hard | Union Find, Graph |

1588 | Sum of All Odd Length Subarrays | Go | 83.9% | easy | Array, Math, Prefix Sum |

1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Go | 68.5% | hard | Union Find, Graph, Minimum Spanning Tree, Sorting, Strongly Connected Component |

1480 | Running Sum of 1d Array | Go | 86.9% | easy | Array, Prefix Sum |

1447 | Simplified Fractions | Go, Rust | 67.8% | medium | Math, String, Number Theory |

1423 | Maximum Points You Can Obtain from Cards | Go | 55.5% | medium | Array, Prefix Sum, Sliding Window |

1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | Rust | 70.6% | medium | Greedy |

1380 | Lucky Numbers in a Matrix | Go | 77.0% | easy | Array, Matrix |

1342 | Number of Steps to Reduce a Number to Zero | Rust | 82.6% | easy | Bit Manipulation, Math |

1319 | Number of Operations to Make Network Connected | Go | 61.9% | medium | Depth-First Search, Breadth-First Search, Union Find, Graph |

2215 | Find the Difference of Two Arrays | Go | 66.8% | easy | Array, Hash Table |

2217 | Find Palindrome With Fixed Length | C++ | 32.0% | medium | Array, Math |

2216 | Minimum Deletions to Make Array Beautiful | Go | 46.8% | medium | Stack, Greedy, Array |

1232 | Check If It Is a Straight Line | Go | 46.5% | easy | Geometry, Array, Math |

1221 | Split a String in Balanced Strings | Go | 84.4% | easy | Greedy, String, Counting |

1219 | Path with Maximum Gold | Go, Rust | 69.7% | medium | Array, Backtracking, Matrix |

1218 | Longest Arithmetic Subsequence of Given Difference | Go | 51.5% | medium | Array, Hash Table, Dynamic Programming |

1706 | Where Will the Ball Fall | Go | 69.3% | medium | Depth-First Search, Array, Dynamic Programming, Matrix, Simulation |

1208 | Get Equal Substrings Within Budget | Go | 49.8% | medium | String, Binary Search, Prefix Sum, Sliding Window |

1203 | Sort Items by Groups Respecting Dependencies | Go | 61.8% | hard | Depth-First Search, Breadth-First Search, Graph, Topological Sort |

1202 | Smallest String With Swaps❤️ | Go | 50.5% | medium | Depth-First Search, Breadth-First Search, Union Find, Hash Table, String |

1405 | Longest Happy String | Rust | 64.0% | medium | Greedy, String, Heap (Priority Queue) |

1189 | Maximum Number of Balloons | Go | 68.7% | easy | Hash Table, String, Counting |

1128 | Number of Equivalent Domino Pairs | Go | 54.3% | easy | Array, Hash Table, Counting |

1046 | Last Stone Weight | Go | 65.8% | easy | Array, Heap (Priority Queue) |

1020 | Number of Enclaves | Go | 61.0% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, Matrix |

1018 | Binary Prefix Divisible By 5 | Go | 51.4% | easy | Array |

1004 | Max Consecutive Ones III | Go | 60.0% | medium | Array, Binary Search, Prefix Sum, Sliding Window |

1001 | Grid Illumination | Go | 45.1% | hard | Array, Hash Table |

995 | Minimum Number of K Consecutive Bit Flips | Go | 53.4% | hard | Bit Manipulation, Array, Prefix Sum, Sliding Window |

992 | Subarrays with K Different Integers | Go | 46.2% | hard | Array, Hash Table, Counting, Sliding Window |

989 | Add to Array-Form of Integer | Go | 46.9% | easy | Array, Math |

978 | Longest Turbulent Subarray | Go | 47.3% | medium | Array, Dynamic Programming, Sliding Window |

509 | Fibonacci Number | Go | 66.6% | easy | Recursion, Memoization, Math, Dynamic Programming |

969 | Pancake Sorting | Go | 67.9% | medium | Greedy, Array, Two Pointers, Sorting |

959 | Regions Cut By Slashes | Go | 74.2% | medium | Depth-First Search, Breadth-First Search, Union Find, Graph |

954 | Array of Doubled Pairs | Go | 38.9% | medium | Greedy, Array, Hash Table, Sorting |

947 | Most Stones Removed with Same Row or Column | Go | 61.2% | medium | Depth-First Search, Union Find, Graph |

917 | Reverse Only Letters | Go | 60.3% | easy | Two Pointers, String |

888 | Fair Candy Swap | Go | 64.0% | easy | Array, Hash Table, Binary Search, Sorting |

887 | Super Egg Drop | Go | 29.6% | hard | Math, Binary Search, Dynamic Programming |

881 | Boats to Save People | Go | 53.8% | medium | Greedy, Array, Two Pointers, Sorting |

869 | Reordered Power of 2 | Go | 64.1% | medium | Math, Counting, Enumeration, Sorting |

861 | Score After Flipping Matrix | Go | 80.8% | medium | Greedy, Bit Manipulation, Array, Matrix |

860 | Lemonade Change | Go | 58.5% | easy | Greedy, Array |

842 | Split Array into Fibonacci Sequence | Go | 48.6% | medium | String, Backtracking |

839 | Similar String Groups | Go | 57.9% | hard | Depth-First Search, Breadth-First Search, Union Find, Array, String |

838 | Push Dominoes | Go | 55.4% | medium | Two Pointers, String, Dynamic Programming |

830 | Positions of Large Groups | Go | 54.3% | easy | String |

803 | Bricks Falling When Hit | Go | 47.7% | hard | Union Find, Array, Matrix |

798 | Smallest Rotation with Highest Score | Go | 61.4% | hard | Array, Prefix Sum |

797 | All Paths From Source to Target | Go | 78.8% | medium | Depth-First Search, Breadth-First Search, Graph, Backtracking |

796 | Rotate String | Go | 63.0% | easy | String, String Matching |

787 | Cheapest Flights Within K Stops | Go | 38.9% | medium | Depth-First Search, Breadth-First Search, Graph, Dynamic Programming, Shortest Path, Heap (Priority Queue) |

778 | Swim in Rising Water | Go | 58.9% | hard | Depth-First Search, Breadth-First Search, Union Find, Array, Binary Search, Matrix, Heap (Priority Queue) |

703 | Kth Largest Element in a Stream | Go | 51.9% | easy | Tree, Design, Binary Search Tree, Binary Tree, Data Stream, Heap (Priority Queue) |

766 | Toeplitz Matrix | Go | 70.5% | easy | Array, Matrix |

590 | N-ary Tree Postorder Traversal | Go | 77.8% | easy | Stack, Tree, Depth-First Search |

589 | N-ary Tree Preorder Traversal | Go | 76.1% | easy | Stack, Tree, Depth-First Search |

765 | Couples Holding Hands | Go | 66.3% | hard | Greedy, Depth-First Search, Breadth-First Search, Union Find, Graph |

763 | Partition Labels | Go | 76.6% | medium | Greedy, Hash Table, Two Pointers, String |

762 | Prime Number of Set Bits in Binary Representation | Go | 75.7% | easy | Bit Manipulation, Math |

746 | Min Cost Climbing Stairs | Go | 61.6% | easy | Array, Dynamic Programming |

744 | Find Smallest Letter Greater Than Target | Go | 49.7% | easy | Array, Binary Search |

739 | Daily Temperatures❤️ | Go | 69.0% | medium | Stack, Array, Monotonic Stack |

738 | Monotone Increasing Digits | Go | 50.0% | medium | Greedy, Math |

728 | Self Dividing Numbers | Go | 78.9% | easy | Math |

724 | Find Pivot Index | Go | 48.4% | easy | Array, Prefix Sum |

721 | Accounts Merge | Go | 47.4% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, String |

720 | Longest Word in Dictionary | Go | 51.9% | easy | Trie, Array, Hash Table, String, Sorting |

717 | 1-bit and 2-bit Characters | Go | 55.4% | easy | Array |

714 | Best Time to Buy and Sell Stock with Transaction Fee | Go | 73.7% | medium | Greedy, Array, Dynamic Programming |

713 | Subarray Product Less Than K | Go | 44.0% | medium | Array, Sliding Window |

695 | Max Area of Island | Go | 67.4% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, Matrix |

693 | Binary Number with Alternating Bits | Go | 65.4% | easy | Bit Manipulation |

688 | Knight Probability in Chessboard | Go | 58.3% | medium | Dynamic Programming |

687 | Longest Univalue Path | Go | 44.8% | medium | Tree, Depth-First Search, Binary Tree |

685 | Redundant Connection II | Go | 42.3% | hard | Depth-First Search, Breadth-First Search, Union Find, Graph |

684 | Redundant Connection | Go | 66.9% | medium | Depth-First Search, Breadth-First Search, Union Find, Graph |

682 | Baseball Game | Go | 72.3% | easy | Stack, Array, Simulation |

680 | Valid Palindrome II | Go | 40.1% | easy | Greedy, Two Pointers, String |

677 | Map Sum Pairs | Go | 66.5% | medium | Design, Trie, Hash Table, String |

674 | Longest Continuous Increasing Subsequence | Go | 52.2% | easy | Array |

671 | Second Minimum Node In a Binary Tree | Go | 48.3% | easy | Tree, Depth-First Search, Binary Tree |

669 | Trim a Binary Search Tree | Go | 66.6% | medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

665 | Non-decreasing Array | Go | 27.4% | medium | Array |

661 | Image Smoother | Go | 64.5% | easy | Array, Matrix |

653 | Two Sum IV - Input is a BST | Go | 63.0% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Hash Table, Two Pointers, Binary Tree |

649 | Dota2 Senate | Go | 47.9% | medium | Greedy, Queue, String |

647 | Palindromic Substrings | Go | 66.2% | medium | String, Dynamic Programming |

643 | Maximum Average Subarray I❤️ | Go | 44.5% | easy | Array, Sliding Window |

638 | Shopping Offers | Go | 64.4% | medium | Bit Manipulation, Memoization, Array, Dynamic Programming, Backtracking, Bitmask |

637 | Average of Levels in Binary Tree | Go | 69.4% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

633 | Sum of Square Numbers | Go | 39.0% | medium | Math, Two Pointers, Binary Search |

629 | K Inverse Pairs Array | Go | 51.9% | hard | Dynamic Programming |

628 | Maximum Product of Three Numbers | Go | 52.4% | easy | Array, Math, Sorting |

627 | Swap Salary | SQL | 81.4% | easy | Database |

626 | Exchange Seats | SQL | 68.6% | medium | Database |

621 | Task Scheduler | Go | 58.1% | medium | Greedy, Array, Hash Table, Counting, Sorting, Heap (Priority Queue) |

620 | Not Boring Movies | SQL | 77.2% | easy | Database |

617 | Merge Two Binary Trees | Go | 78.9% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

606 | Construct String from Binary Tree | Go | 63.1% | easy | Tree, Depth-First Search, String, Binary Tree |

605 | Can Place Flowers | Go | 33.0% | easy | Greedy, Array |

599 | Minimum Index Sum of Two Lists | Go | 57.3% | easy | Array, Hash Table, String |

598 | Range Addition II | Go | 57.2% | easy | Array, Math |

596 | Classes More Than 5 Students | SQL | 45.5% | easy | Database |

595 | Big Countries | SQL | 74.9% | easy | Database |

581 | Shortest Unsorted Continuous Subarray | Go | 41.0% | medium | Stack, Greedy, Array, Two Pointers, Sorting, Monotonic Stack |

575 | Distribute Candies | Go | 71.0% | easy | Array, Hash Table |

572 | Subtree of Another Tree | Go | 47.5% | easy | Tree, Depth-First Search, Binary Tree, String Matching, Hash Function |

567 | Permutation in String | Go | 43.7% | medium | Hash Table, Two Pointers, String, Sliding Window |

566 | Reshape the Matrix | Go | 66.6% | easy | Array, Matrix, Simulation |

564 | Find the Closest Palindrome | Go | 30.4% | hard | Math, String |

561 | Array Partition I | Go | 78.0% | easy | Greedy, Array, Counting Sort, Sorting |

560 | Subarray Sum Equals K❤️ | Go | 45.0% | medium | Array, Hash Table, Prefix Sum |

553 | Optimal Division | Go | 65.0% | medium | Array, Math, Dynamic Programming |

547 | Number of Provinces | Go | 62.0% | medium | Depth-First Search, Breadth-First Search, Union Find, Graph |

543 | Diameter of Binary Tree❤️ | Go | 56.7% | easy | Tree, Depth-First Search, Binary Tree |

540 | Single Element in a Sorted Array | Go | 60.8% | medium | Array, Binary Search |

538 | Convert BST to Greater Tree | Go | 73.2% | medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

537 | Complex Number Multiplication | Go | 74.9% | medium | Math, String, Simulation |

525 | Contiguous Array | Go | 54.1% | medium | Array, Hash Table, Prefix Sum |

524 | Longest Word in Dictionary through Deleting | Go | 49.8% | medium | Array, Two Pointers, String, Sorting |

521 | Longest Uncommon Subsequence I | Go | 73.8% | easy | String |

520 | Detect Capital | Go | 57.4% | easy | String |

513 | Find Bottom Left Tree Value | Go | 73.1% | medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

507 | Perfect Number | C | 49.0% | easy | Math |

504 | Base 7 | Go | 52.2% | easy | Math |

503 | Next Greater Element II | Go | 65.0% | medium | Stack, Array, Monotonic Stack |

502 | IPO | Go | 44.3% | hard | Greedy, Array, Sorting, Heap (Priority Queue) |

501 | Find Mode in Binary Search Tree | Go | 53.0% | easy | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

500 | Keyboard Row | Go | 74.4% | easy | Array, Hash Table, String |

496 | Next Greater Element I | Go | 71.0% | easy | Stack, Array, Hash Table, Monotonic Stack |

495 | Teemo Attacking | Go | 60.4% | easy | Array, Simulation |

494 | Target Sum | Go | 49.0% | medium | Array, Dynamic Programming, Backtracking |

492 | Construct the Rectangle | Go | 60.7% | easy | Math |

488 | Zuma Game | Go | 51.3% | hard | Breadth-First Search, Memoization, String, Dynamic Programming |

485 | Max Consecutive Ones | Go | 61.0% | easy | Array |

480 | Sliding Window Median | Go | 44.7% | hard | Array, Hash Table, Sliding Window, Heap (Priority Queue) |

476 | Number Complement | Go | 71.1% | easy | Bit Manipulation |

461 | Hamming Distance | Go | 81.5% | easy | Bit Manipulation |

460 | LFU Cache | Go | 44.0% | hard | Design, Hash Table, Linked List, Doubly-Linked List |

455 | Assign Cookies | Go | 57.3% | easy | Greedy, Array, Sorting |

453 | Minimum Moves to Equal Array Elements | Go | 61.3% | easy | Array, Math |

452 | Minimum Number of Arrows to Burst Balloons | Go | 50.7% | medium | Greedy, Array, Sorting |

451 | Sort Characters By Frequency | Go | 71.6% | medium | Hash Table, String, Bucket Sort, Counting, Sorting, Heap (Priority Queue) |

448 | Find All Numbers Disappeared in an Array | Go | 65.4% | easy | Array, Hash Table |

447 | Number of Boomerangs | Go | 66.5% | medium | Array, Hash Table, Math |

441 | Arranging Coins | Go | 45.8% | easy | Math, Binary Search |

440 | K-th Smallest in Lexicographical Order | Go | 42.7% | hard | Trie |

438 | Find All Anagrams in a String❤️ | Go | 54.4% | medium | Hash Table, String, Sliding Window |

437 | Path Sum III❤️ | Go | 57.1% | medium | Tree, Depth-First Search, Binary Tree |

435 | Non-overlapping Intervals | Go | 50.7% | medium | Greedy, Array, Dynamic Programming, Sorting |

432 | All O`one Data Structure | Go | 47.2% | hard | Design, Hash Table, Linked List, Doubly-Linked List |

424 | Longest Repeating Character Replacement | Go | 53.7% | medium | Hash Table, String, Sliding Window |

420 | Strong Password Checker | Go | 39.4% | hard | Greedy, String, Heap (Priority Queue) |

416 | Partition Equal Subset Sum❤️ | Go | 51.5% | medium | Array, Dynamic Programming |

412 | Fizz Buzz | Go | 71.3% | easy | Math, String, Simulation |

407 | Trapping Rain Water II | Go | 57.8% | hard | Breadth-First Search, Array, Matrix, Heap (Priority Queue) |

406 | Queue Reconstruction by Height | Go | 74.8% | medium | Greedy, Binary Indexed Tree, Segment Tree, Array, Sorting |

404 | Sum of Left Leaves | Go | 60.3% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

399 | Evaluate Division | Go | 59.2% | medium | Depth-First Search, Breadth-First Search, Union Find, Graph, Array, Shortest Path |

395 | Longest Substring with At Least K Repeating Characters❤️ | Go | 52.3% | medium | Hash Table, String, Divide and Conquer, Sliding Window |

394 | Decode String❤️ | Go | 56.0% | medium | Stack, Recursion, String |

393 | UTF-8 Validation | Go | 43.9% | medium | Bit Manipulation, Array |

392 | Is Subsequence | Go | 52.1% | easy | Two Pointers, String, Dynamic Programming |

389 | Find the Difference | Go | 68.5% | easy | Bit Manipulation, Hash Table, String, Sorting |

387 | First Unique Character in a String | Go | 54.7% | easy | Queue, Hash Table, String, Counting |

376 | Wiggle Subsequence | Go | 47.0% | medium | Greedy, Array, Dynamic Programming |

375 | Guess Number Higher or Lower II | Go | 60.7% | medium | Math, Dynamic Programming, Game Theory |

367 | Valid Perfect Square | Go | 44.8% | easy | Math, Binary Search |

354 | Russian Doll Envelopes | Go | 42.9% | hard | Array, Binary Search, Dynamic Programming, Sorting |

352 | Data Stream as Disjoint Intervals | Go | 67.6% | hard | Design, Binary Search, Ordered Set |

349 | Intersection of Two Arrays | Go | 74.0% | easy | Array, Hash Table, Two Pointers, Binary Search, Sorting |

347 | Top K Frequent Elements | Go | 62.9% | medium | Array, Hash Table, Divide and Conquer, Bucket Sort, Counting, Quickselect, Sorting, Heap (Priority Queue) |

345 | Reverse Vowels of a String | Go | 54.2% | easy | Two Pointers, String |

344 | Reverse String | Go | 78.4% | easy | Recursion, Two Pointers, String |

338 | Counting Bits | Go | 78.6% | easy | Bit Manipulation, Dynamic Programming |

337 | House Robber III | Go | 60.7% | medium | Tree, Depth-First Search, Dynamic Programming, Binary Tree |

335 | Self Crossing | Go | 42.9% | hard | Geometry, Array, Math |

330 | Patching Array | Go | 53.0% | hard | Greedy, Array |

328 | Odd Even Linked List | Go | 65.4% | medium | Linked List |

326 | Power of Three | Go | 50.6% | easy | Recursion, Math |

322 | Coin Change | Go | 45.5% | medium | Breadth-First Search, Array, Dynamic Programming |

319 | Bulb Switcher | Go | 57.3% | medium | Brainteaser, Math |

318 | Maximum Product of Word Lengths | Go | 73.8% | medium | Bit Manipulation, Array, String |

316 | Remove Duplicate Letters | Go | 47.8% | medium | Stack, Greedy, String, Monotonic Stack |

310 | Minimum Height Trees | Go | 43.2% | medium | Depth-First Search, Breadth-First Search, Graph, Topological Sort |

309 | Best Time to Buy and Sell Stock with Cooldown | Go | 62.7% | medium | Array, Dynamic Programming |

307 | Range Sum Query - Mutable | Go | 50.6% | medium | Design, Binary Indexed Tree, Segment Tree, Array |

304 | Range Sum Query 2D - Immutable | Go | 58.3% | medium | Design, Array, Matrix, Prefix Sum |

303 | Range Sum Query - Immutable | Go | 74.6% | easy | Design, Array, Prefix Sum |

301 | Remove Invalid Parentheses | Go | 55.0% | hard | Breadth-First Search, String, Backtracking |

300 | Longest Increasing Subsequence❤️ | Go | 53.3% | medium | Array, Binary Search, Dynamic Programming |

299 | Bulls and Cows | Go | 56.6% | medium | Hash Table, String, Counting |

295 | Find Median from Data Stream | Go | 52.6% | hard | Design, Two Pointers, Data Stream, Sorting, Heap (Priority Queue) |

290 | Word Pattern | Go | 45.3% | easy | Hash Table, String |

287 | Find the Duplicate Number | Go | 65.0% | medium | Bit Manipulation, Array, Two Pointers, Binary Search |

283 | Move Zeroes | Go | 63.9% | easy | Array, Two Pointers |

282 | Expression Add Operators | Go | 48.0% | hard | Math, String, Backtracking |

279 | Perfect Squares | Go | 64.6% | medium | Breadth-First Search, Math, Dynamic Programming |

278 | First Bad Version | Java | 45.1% | easy | Binary Search, Interactive |

273 | Integer to English Words | Go | 36.6% | hard | Recursion, Math, String |

268 | Missing Number | Go | 65.6% | easy | Bit Manipulation, Array, Hash Table, Math, Sorting |

260 | Single Number III | Go | 73.5% | medium | Bit Manipulation, Array |

258 | Add Digits | Go | 71.0% | easy | Math, Number Theory, Simulation |

242 | Valid Anagram | Go | 65.2% | easy | Hash Table, String, Sorting |

241 | Different Ways to Add Parentheses | Go | 73.5% | medium | Recursion, Memoization, Math, String, Dynamic Programming |

240 | Search a 2D Matrix II | Go | 50.9% | medium | Array, Binary Search, Divide and Conquer, Matrix |

239 | Sliding Window Maximum | Go | 49.8% | hard | Queue, Array, Sliding Window, Monotonic Queue, Heap (Priority Queue) |

238 | Product of Array Except Self | Go | 73.3% | medium | Array, Prefix Sum |

237 | Delete Node in a Linked List | Go | 85.9% | easy | Linked List |

236 | Lowest Common Ancestor of a Binary Tree | Go | 68.9% | medium | Tree, Depth-First Search, Binary Tree |

234 | Palindrome Linked List | Go | 51.3% | easy | Stack, Recursion, Linked List, Two Pointers |

232 | Implement Queue using Stacks | Go | 68.8% | easy | Stack, Design, Queue |

230 | Kth Smallest Element in a BST | Go | 75.3% | medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

229 | Majority Element II | Go | 53.5% | medium | Array, Hash Table, Counting, Sorting |

228 | Summary Ranges | Go | 56.8% | easy | Array |

226 | Invert Binary Tree | Go | 79.1% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

225 | Implement Stack using Queues | Go | 67.6% | easy | Stack, Design, Queue |

221 | Maximal Square | Go | 48.8% | medium | Array, Dynamic Programming, Matrix |

220 | Contains Duplicate III | Go | 28.9% | medium | Array, Bucket Sort, Ordered Set, Sorting, Sliding Window |

218 | The Skyline Problem❤️ | Go | 54.5% | hard | Binary Indexed Tree, Segment Tree, Array, Divide and Conquer, Ordered Set, Line Sweep, Heap (Priority Queue) |

217 | Contains Duplicate | Go | 55.6% | easy | Array, Hash Table, Sorting |

215 | Kth Largest Element in an Array | Go | 64.7% | medium | Array, Divide and Conquer, Quickselect, Sorting, Heap (Priority Queue) |

213 | House Robber II | Go | 43.6% | medium | Array, Dynamic Programming |

212 | Word Search II | Go | 45.8% | hard | Trie, Array, String, Backtracking, Matrix |

211 | Design Add and Search Words Data Structure | Go | 51.0% | medium | Depth-First Search, Design, Trie, String |

210 | Course Schedule II | Go | 55.4% | medium | Depth-First Search, Breadth-First Search, Graph, Topological Sort |

209 | Minimum Size Subarray Sum | Go | 48.5% | medium | Array, Binary Search, Prefix Sum, Sliding Window |

208 | Implement Trie (Prefix Tree)❤️ | Go | 71.9% | medium | Design, Trie, Hash Table, String |

207 | Course Schedule | Go | 53.9% | medium | Depth-First Search, Breadth-First Search, Graph, Topological Sort |

206 | Reverse Linked List | Go, php | 72.9% | easy | Recursion, Linked List |

205 | Isomorphic Strings | Go | 49.8% | easy | Hash Table, String |

204 | Count Primes | Go | 37.5% | medium | Array, Math, Enumeration, Number Theory |

200 | Number of Islands | Go | 57.5% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, Matrix |

198 | House Robber❤️ | Go | 53.0% | medium | Array, Dynamic Programming |

196 | Delete Duplicate Emails | SQL | 66.9% | easy | Database |

191 | Number of 1 Bits | Go | 75.7% | easy | Bit Manipulation |

190 | Reverse Bits | Go | 70.9% | easy | Bit Manipulation, Divide and Conquer |

189 | Rotate Array | Go | 44.3% | medium | Array, Math, Two Pointers |

188 | Best Time to Buy and Sell Stock IV | Go | 41.1% | hard | Array, Dynamic Programming |

184 | Department Highest Salary | SQL | 49.2% | medium | Database |

183 | Customers Who Never Order | SQL | 67.2% | easy | Database |

182 | Duplicate Emails | SQL | 79.3% | easy | Database |

181 | Employees Earning More Than Their Managers | SQL | 69.2% | easy | Database |

180 | Consecutive Numbers | SQL | 48.3% | medium | Database |

178 | Rank Scores | SQL | 60.4% | medium | Database |

177 | Nth Highest Salary | SQL | 46.4% | medium | Database |

176 | Second Highest Salary | SQL | 35.6% | medium | Database |

175 | Combine Two Tables | SQL | 73.5% | easy | Database |

172 | Factorial Trailing Zeroes | Go | 48.2% | medium | Math |

169 | Majority Element | Go | 66.7% | easy | Array, Hash Table, Divide and Conquer, Counting, Sorting |

167 | Two Sum II - Input Array Is Sorted | Go | 58.5% | medium | Array, Two Pointers, Binary Search |

166 | Fraction to Recurring Decimal | Go | 33.3% | medium | Hash Table, Math, String |

160 | Intersection of Two Linked Lists | Go | 62.6% | easy | Hash Table, Linked List, Two Pointers |

155 | Min Stack | Go | 58.0% | easy | Stack, Design |

153 | Find Minimum in Rotated Sorted Array | Go | 56.9% | medium | Array, Binary Search |

152 | Maximum Product Subarray | Go | 42.5% | medium | Array, Dynamic Programming |

149 | Max Points on a Line❤️ | Go | 36.5% | hard | Geometry, Array, Hash Table, Math |

148 | Sort List | Go | 66.5% | medium | Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort |

146 | LRU Cache❤️ | Go | 52.7% | medium | Design, Hash Table, Linked List, Doubly-Linked List |

145 | Binary Tree Postorder Traversal | Go | 75.7% | easy | Stack, Tree, Depth-First Search, Binary Tree |

144 | Binary Tree Preorder Traversal | Go | 71.0% | easy | Stack, Tree, Depth-First Search, Binary Tree |

142 | Linked List Cycle II | Go | 56.0% | medium | Hash Table, Linked List, Two Pointers |

141 | Linked List Cycle | Go | 51.4% | easy | Hash Table, Linked List, Two Pointers |

140 | Word Break II | Go | 52.4% | hard | Trie, Memoization, Hash Table, String, Dynamic Programming, Backtracking |

139 | Word Break❤️ | Go | 52.9% | medium | Trie, Memoization, Hash Table, String, Dynamic Programming |

137 | Single Number II | Go | 72.1% | medium | Bit Manipulation, Array |

136 | Single Number | Go | 72.1% | easy | Bit Manipulation, Array |

135 | Candy | Go | 48.9% | hard | Greedy, Array |

131 | Palindrome Partitioning | Go | 72.8% | medium | String, Dynamic Programming, Backtracking |

130 | Surrounded Regions | Go | 45.5% | medium | Depth-First Search, Breadth-First Search, Union Find, Array, Matrix |

127 | Word Ladder | Go | 47.4% | hard | Breadth-First Search, Hash Table, String |

125 | Valid Palindrome | Go | 46.9% | easy | Two Pointers, String |

123 | Best Time to Buy and Sell Stock III | Go | 55.7% | hard | Array, Dynamic Programming |

122 | Best Time to Buy and Sell Stock II | Go | 70.2% | medium | Greedy, Array, Dynamic Programming |

121 | Best Time to Buy and Sell Stock❤️ | Go | 57.7% | easy | Array, Dynamic Programming |

119 | Pascal’s Triangle II | Go | 68.2% | easy | Array, Dynamic Programming |

118 | Pascal’s Triangle | Go | 74.6% | easy | Array, Dynamic Programming |

114 | Flatten Binary Tree to Linked List | Go | 72.8% | medium | Stack, Tree, Depth-First Search, Linked List, Binary Tree |

112 | Path Sum | Go | 53.2% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

111 | Minimum Depth of Binary Tree | Go | 50.1% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

110 | Balanced Binary Tree | Go | 56.9% | easy | Tree, Depth-First Search, Binary Tree |

105 | Construct Binary Tree from Preorder and Inorder Traversal | Go | 71.0% | medium | Tree, Array, Hash Table, Divide and Conquer, Binary Tree |

104 | Maximum Depth of Binary Tree❤️ | Go | 76.9% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

103 | Binary Tree Zigzag Level Order Traversal | Go | 57.3% | medium | Tree, Breadth-First Search, Binary Tree |

102 | Binary Tree Level Order Traversal | Go | 64.7% | medium | Tree, Breadth-First Search, Binary Tree |

101 | Symmetric Tree❤️ | Go | 57.5% | easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree |

98 | Validate Binary Search Tree❤️ | Go | 35.9% | medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

96 | Unique Binary Search Trees❤️ | Go | 70.2% | medium | Tree, Binary Search Tree, Math, Dynamic Programming, Binary Tree |

95 | Unique Binary Search Trees II | Go | 71.8% | medium | Tree, Binary Search Tree, Dynamic Programming, Backtracking, Binary Tree |

94 | Binary Tree Inorder Traversal | Go | 75.8% | easy | Stack, Tree, Depth-First Search, Binary Tree |

88 | Merge Sorted Array | Go | 52.2% | easy | Array, Two Pointers, Sorting |

87 | Scramble String | Go | 48.2% | hard | String, Dynamic Programming |

86 | Partition List | Go | 63.2% | medium | Linked List, Two Pointers |

85 | Maximal Rectangle | Go | 52.8% | hard | Stack, Array, Dynamic Programming, Matrix, Monotonic Stack |

83 | Remove Duplicates from Sorted List | Go | 53.6% | easy | Linked List |

79 | Word Search❤️ | Go | 46.2% | medium | Array, Backtracking, Matrix |

78 | Subsets | Go | 80.5% | medium | Bit Manipulation, Array, Backtracking |

76 | Minimum Window Substring | Go | 44.0% | hard | Hash Table, String, Sliding Window |

75 | Sort Colors❤️ | Go | 60.1% | medium | Array, Two Pointers, Sorting |

70 | Climbing Stairs❤️ | Go | 53.6% | easy | Memoization, Math, Dynamic Programming |

69 | Sqrt(x) | Go | 38.9% | easy | Math, Binary Search |

67 | Add Binary | Go | 53.9% | easy | Bit Manipulation, Math, String, Simulation |

66 | Plus One | Go | 45.9% | easy | Array, Math |

64 | Minimum Path Sum | Go | 69.2% | medium | Array, Dynamic Programming, Matrix |

62 | Unique Paths | Go | 67.0% | medium | Math, Dynamic Programming, Combinatorics |

56 | Merge Intervals | Go | 48.4% | medium | Array, Sorting |

55 | Jump Game❤️ | Go | 43.5% | medium | Greedy, Array, Dynamic Programming |

53 | Maximum Subarray❤️ | Go | 54.9% | easy | Array, Divide and Conquer, Dynamic Programming |

49 | Group Anagrams | Go | 67.2% | medium | Hash Table, String, Sorting |

48 | Rotate Image | Go | 74.0% | medium | Array, Math, Matrix |

46 | Permutations❤️ | Go | 78.5% | medium | Array, Backtracking |

39 | Combination Sum❤️ | Go | 72.8% | medium | Array, Backtracking |

38 | Count and Say | Go | 59.9% | medium | String |

34 | Find First and Last Position of Element in Sorted Array | Go | 42.2% | medium | Array, Binary Search |

33 | Search in Rotated Sorted Array | Go | 43.5% | medium | Array, Binary Search |

31 | Next Permutation❤️ | Go | 37.5% | medium | Array, Two Pointers |

29 | Divide Two Integers | Go | 22.1% | medium | Bit Manipulation, Math |

22 | Generate Parentheses | Go | 77.4% | medium | String, Dynamic Programming, Backtracking |

21 | Merge Two Sorted Lists | Go | 66.7% | easy | Recursion, Linked List |

20 | Valid Parentheses❤️ | Go | 44.5% | easy | Stack, String |

19 | Remove Nth Node From End of List❤️ | Go | 43.9% | medium | Linked List, Two Pointers |

17 | Letter Combinations of a Phone Number❤️ | Go | 57.7% | medium | Hash Table, String, Backtracking |

15 | 3Sum❤️ | Go | 35.2% | medium | Array, Two Pointers, Sorting |

11 | Container With Most Water❤️ | Go | 61.5% | medium | Greedy, Array, Two Pointers |

6 | ZigZag Conversion | Go | 51.9% | medium | String |

5 | Longest Palindromic Substring❤️ | Go, Rust | 36.5% | medium | String, Dynamic Programming |

3 | Longest Substring Without Repeating Characters | Go, Rust | 38.7% | medium | Hash Table, String, Sliding Window |

2 | Add Two Numbers | Go, Rust | 41.6% | medium | Recursion, Linked List, Math |

1 | Two Sum | Go, Rust | 52.5% | easy | Array, Hash Table |