Skip to content

LiHowe/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

LeetCode

My LeetCode Repo.

Update time: 2022-07-04(Mon) 15:03:09

Summary

๐Ÿคฉ ็ฎ€ๅ• ๐Ÿค” ไธ€่ˆฌ ๐Ÿคฏ ๅ›ฐ้šพ
53/698 32/1426 6/570

Progress

ๅบๅท ๅ็งฐ ย ้šพๅบฆย  ็Šถๆ€
1 Two Sum ๐Ÿคฉ ็ฎ€ๅ• โœ…
2 Add Two Numbers ๐Ÿค” ไธ€่ˆฌ โœ…
3 Longest Substring Without Repeating Characters ๐Ÿค” ไธ€่ˆฌ โœ…
4 Median of Two Sorted Arrays ๐Ÿคฏ ๅ›ฐ้šพ โœ…
5 Longest Palindromic Substring ๐Ÿค” ไธ€่ˆฌ โœ…
6 ZigZag Conversion ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
7 Reverse Integer ๐Ÿค” ไธ€่ˆฌ โœ…
8 String to Integer (atoi) ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
9 Palindrome Number ๐Ÿคฉ ็ฎ€ๅ• โœ…
10 Regular Expression Matching ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
11 Container With Most Water ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
12 Integer to Roman ๐Ÿค” ไธ€่ˆฌ โœ…
13 Roman to Integer ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
14 Longest Common Prefix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
15 3Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
16 3Sum Closest ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
17 Letter Combinations of a Phone Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
18 4Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
19 Remove Nth Node From End of List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
20 Valid Parentheses ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
21 Merge Two Sorted Lists ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
22 Generate Parentheses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
23 Merge k Sorted Lists ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
24 Swap Nodes in Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
25 Reverse Nodes in k-Group ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
26 Remove Duplicates from Sorted Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
27 Remove Element ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
28 Implement strStr() ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
29 Divide Two Integers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
30 Substring with Concatenation of All Words ๐Ÿคฏ ๅ›ฐ้šพ โœ…
31 Next Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
32 Longest Valid Parentheses ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
33 Search in Rotated Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
34 Find First and Last Position of Element in Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
35 Search Insert Position ๐Ÿคฉ ็ฎ€ๅ• โœ…
36 Valid Sudoku ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
37 Sudoku Solver ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
38 Count and Say ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
39 Combination Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
40 Combination Sum II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
41 First Missing Positive ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
42 Trapping Rain Water ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
43 Multiply Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
44 Wildcard Matching ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
45 Jump Game II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
46 Permutations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
47 Permutations II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
48 Rotate Image ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
49 Group Anagrams ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
50 Pow(x, n) ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
51 N-Queens ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
52 N-Queens II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
53 Maximum Subarray ๐Ÿคฉ ็ฎ€ๅ• โœ…
54 Spiral Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
55 Jump Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
56 Merge Intervals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
57 Insert Interval ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
58 Length of Last Word ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
59 Spiral Matrix II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
60 Permutation Sequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
61 Rotate List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
62 Unique Paths ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
63 Unique Paths II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
64 Minimum Path Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
65 Valid Number ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
66 Plus One ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
67 Add Binary ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
68 Text Justification ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
69 Sqrt(x) ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
70 Climbing Stairs ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
71 Simplify Path ๐Ÿค” ไธ€่ˆฌ โœ…
72 Edit Distance ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
73 Set Matrix Zeroes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
74 Search a 2D Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
75 Sort Colors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
76 Minimum Window Substring ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
77 Combinations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
78 Subsets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
79 Word Search ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
80 Remove Duplicates from Sorted Array II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
81 Search in Rotated Sorted Array II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
82 Remove Duplicates from Sorted List II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
83 Remove Duplicates from Sorted List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
84 Largest Rectangle in Histogram ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
85 Maximal Rectangle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
86 Partition List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
87 Scramble String ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
88 Merge Sorted Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
89 Gray Code ๐Ÿค” ไธ€่ˆฌ โœ…
90 Subsets II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
91 Decode Ways ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
92 Reverse Linked List II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
93 Restore IP Addresses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
94 Binary Tree Inorder Traversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
95 Unique Binary Search Trees II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
96 Unique Binary Search Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
97 Interleaving String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
98 Validate Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
99 Recover Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
100 Same Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
101 Symmetric Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
102 Binary Tree Level Order Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
103 Binary Tree Zigzag Level Order Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
104 Maximum Depth of Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
105 Construct Binary Tree from Preorder and Inorder Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
106 Construct Binary Tree from Inorder and Postorder Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
107 Binary Tree Level Order Traversal II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
108 Convert Sorted Array to Binary Search Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
109 Convert Sorted List to Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
110 Balanced Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
111 Minimum Depth of Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
112 Path Sum ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
113 Path Sum II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
114 Flatten Binary Tree to Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
115 Distinct Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
116 Populating Next Right Pointers in Each Node ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
117 Populating Next Right Pointers in Each Node II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
118 Pascal's Triangle ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
119 Pascal's Triangle II ๐Ÿคฉ ็ฎ€ๅ• โœ…
120 Triangle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
121 Best Time to Buy and Sell Stock ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
122 Best Time to Buy and Sell Stock II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
123 Best Time to Buy and Sell Stock III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
124 Binary Tree Maximum Path Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
125 Valid Palindrome ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
126 Word Ladder II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
127 Word Ladder ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
128 Longest Consecutive Sequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
129 Sum Root to Leaf Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
130 Surrounded Regions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
131 Palindrome Partitioning ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
132 Palindrome Partitioning II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
133 Clone Graph ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
134 Gas Station ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
135 Candy ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
136 Single Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
137 Single Number II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
138 Copy List with Random Pointer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
139 Word Break ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
140 Word Break II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
141 Linked List Cycle ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
142 Linked List Cycle II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
143 Reorder List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
144 Binary Tree Preorder Traversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
145 Binary Tree Postorder Traversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
146 LRU Cache ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
147 Insertion Sort List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
148 Sort List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
149 Max Points on a Line ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
150 Evaluate Reverse Polish Notation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
151 Reverse Words in a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
152 Maximum Product Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
153 Find Minimum in Rotated Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
154 Find Minimum in Rotated Sorted Array II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
155 Min Stack ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
156 Binary Tree Upside Down ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
157 Read N Characters Given Read4 ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
158 Read N Characters Given Read4 II - Call multiple times ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
159 Longest Substring with At Most Two Distinct Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
160 Intersection of Two Linked Lists ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
161 One Edit Distance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
162 Find Peak Element ๐Ÿค” ไธ€่ˆฌ โœ…
163 Missing Ranges ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
164 Maximum Gap ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
165 Compare Version Numbers ๐Ÿค” ไธ€่ˆฌ โœ…
166 Fraction to Recurring Decimal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
167 Two Sum II - Input Array Is Sorted ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
168 Excel Sheet Column Title ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
169 Majority Element ๐Ÿคฉ ็ฎ€ๅ• โœ…
170 Two Sum III - Data structure design ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
171 Excel Sheet Column Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
172 Factorial Trailing Zeroes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
173 Binary Search Tree Iterator ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
174 Dungeon Game ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
179 Largest Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
186 Reverse Words in a String II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
187 Repeated DNA Sequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
188 Best Time to Buy and Sell Stock IV ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
189 Rotate Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
190 Reverse Bits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
191 Number of 1 Bits ๐Ÿคฉ ็ฎ€ๅ• โœ…
198 House Robber ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
199 Binary Tree Right Side View ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
200 Number of Islands ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
201 Bitwise AND of Numbers Range ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
202 Happy Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
203 Remove Linked List Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
204 Count Primes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
205 Isomorphic Strings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
206 Reverse Linked List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
207 Course Schedule ๐Ÿค” ไธ€่ˆฌ โœ…
208 Implement Trie (Prefix Tree) ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
209 Minimum Size Subarray Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
210 Course Schedule II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
211 Design Add and Search Words Data Structure ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
212 Word Search II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
213 House Robber II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
214 Shortest Palindrome ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
215 Kth Largest Element in an Array ๐Ÿค” ไธ€่ˆฌ โœ…
216 Combination Sum III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
217 Contains Duplicate ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
218 The Skyline Problem ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
219 Contains Duplicate II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
220 Contains Duplicate III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
221 Maximal Square ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
222 Count Complete Tree Nodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
223 Rectangle Area ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
224 Basic Calculator ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
225 Implement Stack using Queues ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
226 Invert Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
227 Basic Calculator II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
228 Summary Ranges ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
229 Majority Element II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
230 Kth Smallest Element in a BST ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
231 Power of Two ๐Ÿคฉ ็ฎ€ๅ• โœ…
232 Implement Queue using Stacks ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
233 Number of Digit One ๐Ÿคฏ ๅ›ฐ้šพ โœ…
234 Palindrome Linked List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
235 Lowest Common Ancestor of a Binary Search Tree ๐Ÿคฉ ็ฎ€ๅ• โœ…
236 Lowest Common Ancestor of a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
237 Delete Node in a Linked List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
238 Product of Array Except Self ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
239 Sliding Window Maximum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
240 Search a 2D Matrix II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
241 Different Ways to Add Parentheses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
242 Valid Anagram ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
243 Shortest Word Distance ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
244 Shortest Word Distance II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
245 Shortest Word Distance III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
246 Strobogrammatic Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
247 Strobogrammatic Number II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
248 Strobogrammatic Number III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
249 Group Shifted Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
250 Count Univalue Subtrees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
251 Flatten 2D Vector ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
252 Meeting Rooms ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
253 Meeting Rooms II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
254 Factor Combinations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
255 Verify Preorder Sequence in Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
256 Paint House ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
257 Binary Tree Paths ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
258 Add Digits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
259 3Sum Smaller ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
260 Single Number III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
261 Graph Valid Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
263 Ugly Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
264 Ugly Number II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
265 Paint House II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
266 Palindrome Permutation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
267 Palindrome Permutation II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
268 Missing Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
269 Alien Dictionary ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
270 Closest Binary Search Tree Value ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
271 Encode and Decode Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
272 Closest Binary Search Tree Value II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
273 Integer to English Words ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
274 H-Index ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
275 H-Index II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
276 Paint Fence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
277 Find the Celebrity ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
278 First Bad Version ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
279 Perfect Squares ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
280 Wiggle Sort ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
281 Zigzag Iterator ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
282 Expression Add Operators ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
283 Move Zeroes ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
284 Peeking Iterator ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
285 Inorder Successor in BST ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
286 Walls and Gates ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
287 Find the Duplicate Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
288 Unique Word Abbreviation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
289 Game of Life ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
290 Word Pattern ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
291 Word Pattern II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
292 Nim Game ๐Ÿคฉ ็ฎ€ๅ• โœ…
293 Flip Game ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
294 Flip Game II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
295 Find Median from Data Stream ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
296 Best Meeting Point ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
297 Serialize and Deserialize Binary Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
298 Binary Tree Longest Consecutive Sequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
299 Bulls and Cows ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
300 Longest Increasing Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
301 Remove Invalid Parentheses ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
302 Smallest Rectangle Enclosing Black Pixels ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
303 Range Sum Query - Immutable ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
304 Range Sum Query 2D - Immutable ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
305 Number of Islands II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
306 Additive Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
307 Range Sum Query - Mutable ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
308 Range Sum Query 2D - Mutable ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
309 Best Time to Buy and Sell Stock with Cooldown ๐Ÿค” ไธ€่ˆฌ โœ…
310 Minimum Height Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
311 Sparse Matrix Multiplication ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
312 Burst Balloons ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
313 Super Ugly Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
314 Binary Tree Vertical Order Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
315 Count of Smaller Numbers After Self ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
316 Remove Duplicate Letters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
317 Shortest Distance from All Buildings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
318 Maximum Product of Word Lengths ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
319 Bulb Switcher ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
320 Generalized Abbreviation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
321 Create Maximum Number ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
322 Coin Change ๐Ÿค” ไธ€่ˆฌ โœ…
323 Number of Connected Components in an Undirected Graph ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
324 Wiggle Sort II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
325 Maximum Size Subarray Sum Equals k ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
326 Power of Three ๐Ÿคฉ ็ฎ€ๅ• โœ…
327 Count of Range Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
328 Odd Even Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
329 Longest Increasing Path in a Matrix ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
330 Patching Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
331 Verify Preorder Serialization of a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
332 Reconstruct Itinerary ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
333 Largest BST Subtree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
334 Increasing Triplet Subsequence ๐Ÿค” ไธ€่ˆฌ โœ…
335 Self Crossing ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ†–
336 Palindrome Pairs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
337 House Robber III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
338 Counting Bits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
339 Nested List Weight Sum ๐Ÿค” ไธ€่ˆฌ โœ…
340 Longest Substring with At Most K Distinct Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
341 Flatten Nested List Iterator ๐Ÿค” ไธ€่ˆฌ โœ…
342 Power of Four ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
343 Integer Break ๐Ÿค” ไธ€่ˆฌ โœ…
344 Reverse String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
345 Reverse Vowels of a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
346 Moving Average from Data Stream ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
347 Top K Frequent Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
348 Design Tic-Tac-Toe ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
349 Intersection of Two Arrays ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
350 Intersection of Two Arrays II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
351 Android Unlock Patterns ๐Ÿค” ไธ€่ˆฌ โœ…
352 Data Stream as Disjoint Intervals ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
353 Design Snake Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
354 Russian Doll Envelopes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
355 Design Twitter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
356 Line Reflection ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
357 Count Numbers with Unique Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
358 Rearrange String k Distance Apart ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
359 Logger Rate Limiter ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
360 Sort Transformed Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
361 Bomb Enemy ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
362 Design Hit Counter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
363 Max Sum of Rectangle No Larger Than K ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
364 Nested List Weight Sum II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
365 Water and Jug Problem ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
366 Find Leaves of Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
367 Valid Perfect Square ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
368 Largest Divisible Subset ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
369 Plus One Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
370 Range Addition ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
371 Sum of Two Integers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
372 Super Pow ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
373 Find K Pairs with Smallest Sums ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
374 Guess Number Higher or Lower ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
375 Guess Number Higher or Lower II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
376 Wiggle Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
377 Combination Sum IV ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
378 Kth Smallest Element in a Sorted Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
379 Design Phone Directory ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
380 Insert Delete GetRandom O(1) ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
381 Insert Delete GetRandom O(1) - Duplicates allowed ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
382 Linked List Random Node ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
383 Ransom Note ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
384 Shuffle an Array ๐Ÿค” ไธ€่ˆฌ โœ…
385 Mini Parser ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
386 Lexicographical Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
387 First Unique Character in a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
388 Longest Absolute File Path ๐Ÿค” ไธ€่ˆฌ โœ…
389 Find the Difference ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
390 Elimination Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
391 Perfect Rectangle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
392 Is Subsequence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
393 UTF-8 Validation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
394 Decode String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
395 Longest Substring with At Least K Repeating Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
396 Rotate Function ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
397 Integer Replacement ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
398 Random Pick Index ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
399 Evaluate Division ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
400 Nth Digit ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
401 Binary Watch ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
402 Remove K Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
403 Frog Jump ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
404 Sum of Left Leaves ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
405 Convert a Number to Hexadecimal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
406 Queue Reconstruction by Height ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
407 Trapping Rain Water II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
408 Valid Word Abbreviation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
409 Longest Palindrome ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
410 Split Array Largest Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
411 Minimum Unique Word Abbreviation ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
412 Fizz Buzz ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
413 Arithmetic Slices ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
414 Third Maximum Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
415 Add Strings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
416 Partition Equal Subset Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
417 Pacific Atlantic Water Flow ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
418 Sentence Screen Fitting ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
419 Battleships in a Board ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
420 Strong Password Checker ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
421 Maximum XOR of Two Numbers in an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
422 Valid Word Square ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
423 Reconstruct Original Digits from English ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
424 Longest Repeating Character Replacement ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
425 Word Squares ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
432 All O`one Data Structure ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
433 Minimum Genetic Mutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
434 Number of Segments in a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
435 Non-overlapping Intervals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
436 Find Right Interval ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
437 Path Sum III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
438 Find All Anagrams in a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
439 Ternary Expression Parser ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
440 K-th Smallest in Lexicographical Order ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
441 Arranging Coins ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
442 Find All Duplicates in an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
443 String Compression ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
444 Sequence Reconstruction ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
445 Add Two Numbers II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
446 Arithmetic Slices II - Subsequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
447 Number of Boomerangs ๐Ÿค” ไธ€่ˆฌ โœ…
448 Find All Numbers Disappeared in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
449 Serialize and Deserialize BST ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
450 Delete Node in a BST ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
451 Sort Characters By Frequency ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
452 Minimum Number of Arrows to Burst Balloons ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
453 Minimum Moves to Equal Array Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
454 4Sum II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
455 Assign Cookies ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
456 132 Pattern ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
457 Circular Array Loop ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
458 Poor Pigs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
459 Repeated Substring Pattern ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
460 LFU Cache ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
461 Hamming Distance ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
462 Minimum Moves to Equal Array Elements II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
463 Island Perimeter ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
464 Can I Win ๐Ÿค” ไธ€่ˆฌ โœ…
465 Optimal Account Balancing ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
466 Count The Repetitions ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
467 Unique Substrings in Wraparound String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
468 Validate IP Address ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
469 Convex Polygon ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
471 Encode String with Shortest Length ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
472 Concatenated Words ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
473 Matchsticks to Square ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
474 Ones and Zeroes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
475 Heaters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
476 Number Complement ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
477 Total Hamming Distance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
479 Largest Palindrome Product ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
480 Sliding Window Median ๐Ÿคฏ ๅ›ฐ้šพ โœ…
481 Magical String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
482 License Key Formatting ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
483 Smallest Good Base ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
484 Find Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
485 Max Consecutive Ones ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
486 Predict the Winner ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
487 Max Consecutive Ones II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
488 Zuma Game ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1643 Kth Smallest Instructions ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
490 The Maze ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
491 Increasing Subsequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
492 Construct the Rectangle ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
493 Reverse Pairs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
494 Target Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
495 Teemo Attacking ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
496 Next Greater Element I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
498 Diagonal Traverse ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
499 The Maze III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
500 Keyboard Row ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
501 Find Mode in Binary Search Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
502 IPO ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ†–
503 Next Greater Element II ๐Ÿค” ไธ€่ˆฌ โœ…
504 Base 7 ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
505 The Maze II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
506 Relative Ranks ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
507 Perfect Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
508 Most Frequent Subtree Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
510 Inorder Successor in BST II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2031 Count Subarrays With More Ones Than Zeros ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1059 All Paths from Source Lead to Destination ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2036 Maximum Alternating Subarray Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
513 Find Bottom Left Tree Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
514 Freedom Trail ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
515 Find Largest Value in Each Tree Row ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
516 Longest Palindromic Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
517 Super Washing Machines ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
518 Coin Change 2 ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1983 Widest Pair of Indices With Equal Range Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
520 Detect Capital ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
521 Longest Uncommon Subsequence I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
522 Longest Uncommon Subsequence II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
523 Continuous Subarray Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
524 Longest Word in Dictionary through Deleting ๐Ÿค” ไธ€่ˆฌ โœ…
525 Contiguous Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
526 Beautiful Arrangement ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
527 Word Abbreviation ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1721 Swapping Nodes in a Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
529 Minesweeper ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
530 Minimum Absolute Difference in BST ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
531 Lonely Pixel I ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
532 K-diff Pairs in an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
533 Lonely Pixel II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
535 Encode and Decode TinyURL ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
536 Construct Binary Tree from String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
537 Complex Number Multiplication ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
538 Convert BST to Greater Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
539 Minimum Time Difference ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
540 Single Element in a Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
541 Reverse String II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
542 01 Matrix ๐Ÿค” ไธ€่ˆฌ โœ…
543 Diameter of Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
544 Output Contest Matches ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
545 Boundary of Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
546 Remove Boxes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
547 Number of Provinces ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
548 Split Array with Equal Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
549 Binary Tree Longest Consecutive Sequence II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1730 Shortest Path to Get Food ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
551 Student Attendance Record I ๐Ÿคฉ ็ฎ€ๅ• โœ…
552 Student Attendance Record II ๐Ÿคฏ ๅ›ฐ้šพ โœ…
553 Optimal Division ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
554 Brick Wall ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
555 Split Concatenated Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
556 Next Greater Element III ๐Ÿค” ไธ€่ˆฌ โœ…
557 Reverse Words in a String III ๐Ÿคฉ ็ฎ€ๅ• โœ…
560 Subarray Sum Equals K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
561 Array Partition I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
562 Longest Line of Consecutive One in Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
563 Binary Tree Tilt ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
564 Find the Closest Palindrome ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
565 Array Nesting ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
566 Reshape the Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
567 Permutation in String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
568 Maximum Vacation Days ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
572 Subtree of Another Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
573 Squirrel Simulation ๐Ÿค” ไธ€่ˆฌ โœ…
575 Distribute Candies ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
576 Out of Boundary Paths ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
581 Shortest Unsorted Continuous Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
582 Kill Process ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
583 Delete Operation for Two Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
587 Erect the Fence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
588 Design In-Memory File System ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
591 Tag Validator ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
592 Fraction Addition and Subtraction ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
593 Valid Square ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
594 Longest Harmonious Subsequence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
598 Range Addition II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
599 Minimum Index Sum of Two Lists ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
600 Non-negative Integers without Consecutive Ones ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
604 Design Compressed String Iterator ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
605 Can Place Flowers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
606 Construct String from Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
609 Find Duplicate File in System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
611 Valid Triangle Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
616 Add Bold Tag in String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
617 Merge Two Binary Trees ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
621 Task Scheduler ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
623 Add One Row to Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
624 Maximum Distance in Arrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
625 Minimum Factorization ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
628 Maximum Product of Three Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
629 K Inverse Pairs Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
630 Course Schedule III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
631 Design Excel Sum Formula ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
632 Smallest Range Covering Elements from K Lists ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
633 Sum of Square Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
634 Find the Derangement of An Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
635 Design Log Storage System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
636 Exclusive Time of Functions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
637 Average of Levels in Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
638 Shopping Offers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
639 Decode Ways II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
640 Solve the Equation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
642 Design Search Autocomplete System ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
643 Maximum Average Subarray I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
644 Maximum Average Subarray II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
645 Set Mismatch ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
646 Maximum Length of Pair Chain ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
647 Palindromic Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
648 Replace Words ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
649 Dota2 Senate ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
650 2 Keys Keyboard ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
651 4 Keys Keyboard ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
652 Find Duplicate Subtrees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
653 Two Sum IV - Input is a BST ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
654 Maximum Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
655 Print Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
656 Coin Path ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
657 Robot Return to Origin ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
658 Find K Closest Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
659 Split Array into Consecutive Subsequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
660 Remove 9 ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
661 Image Smoother ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
662 Maximum Width of Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
663 Equal Tree Partition ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
664 Strange Printer ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
665 Non-decreasing Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
666 Path Sum IV ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
667 Beautiful Arrangement II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
668 Kth Smallest Number in Multiplication Table ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
669 Trim a Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
670 Maximum Swap ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
671 Second Minimum Node In a Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
672 Bulb Switcher II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
673 Number of Longest Increasing Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
674 Longest Continuous Increasing Subsequence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
675 Cut Off Trees for Golf Event ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
676 Implement Magic Dictionary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
677 Map Sum Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
678 Valid Parenthesis String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
679 24 Game ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
680 Valid Palindrome II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
681 Next Closest Time ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
682 Baseball Game ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
683 K Empty Slots ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
684 Redundant Connection ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
685 Redundant Connection II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
686 Repeated String Match ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
687 Longest Univalue Path ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
688 Knight Probability in Chessboard ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
689 Maximum Sum of 3 Non-Overlapping Subarrays ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
690 Employee Importance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
691 Stickers to Spell Word ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
692 Top K Frequent Words ๐Ÿค” ไธ€่ˆฌ โœ…
693 Binary Number with Alternating Bits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
694 Number of Distinct Islands ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
695 Max Area of Island ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
696 Count Binary Substrings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
697 Degree of an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
698 Partition to K Equal Sum Subsets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
699 Falling Squares ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
711 Number of Distinct Islands II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
712 Minimum ASCII Delete Sum for Two Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
713 Subarray Product Less Than K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
714 Best Time to Buy and Sell Stock with Transaction Fee ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
715 Range Module ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
716 Max Stack ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
717 1-bit and 2-bit Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
718 Maximum Length of Repeated Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
719 Find K-th Smallest Pair Distance ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
720 Longest Word in Dictionary ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
721 Accounts Merge ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
722 Remove Comments ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
723 Candy Crush ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
724 Find Pivot Index ๐Ÿคฉ ็ฎ€ๅ• โœ…
725 Split Linked List in Parts ๐Ÿค” ไธ€่ˆฌ โœ…
726 Number of Atoms ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
727 Minimum Window Subsequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
728 Self Dividing Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
729 My Calendar I ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
730 Count Different Palindromic Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
731 My Calendar II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
732 My Calendar III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
733 Flood Fill ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
734 Sentence Similarity ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
735 Asteroid Collision ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
736 Parse Lisp Expression ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
737 Sentence Similarity II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
738 Monotone Increasing Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
739 Daily Temperatures ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
740 Delete and Earn ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
741 Cherry Pickup ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
709 To Lower Case ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
742 Closest Leaf in a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
743 Network Delay Time ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
744 Find Smallest Letter Greater Than Target ๐Ÿคฉ ็ฎ€ๅ• โœ…
745 Prefix and Suffix Search ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
746 Min Cost Climbing Stairs ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
747 Largest Number At Least Twice of Others ๐Ÿคฉ ็ฎ€ๅ• โœ…
748 Shortest Completing Word ๐Ÿคฉ ็ฎ€ๅ• โœ…
749 Contain Virus ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
750 Number Of Corner Rectangles ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
751 IP to CIDR ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
752 Open the Lock ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
753 Cracking the Safe ๐Ÿคฏ ๅ›ฐ้šพ โœ…
754 Reach a Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
755 Pour Water ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
756 Pyramid Transition Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
426 Convert Binary Search Tree to Sorted Doubly Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
757 Set Intersection Size At Least Two ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
758 Bold Words in String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
759 Employee Free Time ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
760 Find Anagram Mappings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
761 Special Binary String ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
429 N-ary Tree Level Order Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
428 Serialize and Deserialize N-ary Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
430 Flatten a Multilevel Doubly Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
762 Prime Number of Set Bits in Binary Representation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
763 Partition Labels ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
764 Largest Plus Sign ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
765 Couples Holding Hands ๐Ÿคฏ ๅ›ฐ้šพ โœ…
431 Encode N-ary Tree to Binary Tree ๐Ÿคฏ ๅ›ฐ้šพ โœ…
427 Construct Quad Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
558 Logical OR of Two Binary Grids Represented as Quad-Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
559 Maximum Depth of N-ary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
589 N-ary Tree Preorder Traversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
590 N-ary Tree Postorder Traversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
766 Toeplitz Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
767 Reorganize String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
768 Max Chunks To Make Sorted II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
769 Max Chunks To Make Sorted ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
770 Basic Calculator IV ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
771 Jewels and Stones ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
700 Search in a Binary Search Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
701 Insert into a Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
772 Basic Calculator III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
702 Search in a Sorted Array of Unknown Size ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
773 Sliding Puzzle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
774 Minimize Max Distance to Gas Station ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
703 Kth Largest Element in a Stream ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
775 Global and Local Inversions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
776 Split BST ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
704 Binary Search ๐Ÿคฉ ็ฎ€ๅ• โœ…
777 Swap Adjacent in LR String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
778 Swim in Rising Water ๐Ÿคฏ ๅ›ฐ้šพ โœ…
779 K-th Symbol in Grammar ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
780 Reaching Points ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
781 Rabbits in Forest ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
782 Transform to Chessboard ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
783 Minimum Distance Between BST Nodes ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
784 Letter Case Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
785 Is Graph Bipartite? ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
786 K-th Smallest Prime Fraction ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
787 Cheapest Flights Within K Stops ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
788 Rotated Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
789 Escape The Ghosts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
790 Domino and Tromino Tiling ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
791 Custom Sort String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
792 Number of Matching Subsequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
793 Preimage Size of Factorial Zeroes Function ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
794 Valid Tic-Tac-Toe State ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
795 Number of Subarrays with Bounded Maximum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
796 Rotate String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
797 All Paths From Source to Target ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
798 Smallest Rotation with Highest Score ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
799 Champagne Tower ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
705 Design HashSet ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
706 Design HashMap ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
800 Similar RGB Color ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
801 Minimum Swaps To Make Sequences Increasing ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
802 Find Eventual Safe States ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
803 Bricks Falling When Hit ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
804 Unique Morse Code Words ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
805 Split Array With Same Average ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
806 Number of Lines To Write String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
807 Max Increase to Keep City Skyline ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
808 Soup Servings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
809 Expressive Words ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
810 Chalkboard XOR Game ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
811 Subdomain Visit Count ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
812 Largest Triangle Area ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
813 Largest Sum of Averages ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
814 Binary Tree Pruning ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
815 Bus Routes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
816 Ambiguous Coordinates ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
817 Linked List Components ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
818 Race Car ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
819 Most Common Word ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
707 Design Linked List ๐Ÿค” ไธ€่ˆฌ โœ…
820 Short Encoding of Words ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
821 Shortest Distance to a Character ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
822 Card Flipping Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
823 Binary Trees With Factors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
708 Insert into a Sorted Circular Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
824 Goat Latin ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
825 Friends Of Appropriate Ages ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
826 Most Profit Assigning Work ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
827 Making A Large Island ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
828 Count Unique Characters of All Substrings of a Given String ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
829 Consecutive Numbers Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
830 Positions of Large Groups ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
831 Masking Personal Information ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
641 Design Circular Deque ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
622 Design Circular Queue ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
832 Flipping an Image ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
833 Find And Replace in String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
834 Sum of Distances in Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
835 Image Overlap ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
489 Robot Room Cleaner ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
836 Rectangle Overlap ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
837 New 21 Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
838 Push Dominoes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
839 Similar String Groups ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
840 Magic Squares In Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
841 Keys and Rooms ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
842 Split Array into Fibonacci Sequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
843 Guess the Word ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
844 Backspace String Compare ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
845 Longest Mountain in Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
846 Hand of Straights ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
847 Shortest Path Visiting All Nodes ๐Ÿคฏ ๅ›ฐ้šพ โœ…
848 Shifting Letters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
849 Maximize Distance to Closest Person ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
850 Rectangle Area II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
851 Loud and Rich ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
852 Peak Index in a Mountain Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
853 Car Fleet ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
854 K-Similar Strings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
855 Exam Room ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
856 Score of Parentheses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
857 Minimum Cost to Hire K Workers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
858 Mirror Reflection ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
859 Buddy Strings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
860 Lemonade Change ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
861 Score After Flipping Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
862 Shortest Subarray with Sum at Least K ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
863 All Nodes Distance K in Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
710 Random Pick with Blacklist ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
864 Shortest Path to Get All Keys ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
865 Smallest Subtree with all the Deepest Nodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
866 Prime Palindrome ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
867 Transpose Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
868 Binary Gap ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
869 Reordered Power of 2 ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
870 Advantage Shuffle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
871 Minimum Number of Refueling Stops ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
470 Implement Rand10() Using Rand7() ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
872 Leaf-Similar Trees ๐Ÿคฉ ็ฎ€ๅ• โœ…
873 Length of Longest Fibonacci Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
874 Walking Robot Simulation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
875 Koko Eating Bananas ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
876 Middle of the Linked List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
877 Stone Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
878 Nth Magical Number ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
879 Profitable Schemes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
528 Random Pick with Weight ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
519 Random Flip Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
497 Random Point in Non-overlapping Rectangles ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
478 Generate Random Point in a Circle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
880 Decoded String at Index ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
881 Boats to Save People ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
882 Reachable Nodes In Subdivided Graph ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
883 Projection Area of 3D Shapes ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
884 Uncommon Words from Two Sentences ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
885 Spiral Matrix III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
886 Possible Bipartition ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
887 Super Egg Drop ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
888 Fair Candy Swap ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
889 Construct Binary Tree from Preorder and Postorder Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
890 Find and Replace Pattern ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
891 Sum of Subsequence Widths ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
892 Surface Area of 3D Shapes ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
893 Groups of Special-Equivalent Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
894 All Possible Full Binary Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
895 Maximum Frequency Stack ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
896 Monotonic Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
897 Increasing Order Search Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
898 Bitwise ORs of Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
899 Orderly Queue ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
900 RLE Iterator ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
901 Online Stock Span ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
902 Numbers At Most N Given Digit Set ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
903 Valid Permutations for DI Sequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
904 Fruit Into Baskets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
905 Sort Array By Parity ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
906 Super Palindromes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
907 Sum of Subarray Minimums ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
908 Smallest Range I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
909 Snakes and Ladders ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
910 Smallest Range II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
911 Online Election ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
912 Sort an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
913 Cat and Mouse ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
914 X of a Kind in a Deck of Cards ๐Ÿคฉ ็ฎ€ๅ• โœ…
915 Partition Array into Disjoint Intervals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
916 Word Subsets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
917 Reverse Only Letters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
918 Maximum Sum Circular Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
919 Complete Binary Tree Inserter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
920 Number of Music Playlists ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
921 Minimum Add to Make Parentheses Valid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
922 Sort Array By Parity II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
923 3Sum With Multiplicity ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
924 Minimize Malware Spread ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
925 Long Pressed Name ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
926 Flip String to Monotone Increasing ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
927 Three Equal Parts ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ†–
928 Minimize Malware Spread II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
929 Unique Email Addresses ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
930 Binary Subarrays With Sum ๐Ÿค” ไธ€่ˆฌ โœ…
931 Minimum Falling Path Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
932 Beautiful Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
933 Number of Recent Calls ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
934 Shortest Bridge ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
935 Knight Dialer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
936 Stamping The Sequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
937 Reorder Data in Log Files ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
938 Range Sum of BST ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
939 Minimum Area Rectangle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
940 Distinct Subsequences II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
941 Valid Mountain Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
942 DI String Match ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
943 Find the Shortest Superstring ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
944 Delete Columns to Make Sorted ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
945 Minimum Increment to Make Array Unique ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
946 Validate Stack Sequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
947 Most Stones Removed with Same Row or Column ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
948 Bag of Tokens ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
949 Largest Time for Given Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
950 Reveal Cards In Increasing Order ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
951 Flip Equivalent Binary Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
952 Largest Component Size by Common Factor ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
953 Verifying an Alien Dictionary ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
954 Array of Doubled Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
955 Delete Columns to Make Sorted II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
956 Tallest Billboard ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
957 Prison Cells After N Days ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
958 Check Completeness of a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
959 Regions Cut By Slashes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
960 Delete Columns to Make Sorted III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
961 N-Repeated Element in Size 2N Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
962 Maximum Width Ramp ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
963 Minimum Area Rectangle II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
964 Least Operators to Express Number ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
965 Univalued Binary Tree ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
966 Vowel Spellchecker ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
967 Numbers With Same Consecutive Differences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
968 Binary Tree Cameras ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
969 Pancake Sorting ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
970 Powerful Integers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
971 Flip Binary Tree To Match Preorder Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
972 Equal Rational Numbers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
509 Fibonacci Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
973 K Closest Points to Origin ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
974 Subarray Sums Divisible by K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
975 Odd Even Jump ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
976 Largest Perimeter Triangle ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
977 Squares of a Sorted Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
978 Longest Turbulent Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
979 Distribute Coins in Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
980 Unique Paths III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
981 Time Based Key-Value Store ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
982 Triples with Bitwise AND Equal To Zero ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
983 Minimum Cost For Tickets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
984 String Without AAA or BBB ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
985 Sum of Even Numbers After Queries ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
986 Interval List Intersections ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
987 Vertical Order Traversal of a Binary Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
988 Smallest String Starting From Leaf ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
989 Add to Array-Form of Integer ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
990 Satisfiability of Equality Equations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
991 Broken Calculator ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
992 Subarrays with K Different Integers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
993 Cousins in Binary Tree ๐Ÿคฉ ็ฎ€ๅ• โœ…
994 Rotting Oranges ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
995 Minimum Number of K Consecutive Bit Flips ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
996 Number of Squareful Arrays ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
997 Find the Town Judge ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
998 Maximum Binary Tree II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
999 Available Captures for Rook ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1000 Minimum Cost to Merge Stones ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1001 Grid Illumination ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1002 Find Common Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1003 Check If Word Is Valid After Substitutions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1004 Max Consecutive Ones III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1005 Maximize Sum Of Array After K Negations ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1006 Clumsy Factorial ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
1007 Minimum Domino Rotations For Equal Row ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1008 Construct Binary Search Tree from Preorder Traversal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1055 Shortest Way to Form String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1057 Campus Bikes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1058 Minimize Rounding Error to Meet Target ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1009 Complement of Base 10 Integer ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1010 Pairs of Songs With Total Durations Divisible by 60 ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1011 Capacity To Ship Packages Within D Days ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1012 Numbers With Repeated Digits ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1061 Lexicographically Smallest Equivalent String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1060 Missing Element in Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1062 Longest Repeating Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1063 Number of Valid Subarrays ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1013 Partition Array Into Three Parts With Equal Sum ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1014 Best Sightseeing Pair ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1015 Smallest Integer Divisible by K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1016 Binary String With Substrings Representing 1 To N ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1064 Fixed Point ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1066 Campus Bikes II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1067 Digit Count in Range ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1056 Confusing Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1017 Convert to Base -2 ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1018 Binary Prefix Divisible By 5 ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1019 Next Greater Node In Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1020 Number of Enclaves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1086 High Five ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1065 Index Pairs of a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1087 Brace Expansion ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1088 Confusing Number II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1021 Remove Outermost Parentheses ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1022 Sum of Root To Leaf Binary Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1023 Camelcase Matching ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1024 Video Stitching ๐Ÿค” ไธ€่ˆฌ โœ…
1085 Sum of Digits in the Minimum Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1099 Two Sum Less Than K ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1100 Find K-Length Substrings With No Repeated Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1101 The Earliest Moment When Everyone Become Friends ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1025 Divisor Game ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1027 Longest Arithmetic Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1118 Number of Days in a Month ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1119 Remove Vowels from a String ๐Ÿคฉ ็ฎ€ๅ• โœ…
1134 Armstrong Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1120 Maximum Average Subtree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1026 Maximum Difference Between Node and Ancestor ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1028 Recover a Tree From Preorder Traversal ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1030 Matrix Cells in Distance Order ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ†–
1029 Two City Scheduling ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1031 Maximum Sum of Two Non-Overlapping Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1032 Stream of Characters ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1133 Largest Unique Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1102 Path With Maximum Minimum Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1135 Connecting Cities With Minimum Cost ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1136 Parallel Courses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1150 Check If a Number Is Majority Element in a Sorted Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1033 Moving Stones Until Consecutive ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1034 Coloring A Border ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1035 Uncrossed Lines ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
1036 Escape a Large Maze ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1151 Minimum Swaps to Group All 1's Together ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1152 Analyze User Website Visit Pattern ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1039 Minimum Score Triangulation of Polygon ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1160 Find Words That Can Be Formed by Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1040 Moving Stones Until Consecutive II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1038 Binary Search Tree to Greater Sum Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1037 Valid Boomerang ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1161 Maximum Level Sum of a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1162 As Far from Land as Possible ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1121 Divide Array Into Increasing Sequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1041 Robot Bounded In Circle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1042 Flower Planting With No Adjacent ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1043 Partition Array for Maximum Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1044 Longest Duplicate Substring ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1165 Single-Row Keyboard ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1153 String Transforms Into Another String ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1166 Design File System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1167 Minimum Cost to Connect Sticks ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1046 Last Stone Weight ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1047 Remove All Adjacent Duplicates In String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1048 Longest String Chain ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1049 Last Stone Weight II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1180 Count Substrings with Only One Distinct Letter ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1181 Before and After Puzzle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1163 Last Substring in Lexicographical Order ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1182 Shortest Distance to Target Color ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1051 Height Checker ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1052 Grumpy Bookstore Owner ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1053 Previous Permutation With One Swap ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1054 Distant Barcodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1196 How Many Apples Can You Put into the Basket ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1197 Minimum Knight Moves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1198 Find Smallest Common Element in All Rows ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1168 Optimize Water Distribution in a Village ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1074 Number of Submatrices That Sum to Target ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1071 Greatest Common Divisor of Strings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1072 Flip Columns For Maximum Number of Equal Rows ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1073 Adding Two Negabinary Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1213 Intersection of Three Sorted Arrays ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1214 Two Sum BSTs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1215 Stepping Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1183 Maximum Number of Ones ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1078 Occurrences After Bigram ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1080 Insufficient Nodes in Root to Leaf Paths ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1081 Smallest Subsequence of Distinct Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ†–
1079 Letter Tile Possibilities ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1228 Missing Number In Arithmetic Progression ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1229 Meeting Scheduler ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1230 Toss Strange Coins ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1199 Minimum Time to Build Blocks ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1089 Duplicate Zeros ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1090 Largest Values From Labels ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1092 Shortest Common Supersequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1091 Shortest Path in Binary Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1243 Array Transformation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1244 Design A Leaderboard ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1245 Tree Diameter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1216 Valid Palindrome III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1093 Statistics from a Large Sample ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1094 Car Pooling ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1095 Find in Mountain Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1096 Brace Expansion II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1256 Encode Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1257 Smallest Common Region ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1258 Synonymous Sentences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1231 Divide Chocolate ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1104 Path In Zigzag Labelled Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1103 Distribute Candies to People ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1105 Filling Bookcase Shelves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1106 Parsing A Boolean Expression ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1271 Hexspeak ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1272 Remove Interval ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1273 Delete Tree Nodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1246 Palindrome Removal ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1108 Defanging an IP Address ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1109 Corporate Flight Bookings ๐Ÿค” ไธ€่ˆฌ โœ…
1110 Delete Nodes And Return Forest ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1111 Maximum Nesting Depth of Two Valid Parentheses Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1619 Mean of Array After Removing Some Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1286 Iterator for Combination ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1291 Sequential Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1259 Handshakes That Don't Cross ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1122 Relative Sort Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1123 Lowest Common Ancestor of Deepest Leaves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1124 Longest Well-Performing Interval ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1125 Smallest Sufficient Team ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1287 Element Appearing More Than 25% In Sorted Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1288 Remove Covered Intervals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1627 Graph Connectivity With Threshold ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1289 Minimum Falling Path Sum II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1128 Number of Equivalent Domino Pairs ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1130 Minimum Cost Tree From Leaf Values ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1129 Shortest Path with Alternating Colors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1131 Maximum of Absolute Value Expression ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1299 Replace Elements with Greatest Element on Right Side ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1300 Sum of Mutated Array Closest to Target ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1274 Number of Ships in a Rectangle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1301 Number of Paths with Max Score ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1137 N-th Tribonacci Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1138 Alphabet Board Path ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1139 Largest 1-Bordered Square ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1140 Stone Game II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1313 Decompress Run-Length Encoded List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1314 Matrix Block Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1315 Sum of Nodes with Even-Valued Grandparent ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1316 Distinct Echo Substrings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1144 Decrease Elements To Make Array Zigzag ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1145 Binary Tree Coloring Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1146 Snapshot Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1143 Longest Common Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1147 Longest Chunked Palindrome Decomposition ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1328 Break a Palindrome ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1329 Sort the Matrix Diagonally ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1302 Deepest Leaves Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1330 Reverse Subarray To Maximize Array Value ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1331 Rank Transform of an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1632 Rank Transform of a Matrix ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1154 Day of the Year ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1156 Swap For Longest Repeated Character Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1157 Online Majority Element In Subarray ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1155 Number of Dice Rolls With Target Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1935 Maximum Number of Words You Can Type ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1171 Remove Zero Sum Consecutive Nodes from Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1172 Dinner Plate Stacks ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1236 Web Crawler ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1169 Invalid Transactions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1170 Compare Strings by Frequency of the Smallest Character ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1360 Number of Days Between Two Dates ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1361 Validate Binary Tree Nodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1362 Closest Divisors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1363 Largest Multiple of Three ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1175 Prime Arrangements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1176 Diet Plan Performance ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1177 Can Make Palindrome from Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1178 Number of Valid Words for Each Puzzle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1507 Reformat Date ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1390 Four Divisors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1382 Balance a Binary Search Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1425 Constrained Subsequence Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1184 Distance Between Bus Stops ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1186 Maximum Subarray Sum with One Deletion ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1185 Day of the Week ๐Ÿคฉ ็ฎ€ๅ• โœ…
1187 Make Array Strictly Increasing ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1550 Three Consecutive Odds ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2080 Range Frequency Queries ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1954 Minimum Garden Perimeter to Collect Enough Apples ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1483 Kth Ancestor of a Tree Node ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1189 Maximum Number of Balloons ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1190 Reverse Substrings Between Each Pair of Parentheses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1191 K-Concatenation Maximum Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1192 Critical Connections in a Network ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1957 Delete Characters to Make Fancy String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2139 Minimum Moves to Reach Target Score ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1405 Longest Happy String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1944 Number of Visible People in a Queue ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1200 Minimum Absolute Difference ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1201 Ugly Number III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1202 Smallest String With Swaps ๐Ÿค” ไธ€่ˆฌ โœ…
1203 Sort Items by Groups Respecting Dependencies ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2079 Watering Plants ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1895 Largest Magic Square ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1916 Count Ways to Build Rooms in an Ant Colony ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1207 Unique Number of Occurrences ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1209 Remove All Adjacent Duplicates in String II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1208 Get Equal Substrings Within Budget ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1210 Minimum Moves to Reach Target with Rotations ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1706 Where Will the Ball Fall ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1514 Path with Maximum Probability ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1862 Sum of Floored Pairs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1217 Minimum Cost to Move Chips to The Same Position ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1218 Longest Arithmetic Subsequence of Given Difference ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1219 Path with Maximum Gold ๐Ÿค” ไธ€่ˆฌ โœ…
1220 Count Vowels Permutation ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1960 Maximum Product of the Length of Two Palindromic Substrings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1206 Design Skiplist ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1221 Split a String in Balanced Strings ๐Ÿคฉ ็ฎ€ๅ• โœ…
1222 Queens That Can Attack the King ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1223 Dice Roll Simulation ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1224 Maximum Equal Frequency ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1427 Perform String Shifts ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1232 Check If It Is a Straight Line ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1233 Remove Sub-Folders from the Filesystem ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1234 Replace the Substring for Balanced String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1235 Maximum Profit in Job Scheduling ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1237 Find Positive Integer Solution for a Given Equation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1238 Circular Permutation in Binary Representation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1239 Maximum Length of a Concatenated String with Unique Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1240 Tiling a Rectangle with the Fewest Squares ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1227 Airplane Seat Assignment Probability ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1726 Tuple with Same Product ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1429 First Unique Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1691 Maximum Height by Stacking Cuboids ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1247 Minimum Swaps to Make Strings Equal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1248 Count Number of Nice Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1249 Minimum Remove to Make Valid Parentheses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1250 Check If It Is a Good Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1428 Leftmost Column with at Least a One ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1252 Cells with Odd Values in a Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1253 Reconstruct a 2-Row Binary Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1254 Number of Closed Islands ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1255 Maximum Score Words Formed by Letters ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1618 Maximum Font to Fit a Sentence in a Screen ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1260 Shift 2D Grid ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1261 Find Elements in a Contaminated Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1262 Greatest Sum Divisible by Three ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1263 Minimum Moves to Move a Box to Their Target Location ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1426 Counting Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1266 Minimum Time Visiting All Points ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1267 Count Servers that Communicate ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1268 Search Suggestions System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1269 Number of Ways to Stay in the Same Place After Some Steps ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1275 Find Winner on a Tic Tac Toe Game ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1276 Number of Burgers with No Waste of Ingredients ๐Ÿค” ไธ€่ˆฌ โœ…
1277 Count Square Submatrices with All Ones ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1278 Palindrome Partitioning III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1265 Print Immutable Linked List in Reverse ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1281 Subtract the Product and Sum of Digits of an Integer ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1282 Group the People Given the Group Size They Belong To ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1283 Find the Smallest Divisor Given a Threshold ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1284 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1290 Convert Binary Number in a Linked List to Integer ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1292 Maximum Side Length of a Square with Sum Less than or Equal to Threshold ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1293 Shortest Path in a Grid with Obstacles Elimination ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1295 Find Numbers with Even Number of Digits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1296 Divide Array in Sets of K Consecutive Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1297 Maximum Number of Occurrences of a Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1298 Maximum Candies You Can Get from Boxes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1304 Find N Unique Integers Sum up to Zero ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1305 All Elements in Two Binary Search Trees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1306 Jump Game III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1307 Verbal Arithmetic Puzzle ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1430 Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1309 Decrypt String from Alphabet to Integer Mapping ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1310 XOR Queries of a Subarray ๐Ÿค” ไธ€่ˆฌ โœ…
1311 Get Watched Videos by Your Friends ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1312 Minimum Insertion Steps to Make a String Palindrome ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1317 Convert Integer to the Sum of Two No-Zero Integers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1318 Minimum Flips to Make a OR b Equal to c ๐Ÿค” ไธ€่ˆฌ โœ…
1319 Number of Operations to Make Network Connected ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1320 Minimum Distance to Type a Word Using Two Fingers ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1342 Number of Steps to Reduce a Number to Zero ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1343 Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1344 Angle Between Hands of a Clock ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1345 Jump Game IV ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1323 Maximum 69 Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1324 Print Words Vertically ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1325 Delete Leaves With a Given Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1326 Minimum Number of Taps to Open to Water a Garden ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1332 Remove Palindromic Subsequences ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1333 Filter Restaurants by Vegan-Friendly, Price and Distance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1335 Minimum Difficulty of a Job Schedule ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1356 Sort Integers by The Number of 1 Bits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1357 Apply Discount Every n Orders ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1358 Number of Substrings Containing All Three Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1359 Count All Valid Pickup and Delivery Options ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1337 The K Weakest Rows in a Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1338 Reduce Array Size to The Half ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1339 Maximum Product of Splitted Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1340 Jump Game V ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1346 Check If N and Its Double Exist ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1347 Minimum Number of Steps to Make Two Strings Anagram ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1348 Tweet Counts Per Frequency ๐Ÿค” ไธ€่ˆฌ โœ…
1349 Maximum Students Taking Exam ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1370 Increasing Decreasing String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1371 Find the Longest Substring Containing Vowels in Even Counts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1372 Longest ZigZag Path in a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1373 Maximum Sum BST in Binary Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1351 Count Negative Numbers in a Sorted Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1352 Product of the Last K Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1353 Maximum Number of Events That Can Be Attended ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1354 Construct Target Array With Multiple Sums ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1365 How Many Numbers Are Smaller Than the Current Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1366 Rank Teams by Votes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1367 Linked List in Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1368 Minimum Cost to Make at Least One Valid Path in a Grid ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1385 Find the Distance Value Between Two Arrays ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1386 Cinema Seat Allocation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1387 Sort Integers by The Power Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1388 Pizza With 3n Slices ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1374 Generate a String With Characters That Have Odd Counts ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1375 Number of Times Binary String Is Prefix-Aligned ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1376 Time Needed to Inform All Employees ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1377 Frog Position After T Seconds ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1380 Lucky Numbers in a Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1381 Design a Stack With Increment Operation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1379 Find a Corresponding Node of a Binary Tree in a Clone of That Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1383 Maximum Performance of a Team ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1399 Count Largest Group ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1401 Circle and Rectangle Overlapping ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1400 Construct K Palindrome Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1402 Reducing Dishes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1389 Create Target Array in the Given Order ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1391 Check if There is a Valid Path in a Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1392 Longest Happy Prefix ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1394 Find Lucky Integer in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1395 Count Number of Teams ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1396 Design Underground System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1397 Find All Good Strings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1413 Minimum Value to Get Positive Step by Step Sum ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1414 Find the Minimum Number of Fibonacci Numbers Whose Sum Is K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1415 The k-th Lexicographical String of All Happy Strings of Length n ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1416 Restore The Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1403 Minimum Subsequence in Non-Increasing Order ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1404 Number of Steps to Reduce a Number in Binary Representation to One ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1406 Stone Game III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1408 String Matching in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1409 Queries on a Permutation With Key ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1410 HTML Entity Parser ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1411 Number of Ways to Paint N ร— 3 Grid ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1431 Kids With the Greatest Number of Candies ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1432 Max Difference You Can Get From Changing an Integer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1433 Check If a String Can Break Another String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1434 Number of Ways to Wear Different Hats to Each Other ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1417 Reformat The String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1418 Display Table of Food Orders in a Restaurant ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1419 Minimum Number of Frogs Croaking ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1420 Build Array Where You Can Find The Maximum Exactly K Comparisons ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1422 Maximum Score After Splitting a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1423 Maximum Points You Can Obtain from Cards ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1424 Diagonal Traverse II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1446 Consecutive Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1447 Simplified Fractions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1448 Count Good Nodes in Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1449 Form Largest Integer With Digits That Add up to Target ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1436 Destination City ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1437 Check If All 1's Are at Least Length K Places Away ๐Ÿคฉ ็ฎ€ๅ• โœ…
1438 Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1439 Find the Kth Smallest Sum of a Matrix With Sorted Rows ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1441 Build an Array With Stack Operations ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1442 Count Triplets That Can Form Two Arrays of Equal XOR ๐Ÿค” ไธ€่ˆฌ โœ…
1443 Minimum Time to Collect All Apples in a Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1444 Number of Ways of Cutting a Pizza ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1460 Make Two Arrays Equal by Reversing Sub-arrays ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1461 Check If a String Contains All Binary Codes of Size K ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1462 Course Schedule IV ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1463 Cherry Pickup II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1450 Number of Students Doing Homework at a Given Time ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1451 Rearrange Words in a Sentence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1452 People Whose List of Favorite Companies Is Not a Subset of Another List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1453 Maximum Number of Darts Inside of a Circular Dartboard ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1455 Check If a Word Occurs As a Prefix of Any Word in a Sentence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1456 Maximum Number of Vowels in a Substring of Given Length ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1457 Pseudo-Palindromic Paths in a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1458 Max Dot Product of Two Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1475 Final Prices With a Special Discount in a Shop ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1478 Allocate Mailboxes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1476 Subrectangle Queries ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1477 Find Two Non-overlapping Sub-arrays Each With Target Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1464 Maximum Product of Two Elements in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1465 Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1466 Reorder Routes to Make All Paths Lead to the City Zero ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1467 Probability of a Two Boxes Having The Same Number of Distinct Balls ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1470 Shuffle the Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1471 The k Strongest Values in an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1472 Design Browser History ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1473 Paint House III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1491 Average Salary Excluding the Minimum and Maximum Salary ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1492 The kth Factor of n ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1493 Longest Subarray of 1's After Deleting One Element ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1494 Parallel Courses II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1480 Running Sum of 1d Array ๐Ÿคฉ ็ฎ€ๅ• โœ…
1481 Least Number of Unique Integers after K Removals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1482 Minimum Number of Days to Make m Bouquets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1469 Find All The Lonely Nodes ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1486 XOR Operation in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1487 Making File Names Unique ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1488 Avoid Flood in The City ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1508 Range Sum of Sorted Subarray Sums ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1509 Minimum Difference Between Largest and Smallest Value in Three Moves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1510 Stone Game IV ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1474 Delete N Nodes After M Nodes of a Linked List ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1496 Path Crossing ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1497 Check If Array Pairs Are Divisible by k ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1498 Number of Subsequences That Satisfy the Given Sum Condition ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1499 Max Value of Equation ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1485 Clone Binary Tree With Random Pointer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1502 Can Make Arithmetic Progression From Sequence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1503 Last Moment Before All Ants Fall Out of a Plank ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1504 Count Submatrices With All Ones ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1505 Minimum Possible Integer After at Most K Adjacent Swaps On Digits ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1523 Count Odd Numbers in an Interval Range ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1524 Number of Sub-arrays With Odd Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1525 Number of Good Ways to Split a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1526 Minimum Number of Increments on Subarrays to Form a Target Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1490 Clone N-ary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1512 Number of Good Pairs ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1513 Number of Substrings With Only 1s ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1531 String Compression II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1515 Best Position for a Service Centre ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1500 Design a File Sharing System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1518 Water Bottles ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1519 Number of Nodes in the Sub-Tree With the Same Label ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1520 Maximum Number of Non-Overlapping Substrings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1521 Find a Value of a Mysterious Function Closest to Target ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1539 Kth Missing Positive Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1540 Can Convert String in K Moves ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1541 Minimum Insertions to Balance a Parentheses String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1546 Maximum Number of Non-Overlapping Subarrays With Sum Equals Target ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1506 Find Root of N-Ary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1528 Shuffle String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1529 Minimum Suffix Flips ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1530 Number of Good Leaf Nodes Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1516 Move Sub-Tree of N-Ary Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1534 Count Good Triplets ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1535 Find the Winner of an Array Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1536 Minimum Swaps to Arrange a Binary Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1537 Get the Maximum Score ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1556 Thousand Separator ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1557 Minimum Number of Vertices to Reach All Nodes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1558 Minimum Numbers of Function Calls to Make Target Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1559 Detect Cycles in 2D Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1522 Diameter of N-Ary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1544 Make The String Great ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1545 Find Kth Bit in Nth Binary String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1542 Find Longest Awesome Substring ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1547 Minimum Cost to Cut a Stick ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1533 Find the Index of the Large Integer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1551 Minimum Operations to Make Array Equal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1552 Magnetic Force Between Two Balls ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1553 Minimum Number of Days to Eat N Oranges ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1572 Matrix Diagonal Sum ๐Ÿคฉ ็ฎ€ๅ• โœ…
1573 Number of Ways to Split a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1574 Shortest Subarray to be Removed to Make Array Sorted ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1575 Count All Possible Routes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1538 Guess the Majority in a Hidden Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1560 Most Visited Sector in a Circular Track ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1561 Maximum Number of Coins You Can Get ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1562 Find Latest Group of Size M ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1563 Stone Game V ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1548 The Most Similar Path in a Graph ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1566 Detect Pattern of Length M Repeated K or More Times ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1567 Maximum Length of Subarray With Positive Product ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1568 Minimum Number of Days to Disconnect Island ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1569 Number of Ways to Reorder Array to Get Same BST ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1588 Sum of All Odd Length Subarrays ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1590 Make Sum Divisible by P ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1589 Maximum Sum Obtained of Any Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1591 Strange Printer II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1554 Strings Differ by One Character ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1576 Replace All ?'s to Avoid Consecutive Repeating Characters ๐Ÿคฉ ็ฎ€ๅ• โœ…
1577 Number of Ways Where Square of Number Is Equal to Product of Two Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1578 Minimum Time to Make Rope Colorful ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1579 Remove Max Number of Edges to Keep Graph Fully Traversable ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1564 Put Boxes Into the Warehouse I ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1582 Special Positions in a Binary Matrix ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1583 Count Unhappy Friends ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1584 Min Cost to Connect All Points ๐Ÿค” ไธ€่ˆฌ โœ…
1585 Check If String Is Transformable With Substring Sort Operations ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1603 Design Parking System ๐Ÿคฉ ็ฎ€ๅ• โœ…
1604 Alert Using Same Key-Card Three or More Times in a One Hour Period ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1606 Find Servers That Handled Most Number of Requests ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1605 Find Valid Matrix Given Row and Column Sums ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1570 Dot Product of Two Sparse Vectors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1592 Rearrange Spaces Between Words ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1593 Split a String Into the Max Number of Unique Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1594 Maximum Non Negative Product in a Matrix ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1595 Minimum Cost to Connect Two Groups of Points ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1580 Put Boxes Into the Warehouse II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1598 Crawler Log Folder ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1599 Maximum Profit of Operating a Centennial Wheel ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1600 Throne Inheritance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1601 Maximum Number of Achievable Transfer Requests ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1621 Number of Sets of K Non-Overlapping Line Segments ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1620 Coordinate With Maximum Network Quality ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1728 Cat and Mouse II ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1622 Fancy Sequence ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1586 Binary Search Tree Iterator II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1608 Special Array With X Elements Greater Than or Equal X ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1609 Even Odd Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1611 Minimum One Bit Operations to Make Integers Zero ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1610 Maximum Number of Visible Points ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1597 Build Binary Expression Tree From Infix Expression ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1614 Maximum Nesting Depth of the Parentheses ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1615 Maximal Network Rank ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1616 Split Two Strings to Make Palindrome ๐Ÿค” ไธ€่ˆฌ โœ…
1617 Count Subtrees With Max Distance Between Cities ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1636 Sort Array by Increasing Frequency ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1637 Widest Vertical Area Between Two Points Containing No Points ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1638 Count Substrings That Differ by One Character ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1639 Number of Ways to Form a Target String Given a Dictionary ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1602 Find Nearest Right Node in Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1624 Largest Substring Between Two Equal Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1625 Lexicographically Smallest String After Applying Operations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1626 Best Team With No Conflicts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1612 Check If Two Expression Trees are Equivalent ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1629 Slowest Key ๐Ÿคฉ ็ฎ€ๅ• โœ…
1630 Arithmetic Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1631 Path With Minimum Effort ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1652 Defuse the Bomb ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1653 Minimum Deletions to Make String Balanced ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1654 Minimum Jumps to Reach Home ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1655 Distribute Repeating Integers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1640 Check Array Formation Through Concatenation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1641 Count Sorted Vowel Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1642 Furthest Building You Can Reach ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1668 Maximum Repeating Substring ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1669 Merge In Between Linked Lists ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1671 Minimum Number of Removals to Make Mountain Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1670 Design Front Middle Back Queue ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1628 Design an Expression Tree With Evaluate Function ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1646 Get Maximum in Generated Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1647 Minimum Deletions to Make Character Frequencies Unique ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1648 Sell Diminishing-Valued Colored Balls ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1649 Create Sorted Array through Instructions ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1634 Add Two Polynomials Represented as Linked Lists ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1656 Design an Ordered Stream ๐Ÿคฉ ็ฎ€ๅ• โœ…
1658 Minimum Operations to Reduce X to Zero ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1657 Determine if Two Strings Are Close ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1659 Maximize Grid Happiness ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1644 Lowest Common Ancestor of a Binary Tree II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1662 Check If Two String Arrays are Equivalent ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1663 Smallest String With A Given Numeric Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1664 Ways to Make a Fair Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1665 Minimum Initial Energy to Finish Tasks ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1684 Count the Number of Consistent Strings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1685 Sum of Absolute Differences in a Sorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1686 Stone Game VI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1687 Delivering Boxes from Storage to Ports ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1650 Lowest Common Ancestor of a Binary Tree III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1672 Richest Customer Wealth ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1673 Find the Most Competitive Subsequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1674 Minimum Moves to Make Array Complementary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1675 Minimize Deviation in Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1660 Correct a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1678 Goal Parser Interpretation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1679 Max Number of K-Sum Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1681 Minimum Incompatibility ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1680 Concatenation of Consecutive Binary Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1700 Number of Students Unable to Eat Lunch ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1701 Average Waiting Time ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1702 Maximum Binary String After Change ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1703 Minimum Adjacent Swaps for K Consecutive Ones ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1688 Count of Matches in Tournament ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1689 Partitioning Into Minimum Number Of Deci-Binary Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1690 Stone Game VII ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1714 Sum Of Special Evenly-Spaced Elements In Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1666 Change the Root of a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1694 Reformat Phone Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1695 Maximum Erasure Value ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1696 Jump Game VI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1697 Checking Existence of Edge Length Limited Paths ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1676 Lowest Common Ancestor of a Binary Tree IV ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1716 Calculate Money in Leetcode Bank ๐Ÿคฉ ็ฎ€ๅ• โœ…
1717 Maximum Score From Removing Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1718 Construct the Lexicographically Largest Valid Sequence ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1719 Number Of Ways To Reconstruct A Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1682 Longest Palindromic Subsequence II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1704 Determine if String Halves Are Alike ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1705 Maximum Number of Eaten Apples ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1723 Find Minimum Time to Finish All Jobs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1707 Maximum XOR With an Element From Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1692 Count Ways to Distribute Candies ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1710 Maximum Units on a Truck ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1711 Count Good Meals ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1712 Ways to Split Array Into Three Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1713 Minimum Operations to Make a Subsequence ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1732 Find the Highest Altitude ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1733 Minimum Number of People to Teach ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1734 Decode XORed Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1735 Count Ways to Make Array With Product ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1698 Number of Distinct Substrings in a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1720 Decode XORed Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1722 Minimize Hamming Distance After Swap Operations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1725 Number Of Rectangles That Can Form The Largest Square ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1742 Maximum Number of Balls in a Box ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1727 Largest Submatrix With Rearrangements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1708 Largest Subarray Length K ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1748 Sum of Unique Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1749 Maximum Absolute Sum of Any Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1750 Minimum Length of String After Deleting Similar Ends ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1751 Maximum Number of Events That Can Be Attended II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1736 Latest Time by Replacing Hidden Digits ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1737 Change Minimum Characters to Satisfy One of Three Conditions ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1738 Find Kth Largest XOR Coordinate Value ๐Ÿค” ไธ€่ˆฌ โœ…
1739 Building Boxes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1724 Checking Existence of Edge Length Limited Paths II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1743 Restore the Array From Adjacent Pairs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1745 Palindrome Partitioning IV ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1744 Can You Eat Your Favorite Candy on Your Favorite Day? ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1763 Longest Nice Substring ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1764 Form Array by Concatenating Subarrays of Another Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1766 Tree of Coprimes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1765 Map of Highest Peak ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1752 Check if Array Is Sorted and Rotated ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1753 Maximum Score From Removing Stones ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1754 Largest Merge Of Two Strings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1755 Closest Subsequence Sum ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1740 Find Distance in a Binary Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1758 Minimum Changes To Make Alternating Binary String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1759 Count Number of Homogenous Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1760 Minimum Limit of Balls in a Bag ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1761 Minimum Degree of a Connected Trio in a Graph ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1779 Find Nearest Point That Has the Same X or Y Coordinate ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1780 Check if Number is a Sum of Powers of Three ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1781 Sum of Beauty of All Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1782 Count Pairs Of Nodes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1746 Maximum Subarray Sum After One Operation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1768 Merge Strings Alternately ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1769 Minimum Number of Operations to Move All Balls to Each Box ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1770 Maximum Score from Performing Multiplication Operations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1771 Maximize Palindrome Length From Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1773 Count Items Matching a Rule ๐Ÿคฉ ็ฎ€ๅ• โœ…
1774 Closest Dessert Cost ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1775 Equal Sum Arrays With Minimum Number of Operations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1776 Car Fleet II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1756 Design Most Recently Used Queue ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1796 Second Largest Digit in a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1797 Design Authentication Manager ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1799 Maximize Score After N Operations ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1803 Count Pairs With XOR in a Range ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1762 Buildings With an Ocean View ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1784 Check if Binary String Has at Most One Segment of Ones ๐Ÿคฉ ็ฎ€ๅ• โœ…
1785 Minimum Elements to Add to Form a Given Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1786 Number of Restricted Paths From First to Last Node ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1787 Make the XOR of All Segments Equal to Zero ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1790 Check if One String Swap Can Make Strings Equal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1791 Find Center of Star Graph ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1792 Maximum Average Pass Ratio ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1793 Maximum Score of a Good Subarray ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1772 Sort Features by Popularity ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1812 Determine Color of a Chessboard Square ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1813 Sentence Similarity III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1815 Maximum Number of Groups Getting Fresh Donuts ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1814 Count Nice Pairs in an Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1800 Maximum Ascending Subarray Sum ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1801 Number of Orders in the Backlog ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1802 Maximum Value at a Given Index in a Bounded Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1798 Maximum Number of Consecutive Values You Can Make ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1778 Shortest Path in a Hidden Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1805 Number of Different Integers in a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1807 Evaluate the Bracket Pairs of a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1806 Minimum Number of Operations to Reinitialize a Permutation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1808 Maximize Number of Nice Divisors ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1788 Maximize the Beauty of the Garden ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1827 Minimum Operations to Make the Array Increasing ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1828 Queries on Number of Points Inside a Circle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1829 Maximum XOR for Each Query ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1830 Minimum Number of Operations to Make String Sorted ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1794 Count Pairs of Equal Substrings With Minimum Difference ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1816 Truncate Sentence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1817 Finding the Users Active Minutes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1818 Minimum Absolute Sum Difference ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1819 Number of Different Subsequences GCDs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1804 Implement Trie II (Prefix Tree) ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1822 Sign of the Product of an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1823 Find the Winner of the Circular Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1824 Minimum Sideway Jumps ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1825 Finding MK Average ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1844 Replace All Digits with Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1845 Seat Reservation Manager ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1846 Maximum Element After Decreasing and Rearranging ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1847 Closest Room ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1810 Minimum Path Cost in a Hidden Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1832 Check if the Sentence Is Pangram ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1833 Maximum Ice Cream Bars ๐Ÿค” ไธ€่ˆฌ โœ…
1834 Single-Threaded CPU ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1835 Find XOR Sum of All Pairs Bitwise AND ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1837 Sum of Digits in Base K ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1838 Frequency of the Most Frequent Element ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1839 Longest Substring Of All Vowels in Order ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1840 Maximum Building Height ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1820 Maximum Number of Accepted Invitations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1859 Sorting the Sentence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1860 Incremental Memory Leak ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1861 Rotating the Box ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1848 Minimum Distance to the Target Element ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1849 Splitting a String Into Descending Consecutive Values ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1851 Minimum Interval to Include Each Query ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1850 Minimum Adjacent Swaps to Reach the Kth Smallest Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1989 Maximum Number of People That Can Be Caught in Tag ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1826 Faulty Sensor ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1836 Remove Duplicates From an Unsorted Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1854 Maximum Population Year ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1855 Maximum Distance Between a Pair of Values ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1856 Maximum Subarray Min-Product ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1857 Largest Color Value in a Directed Graph ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1876 Substrings of Size Three with Distinct Characters ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1877 Minimize Maximum Pair Sum in Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1879 Minimum XOR Sum of Two Arrays ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1878 Get Biggest Three Rhombus Sums in a Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2046 Sort Linked List Already Sorted Using Absolute Values ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1863 Sum of All Subset XOR Totals ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1864 Minimum Number of Swaps to Make the Binary String Alternating ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1865 Finding Pairs With a Certain Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1866 Number of Ways to Rearrange Sticks With K Sticks Visible ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1842 Next Palindrome Using Same Digits ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1869 Longer Contiguous Segments of Ones than Zeros ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1870 Minimum Speed to Arrive on Time ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1871 Jump Game VII ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1872 Stone Game VIII ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1852 Distinct Numbers in Each Subarray ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1893 Check if All the Integers in a Range Are Covered ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1894 Find the Student that Will Replace the Chalk ๐Ÿค” ไธ€่ˆฌ โœ…
1896 Minimum Cost to Change the Final Value of Expression ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1858 Longest Word With All Prefixes ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1880 Check if Word Equals Summation of Two Words ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1881 Maximum Value after Insertion ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1882 Process Tasks Using Servers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1883 Minimum Skips to Arrive at Meeting On Time ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1886 Determine Whether Matrix Can Be Obtained By Rotation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1887 Reduction Operations to Make the Array Elements Equal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1888 Minimum Number of Flips to Make the Binary String Alternating ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1889 Minimum Space Wasted From Packaging ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1868 Product of Two Run-Length Encoded Arrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1909 Remove One Element to Make the Array Strictly Increasing ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1910 Remove All Occurrences of a Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1911 Maximum Alternating Subsequence Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1912 Design Movie Rental System ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1897 Redistribute Characters to Make All Strings Equal ๐Ÿคฉ ็ฎ€ๅ• โœ…
1899 Merge Triplets to Form Target Triplet ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1898 Maximum Number of Removable Characters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1900 The Earliest and Latest Rounds Where Players Compete ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1874 Minimize Product Sum of Two Arrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1884 Egg Drop With 2 Eggs and N Floors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1903 Largest Odd Number in String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1904 The Number of Full Rounds You Have Played ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1906 Minimum Absolute Difference Queries ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1905 Count Sub Islands ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1885 Count Pairs in Two Arrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1925 Count Square Sum Triples ๐Ÿคฉ ็ฎ€ๅ• โœ…
1926 Nearest Exit from Entrance in Maze ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1927 Sum Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1928 Minimum Cost to Reach Destination in Time ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1913 Maximum Product Difference Between Two Pairs ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1914 Cyclically Rotating a Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1915 Number of Wonderful Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1891 Cutting Ribbons ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1901 Find a Peak Element II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1920 Build Array from Permutation ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1921 Eliminate Maximum Number of Monsters ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1922 Count Good Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1923 Longest Common Subpath ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1902 Depth of BST Given Insertion Order ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1941 Check if All Characters Have Equal Number of Occurrences ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1942 The Number of the Smallest Unoccupied Chair ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1943 Describe the Painting ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1929 Concatenation of Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1930 Unique Length-3 Palindromic Subsequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1932 Merge BSTs to Create Single BST ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1931 Painting a Grid With Three Different Colors ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1908 Game of Nim ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1936 Add Minimum Number of Rungs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1937 Maximum Number of Points with Cost ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1938 Maximum Genetic Difference Query ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1918 Kth Smallest Subarray Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1933 Check if String Is Decomposable Into Value-Equal Substrings ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1940 Longest Common Subsequence Between Sorted Arrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1950 Maximum of Minimum Values in All Subarrays ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1956 Minimum Time For K Virus Variants to Spread ๐Ÿคฏ ๅ›ฐ้šพ โœ…
1924 Erect the Fence II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2021 Brightest Position on Street ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1945 Sum of Digits of String After Convert ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1946 Largest Number After Mutating Substring ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1947 Maximum Compatibility Score Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1948 Delete Duplicate Folders in System ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1958 Check if Move is Legal ๐Ÿค” ไธ€่ˆฌ โœ…
1959 Minimum Total Space Wasted With K Resizing Operations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2052 Minimum Cost to Separate Sentence Into Rows ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1952 Three Divisors ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1953 Maximum Number of Weeks for Which You Can Work ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1968 Array With Elements Not Equal to Average of Neighbors ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1955 Count Number of Special Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1974 Minimum Time to Type Word Using Special Typewriter ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1975 Maximum Matrix Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1976 Number of Ways to Arrive at Destination ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1977 Number of Ways to Separate Numbers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1961 Check If String Is a Prefix of Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1962 Remove Stones to Minimize the Total ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1963 Minimum Number of Swaps to Make the String Balanced ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1964 Find the Longest Valid Obstacle Course at Each Position ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1967 Number of Strings That Appear as Substrings in Word ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1969 Minimum Non-Zero Product of the Array Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1970 Last Day Where You Can Still Cross ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1991 Find the Middle Index in Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1992 Find All Groups of Farmland ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1993 Operations on Tree ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1994 The Number of Good Subsets ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1979 Find Greatest Common Divisor of Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1980 Find Unique Binary String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1981 Minimize the Difference Between Target and Chosen Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1982 Find Array Given Subset Sums ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1966 Binary Searchable Numbers in an Unsorted Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1984 Minimum Difference Between Highest and Lowest of K Scores ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1985 Find the Kth Largest Integer in the Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1986 Minimum Number of Work Sessions to Finish the Tasks ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1987 Number of Unique Good Subsequences ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2006 Count Number of Pairs With Absolute Difference K ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2007 Find Original Array From Doubled Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2008 Maximum Earnings From Taxi ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2009 Minimum Number of Operations to Make Array Continuous ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1971 Find if Path Exists in Graph ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1995 Count Special Quadruplets ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1996 The Number of Weak Characters in the Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1997 First Day Where You Have Been in All the Rooms ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1998 GCD Sort of an Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1973 Count Nodes Equal to Sum of Descendants ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2000 Reverse Prefix of Word ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2001 Number of Pairs of Interchangeable Rectangles ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2002 Maximum Product of the Length of Two Palindromic Subsequences ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2003 Smallest Missing Genetic Value in Each Subtree ๐Ÿคฏ ๅ›ฐ้šพ โœ…
2022 Convert 1D Array Into 2D Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2023 Number of Pairs of Strings With Concatenation Equal to Target ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2024 Maximize the Confusion of an Exam ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2025 Maximum Number of Ways to Partition an Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2011 Final Value of Variable After Performing Operations ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2012 Sum of Beauty in the Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2013 Detect Squares ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2014 Longest Subsequence Repeated k Times ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1999 Smallest Greater Multiple Made of Two Digits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2015 Average Height of Buildings in Each Segment ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2016 Maximum Difference Between Increasing Elements ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2017 Grid Game ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2018 Check if Word Can Be Placed In Crossword ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2019 The Score of Students Solving Math Expression ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2037 Minimum Number of Moves to Seat Everyone ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2038 Remove Colored Pieces if Both Neighbors are the Same Color ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2040 Kth Smallest Product of Two Sorted Arrays ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2039 The Time When the Network Becomes Idle ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2005 Subtree Removal Game with Fibonacci Tree ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2027 Minimum Moves to Convert String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2028 Find Missing Observations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2029 Stone Game IX ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2030 Smallest K-Length Subsequence With Occurrences of a Letter ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2032 Two Out of Three ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2033 Minimum Operations to Make a Uni-Value Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2034 Stock Price Fluctuation ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2035 Partition Array Into Two Arrays to Minimize Sum Difference ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2053 Kth Distinct String in an Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2054 Two Best Non-Overlapping Events ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2055 Plates Between Candles ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2056 Number of Valid Move Combinations On Chessboard ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2042 Check if Numbers Are Ascending in a Sentence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2043 Simple Bank System ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2044 Count Number of Maximum Bitwise-OR Subsets ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2045 Second Minimum Time to Reach Destination ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2047 Number of Valid Words in a Sentence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2048 Next Greater Numerically Balanced Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2049 Count Nodes With the Highest Score ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2050 Parallel Courses III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2068 Check Whether Two Strings are Almost Equivalent ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2069 Walking Robot Simulation II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2070 Most Beautiful Item for Each Query ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2071 Maximum Number of Tasks You Can Assign ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2057 Smallest Index With Equal Value ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2058 Find the Minimum and Maximum Number of Nodes Between Critical Points ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2059 Minimum Operations to Convert Number ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2060 Check if an Original String Exists Given Two Encoded Strings ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2062 Count Vowel Substrings of a String ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2063 Vowels of All Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2064 Minimized Maximum of Products Distributed to Any Store ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2065 Maximum Path Quality of a Graph ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2085 Count Common Words With One Occurrence ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2086 Minimum Number of Buckets Required to Collect Rainwater from Houses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2087 Minimum Cost Homecoming of a Robot in a Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2088 Count Fertile Pyramids in a Land ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2073 Time Needed to Buy Tickets ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2074 Reverse Nodes in Even Length Groups ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2075 Decode the Slanted Ciphertext ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2076 Process Restricted Friend Requests ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2078 Two Furthest Houses With Different Colors ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2132 Stamping the Grid ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2097 Valid Arrangement of Pairs ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2081 Sum of k-Mirror Numbers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2061 Number of Spaces Cleaning Robot Cleaned ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2099 Find Subsequence of Length K With the Largest Sum ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2100 Find Good Days to Rob the Bank ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2101 Detonate the Maximum Bombs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2102 Sequentially Ordinal Rank Tracker ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2067 Number of Equal Count Substrings ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2089 Find Target Indices After Sorting Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2090 K Radius Subarray Averages ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2091 Removing Minimum and Maximum From Array ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2092 Find All People With Secret ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2094 Finding 3-Digit Even Numbers ๐Ÿคฉ ็ฎ€ๅ• โœ…
2095 Delete the Middle Node of a Linked List ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2096 Step-By-Step Directions From a Binary Tree Node to Another ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2077 Paths in Maze That Lead to Same Room ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2114 Maximum Number of Words Found in Sentences ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2115 Find All Possible Recipes from Given Supplies ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2116 Check if a Parentheses String Can Be Valid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2117 Abbreviating the Product of a Range ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2083 Substrings That Begin and End With the Same Letter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2103 Rings and Rods ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2104 Sum of Subarray Ranges ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2105 Watering Plants II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2106 Maximum Fruits Harvested After at Most K Steps ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2093 Minimum Cost to Reach City With Discounts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2108 Find First Palindromic String in the Array ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2109 Adding Spaces to a String ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2110 Number of Smooth Descent Periods of a Stock ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2111 Minimum Operations to Make the Array K-Increasing ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2129 Capitalize the Title ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2130 Maximum Twin Sum of a Linked List ๐Ÿค” ไธ€่ˆฌ โœ…
2131 Longest Palindrome by Concatenating Two Letter Words ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2119 A Number After a Double Reversal ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2120 Execution of All Suffix Instructions Staying in a Grid ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2121 Intervals Between Identical Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2122 Recover the Original Array ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2098 Subsequence of Size K With the Largest Even Sum ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2124 Check if All A's Appears Before All B's ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2125 Number of Laser Beams in a Bank ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2126 Destroying Asteroids ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2127 Maximum Employees to Be Invited to a Meeting ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2107 Number of Unique Flavors After Sharing K Candies ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2133 Check if Every Row and Column Contains All Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2134 Minimum Swaps to Group All 1's Together II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2135 Count Words Obtained After Adding a Letter ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2136 Earliest Possible Day of Full Bloom ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2113 Elements in Array After Removing and Replacing Elements ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2123 Minimum Operations to Remove Adjacent Ones in Matrix ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2138 Divide a String Into Groups of Size k ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2140 Solving Questions With Brainpower ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2141 Maximum Running Time of N Computers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2128 Remove All Ones With Row and Column Flips ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2137 Pour Water Between Buckets to Make Water Levels Equal ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 02 Deep Dark Fraction ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 04 Broken Board Dominoes ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 05 Coin Bonus ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 03 Programmable Robot ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 01 Guess Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 06 ๆ‹ฟ็กฌๅธ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 08 ๅ‰งๆƒ…่งฆๅ‘ๆ—ถ้—ด ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 23 ้ญ”ๆœฏๆŽ’ๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 14 ๅˆ‡ๅˆ†ๆ•ฐ็ป„ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 10 ไบŒๅ‰ๆ ‘ไปปๅŠก่ฐƒๅบฆ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 07 ไผ ้€’ไฟกๆฏ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 16 ๆธธไนๅ›ญ็š„ๆธธ่งˆ่ฎกๅˆ’ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 11 ๆœŸๆœ›ไธชๆ•ฐ็ปŸ่ฎก ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 12 ๅฐๅผ ๅˆท้ข˜่ฎกๅˆ’ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 15 ๆธธไนๅ›ญ็š„่ฟทๅฎซ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 34 ไบŒๅ‰ๆ ‘ๆŸ“่‰ฒ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 09 ๆœ€ๅฐ่ทณ่ทƒๆฌกๆ•ฐ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 37 ๆœ€ๅฐ็Ÿฉๅฝข้ข็งฏ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 13 ๅฏปๅฎ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 19 ็ง‹ๅถๆ”ถ่—้›† ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 24 ๆ•ฐๅญ—ๆธธๆˆ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 26 ๅฏผ่ˆช่ฃ…็ฝฎ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 20 ๅฟซ้€Ÿๅ…ฌไบค ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 21 ่ฟฝ้€ๆธธๆˆ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 25 ๅค่‘ฃ้”ฎ็›˜ ๐Ÿคฏ ๅ›ฐ้šพ โœ…
LCP 17 ้€Ÿ็ฎ—ๆœบๅ™จไบบ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 22 ้ป‘็™ฝๆ–นๆ ผ็”ป ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 18 ๆ—ฉ้ค็ป„ๅˆ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 27 ้ป‘็›’ๅ…‰็บฟๅๅฐ„ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 28 ้‡‡่ดญๆ–นๆกˆ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 29 ไนๅ›ข็ซ™ไฝ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 31 ๅ˜ๆข็š„่ฟทๅฎซ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 32 ๆ‰น้‡ๅค„็†ไปปๅŠก ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 35 ็”ตๅŠจ่ฝฆๆธธๅŸŽๅธ‚ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 33 ่“„ๆฐด ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 36 ๆœ€ๅคš็‰Œ็ป„ๆ•ฐ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 38 ๅฎˆๅซๅŸŽๅ ก ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 30 ้ญ”ๅก”ๆธธๆˆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCS 01 ไธ‹่ฝฝๆ’ไปถ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCS 02 ๅฎŒๆˆไธ€ๅŠ้ข˜็›ฎ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCS 03 ไธป้ข˜็ฉบ้—ด ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 49 ็Žฏๅฝข้—ฏๅ…ณๆธธๆˆ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 47 ๅ…ฅๅœบๅฎ‰ๆฃ€ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 44 ๅผ€ๅน•ๅผ็„ฐ็ซ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 43 ๅๅญ—่ทฏๅฃ็š„ไบค้€š ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 40 ๅฟƒ็ฎ—ๆŒ‘ๆˆ˜ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 39 ๆ— ไบบๆœบๆ–น้˜ต ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
LCP 41 ้ป‘็™ฝ็ฟป่ฝฌๆฃ‹ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 42 ็Žฉๅ…ทๅฅ—ๅœˆ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 46 ๅฟ—ๆ„ฟ่€…่ฐƒ้… ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
LCP 48 ๆ— ้™ๆฃ‹ๅฑ€ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
LCP 45 ่‡ช่กŒ่ฝฆ็‚ซๆŠ€่ต›ๅœบ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
175 Combine Two Tables ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
176 Second Highest Salary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
177 Nth Highest Salary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
178 Rank Scores ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
180 Consecutive Numbers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
181 Employees Earning More Than Their Managers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
182 Duplicate Emails ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
183 Customers Who Never Order ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
184 Department Highest Salary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
185 Department Top Three Salaries ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
196 Delete Duplicate Emails ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
197 Rising Temperature ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
262 Trips and Users ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
569 Median Employee Salary ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
570 Managers with at Least 5 Direct Reports ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
571 Find Median Given Frequency of Numbers ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
574 Winning Candidate ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
577 Employee Bonus ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
578 Get Highest Answer Rate Question ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
579 Find Cumulative Salary of an Employee ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
580 Count Student Number in Departments ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
584 Find Customer Referee ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
585 Investments in 2016 ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
586 Customer Placing the Largest Number of Orders ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
595 Big Countries ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
596 Classes More Than 5 Students ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
597 Friend Requests I: Overall Acceptance Rate ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
601 Human Traffic of Stadium ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
602 Friend Requests II: Who Has the Most Friends ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
603 Consecutive Available Seats ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
607 Sales Person ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
608 Tree Node ๐Ÿค” ไธ€่ˆฌ โœ…
610 Triangle Judgement ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
612 Shortest Distance in a Plane ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
613 Shortest Distance in a Line ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
614 Second Degree Follower ๐Ÿค” ไธ€่ˆฌ โœ…
615 Average Salary: Departments VS Company ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
618 Students Report By Geography ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
619 Biggest Single Number ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
620 Not Boring Movies ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
626 Exchange Seats ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
627 Swap Salary ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1045 Customers Who Bought All Products ๐Ÿค” ไธ€่ˆฌ โœ…
1050 Actors and Directors Who Cooperated At Least Three Times ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1068 Product Sales Analysis I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1069 Product Sales Analysis II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1070 Product Sales Analysis III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1075 Project Employees I ๐Ÿคฉ ็ฎ€ๅ• โœ…
1076 Project Employees II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1077 Project Employees III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1082 Sales Analysis I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1083 Sales Analysis II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1084 Sales Analysis III ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
511 Game Play Analysis I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
512 Game Play Analysis II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
534 Game Play Analysis III ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
550 Game Play Analysis IV ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1097 Game Play Analysis V ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1098 Unpopular Books ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1107 New Users Daily Count ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1112 Highest Grade For Each Student ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1113 Reported Posts ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1126 Active Businesses ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1127 User Purchase Platform ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1132 Reported Posts II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1141 User Activity for the Past 30 Days I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1142 User Activity for the Past 30 Days II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1148 Article Views I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1149 Article Views II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1158 Market Analysis I ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1159 Market Analysis II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1164 Product Price at a Given Date ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1173 Immediate Food Delivery I ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1174 Immediate Food Delivery II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1179 Reformat Department Table ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1193 Monthly Transactions I ๐Ÿค” ไธ€่ˆฌ โœ…
1194 Tournament Winners ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1204 Last Person to Fit in the Bus ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1205 Monthly Transactions II ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1211 Queries Quality and Percentage ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1212 Team Scores in Football Tournament ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1225 Report Contiguous Dates ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1241 Number of Comments per Post ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1251 Average Selling Price ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1264 Page Recommendations ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1270 All People Report to the Given Manager ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1280 Students and Examinations ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1285 Find the Start and End Number of Continuous Ranges ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1294 Weather Type in Each Country ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1303 Find the Team Size ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1308 Running Total for Different Genders ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1321 Restaurant Growth ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1322 Ads Performance ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ†–
1327 List the Products Ordered in a Period ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1336 Number of Transactions per Visit ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1341 Movie Rating ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1350 Students With Invalid Departments ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1355 Activity Participants ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1364 Number of Trusted Contacts of a Customer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1369 Get the Second Most Recent Activity ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1378 Replace Employee ID With The Unique Identifier ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1384 Total Sales Amount by Year ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1393 Capital Gain/Loss ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1398 Customers Who Bought Products A and B but Not C ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1407 Top Travellers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1412 Find the Quiet Students in All Exams ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1421 NPV Queries ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1435 Create a Session Bar Chart ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1440 Evaluate Boolean Expression ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1445 Apples & Oranges ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1454 Active Users ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1459 Rectangles Area ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1468 Calculate Salaries ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1479 Sales by Day of the Week ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1484 Group Sold Products By The Date ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1495 Friendly Movies Streamed Last Month ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1501 Countries You Can Safely Invest In ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1511 Customer Order Frequency ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1517 Find Users With Valid E-Mails ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1527 Patients With a Condition ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1532 The Most Recent Three Orders ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1543 Fix Product Name Format ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1549 The Most Recent Orders for Each Product ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1555 Bank Account Summary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1565 Unique Orders and Customers Per Month ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1571 Warehouse Manager ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1581 Customer Who Visited but Did Not Make Any Transactions ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1587 Bank Account Summary II ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1596 The Most Frequently Ordered Products for Each Customer ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1607 Sellers With No Sales ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1613 Find the Missing IDs ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1623 All Valid Triplets That Can Represent a Country ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1633 Percentage of Users Attended a Contest ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1635 Hopper Company Queries I ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1645 Hopper Company Queries II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1651 Hopper Company Queries III ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1661 Average Time of Process per Machine ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1667 Fix Names in a Table ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1677 Product's Worth Over Invoices ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1683 Invalid Tweets ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1693 Daily Leads and Partners ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1699 Number of Calls Between Two Persons ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1709 Biggest Window Between Visits ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1715 Count Apples and Oranges ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1729 Find Followers Count ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1731 The Number of Employees Which Report to Each Employee ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1741 Find Total Time Spent by Each Employee ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1747 Leetflex Banned Accounts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1757 Recyclable and Low Fat Products ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1767 Find the Subtasks That Did Not Execute ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1777 Product's Price for Each Store ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1783 Grand Slam Titles ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1789 Primary Department for Each Employee ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1795 Rearrange Products Table ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1809 Ad-Free Sessions ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1811 Find Interview Candidates ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1821 Find Customers With Positive Revenue this Year ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1831 Maximum Transaction Each Day ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1841 League Statistics ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1843 Suspicious Bank Accounts ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1853 Convert Date Format ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1867 Orders With Maximum Quantity Above Average ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1873 Calculate Special Bonus ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1875 Group Employees of the Same Salary ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1890 The Latest Login in 2020 ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1892 Page Recommendations II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1907 Count Salary Categories ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1917 Leetcodify Friends Recommendations ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1919 Leetcodify Similar Friends ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1934 Confirmation Rate ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1939 Users That Actively Request Confirmation Messages ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1949 Strong Friendship ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1951 All the Pairs With the Maximum Number of Common Followers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1965 Employees With Missing Information ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1972 First and Last Call On the Same Day ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
1978 Employees Whose Manager Left the Company ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1988 Find Cutoff Score for Each School ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1990 Count the Number of Experiments ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2004 The Number of Seniors and Juniors to Join the Company ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2010 The Number of Seniors and Juniors to Join the Company II ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2020 Number of Accounts That Did Not Stream ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2026 Low-Quality Problems ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2041 Accepted Candidates From the Interviews ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2051 The Category of Each Member in the Store ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2066 Account Balance ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2072 The Winner University ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2082 The Number of Rich Customers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
2084 Drop Type 1 Orders for Customers With Type 0 Orders ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2112 The Airport With the Most Traffic ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
2118 Build the Equation ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
2142 The Number of Passengers in Each Bus I ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
192 Word Frequency ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
193 Valid Phone Numbers ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
194 Transpose File ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
195 Tenth Line ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1117 Building H2O ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1115 Print FooBar Alternately ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1114 Print in Order ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
1188 Design Bounded Blocking Queue ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1116 Print Zero Even Odd ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1195 Fizz Buzz Multithreaded ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1226 The Dining Philosophers ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1242 Web Crawler Multithreaded ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
1279 Traffic Light Controlled Intersection ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.01 Is Unique LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.02 Check Permutation LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.03 String to URL LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.06 Compress String LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.09 String Rotation LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.01 Remove Duplicate Node LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.06 Palindrome Linked List LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.07 Intersection of Two Linked Lists LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.08 Linked List Cycle LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 03.02 Min Stack LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 03.04 Implement Queue using Stacks LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 04.01 Route Between Nodes LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 03.01 Three in One LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 03.05 Sort of Stacks LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.02 Minimum Height Tree LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 04.03 List of Depth LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.04 Check Balance LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 04.05 Legal Binary Search Tree LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.06 Successor LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.08 First Common Ancestor LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 05.01 Insert Into Bits LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 05.06 Convert Integer LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 05.07 Exchange LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 05.04 Closed Number LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 01.04 Palindrome Permutation LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 01.07 Rotate Matrix LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 01.08 Zero Matrix LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 02.03 Delete Middle Node LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.05 Sum Lists LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 03.03 Stack of Plates LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 05.08 Draw Line LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.01 Three Steps Problem LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 08.04 Power Set LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.05 Recursive Mulitply LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.09 Bracket LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.10 Color Fill LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 08.13 Pile Box LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 05.02 Binary Number to String LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 03.06 Animal Shelter LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 04.10 Check SubTree LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 05.03 Reverse Bits LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 08.11 Coin LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 10.03 Search Rotate Array LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.12 Eight Queens LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 08.03 Magic Index LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 08.07 Permutation I LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 10.05 Sparse Array Search LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.01 Swap Numbers LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.02 Words Frequency LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.03 Intersection LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 16.04 Tic-Tac-Toe LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.06 Smallest Difference LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.08 Permutation II LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.07 Maximum LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.09 Operations LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.10 Living People LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.11 Diving Board LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.13 Bisect Squares LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.14 Best Line LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.15 Master Mind LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.16 Sub Sort LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.17 Contiguous Sequence LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.18 Pattern Matching LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.19 Pond Sizes LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 01.05 One Away LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 02.02 Kth Node From End of List LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 02.04 Partition List LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.12 Paths with Sum LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 04.09 BST Sequences LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 08.02 Robot in a Grid LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 10.01 Sorted Merge LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 10.11 Peaks and Valleys LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.06 Hanota LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 10.09 Sorted Matrix Search LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.05 Factorial Zeros LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.08 English Int LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 17.12 BiNode LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 17.13 Re-Space LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.14 Smallest K LCCI ๐Ÿค” ไธ€่ˆฌ โœ…
้ข่ฏ•้ข˜ 17.15 Longest Word LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.16 The Masseuse LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 17.17 Multi Search LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.01 Add Without Plus LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 16.25 LRU Cache LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.26 Calculator LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.20 Continuous Median LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 17.21 Volume of Histogram LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 17.22 Word Transformer LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 08.14 Boolean Evaluation LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.04 Missing Number LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 17.05 Find Longest Subarray LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.06 Number Of 2s In Range LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 17.07 Baby Names LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.08 Circus Tower LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.09 Get Kth Magic Number LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.10 Find Majority Element LCCI ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
้ข่ฏ•้ข˜ 17.11 Find Closest LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 10.02 Group Anagrams LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 10.10 Rank from Stream LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.24 Pairs With Sum LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.18 Shortest Supersequence LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.19 Missing Two LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 17.23 Max Black Square LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.24 Max Submatrix LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 16.20 T9 LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 16.21 Sum Swap LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.25 Word Rectangle LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
้ข่ฏ•้ข˜ 16.22 Langtons Ant LCCI ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
้ข่ฏ•้ข˜ 17.26 Sparse Similarity LCCI ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 09 ็”จไธคไธชๆ ˆๅฎž็Žฐ้˜Ÿๅˆ— LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 10- I ๆ–ๆณข้‚ฃๅฅ‘ๆ•ฐๅˆ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 03 ๆ•ฐ็ป„ไธญ้‡ๅค็š„ๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 04 ไบŒ็ปดๆ•ฐ็ป„ไธญ็š„ๆŸฅๆ‰พ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 10- II ้’่›™่ทณๅฐ้˜ถ้—ฎ้ข˜ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 11 ๆ—‹่ฝฌๆ•ฐ็ป„็š„ๆœ€ๅฐๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 12 ็Ÿฉ้˜ตไธญ็š„่ทฏๅพ„ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 05 ๆ›ฟๆข็ฉบๆ ผ LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 13 ๆœบๅ™จไบบ็š„่ฟๅŠจ่Œƒๅ›ด LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 06 ไปŽๅฐพๅˆฐๅคดๆ‰“ๅฐ้“พ่กจ LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 07 ้‡ๅปบไบŒๅ‰ๆ ‘ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 14- I ๅ‰ช็ปณๅญ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 14- II ๅ‰ช็ปณๅญ II LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 25 ๅˆๅนถไธคไธชๆŽ’ๅบ็š„้“พ่กจ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 26 ๆ ‘็š„ๅญ็ป“ๆž„ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 27 ไบŒๅ‰ๆ ‘็š„้•œๅƒ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 28 ๅฏน็งฐ็š„ไบŒๅ‰ๆ ‘ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 20 ่กจ็คบๆ•ฐๅ€ผ็š„ๅญ—็ฌฆไธฒ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 21 ่ฐƒๆ•ดๆ•ฐ็ป„้กบๅบไฝฟๅฅ‡ๆ•ฐไฝไบŽๅถๆ•ฐๅ‰้ข LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 15 ไบŒ่ฟ›ๅˆถไธญ1็š„ไธชๆ•ฐ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 29 ้กบๆ—ถ้’ˆๆ‰“ๅฐ็Ÿฉ้˜ต LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 22 ้“พ่กจไธญๅ€’ๆ•ฐ็ฌฌkไธช่Š‚็‚น LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 16 ๆ•ฐๅ€ผ็š„ๆ•ดๆ•ฐๆฌกๆ–น LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 17 ๆ‰“ๅฐไปŽ1ๅˆฐๆœ€ๅคง็š„nไฝๆ•ฐ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 19 ๆญฃๅˆ™่กจ่พพๅผๅŒน้… LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 24 ๅ่ฝฌ้“พ่กจ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 18 ๅˆ ้™ค้“พ่กจ็š„่Š‚็‚น LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 35 ๅคๆ‚้“พ่กจ็š„ๅคๅˆถ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 40 ๆœ€ๅฐ็š„kไธชๆ•ฐ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 30 ๅŒ…ๅซminๅ‡ฝๆ•ฐ็š„ๆ ˆ LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 41 ๆ•ฐๆฎๆตไธญ็š„ไธญไฝๆ•ฐ LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 42 ่ฟž็ปญๅญๆ•ฐ็ป„็š„ๆœ€ๅคงๅ’Œ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 36 ไบŒๅ‰ๆœ็ดขๆ ‘ไธŽๅŒๅ‘้“พ่กจ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 31 ๆ ˆ็š„ๅŽ‹ๅ…ฅใ€ๅผนๅ‡บๅบๅˆ— LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 37 ๅบๅˆ—ๅŒ–ไบŒๅ‰ๆ ‘ LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 38 ๅญ—็ฌฆไธฒ็š„ๆŽ’ๅˆ— LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 43 1๏ฝžnๆ•ดๆ•ฐไธญ1ๅ‡บ็Žฐ็š„ๆฌกๆ•ฐ LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 39 ๆ•ฐ็ป„ไธญๅ‡บ็Žฐๆฌกๆ•ฐ่ถ…่ฟ‡ไธ€ๅŠ็š„ๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 32 - I ไปŽไธŠๅˆฐไธ‹ๆ‰“ๅฐไบŒๅ‰ๆ ‘ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 32 - II ไปŽไธŠๅˆฐไธ‹ๆ‰“ๅฐไบŒๅ‰ๆ ‘ II LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 44 ๆ•ฐๅญ—ๅบๅˆ—ไธญๆŸไธ€ไฝ็š„ๆ•ฐๅญ— LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 32 - III ไปŽไธŠๅˆฐไธ‹ๆ‰“ๅฐไบŒๅ‰ๆ ‘ III LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 33 ไบŒๅ‰ๆœ็ดขๆ ‘็š„ๅŽๅบ้ๅŽ†ๅบๅˆ— LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 50 ็ฌฌไธ€ไธชๅชๅ‡บ็Žฐไธ€ๆฌก็š„ๅญ—็ฌฆ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 34 ไบŒๅ‰ๆ ‘ไธญๅ’ŒไธบๆŸไธ€ๅ€ผ็š„่ทฏๅพ„ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 51 ๆ•ฐ็ป„ไธญ็š„้€†ๅบๅฏน LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 55 - I ไบŒๅ‰ๆ ‘็š„ๆทฑๅบฆ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 56 - I ๆ•ฐ็ป„ไธญๆ•ฐๅญ—ๅ‡บ็Žฐ็š„ๆฌกๆ•ฐ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 56 - II ๆ•ฐ็ป„ไธญๆ•ฐๅญ—ๅ‡บ็Žฐ็š„ๆฌกๆ•ฐ II LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 57 ๅ’Œไธบs็š„ไธคไธชๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 45 ๆŠŠๆ•ฐ็ป„ๆŽ’ๆˆๆœ€ๅฐ็š„ๆ•ฐ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 57 - II ๅ’Œไธบs็š„่ฟž็ปญๆญฃๆ•ฐๅบๅˆ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 46 ๆŠŠๆ•ฐๅญ—็ฟป่ฏ‘ๆˆๅญ—็ฌฆไธฒ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 52 ไธคไธช้“พ่กจ็š„็ฌฌไธ€ไธชๅ…ฌๅ…ฑ่Š‚็‚น LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 47 ็คผ็‰ฉ็š„ๆœ€ๅคงไปทๅ€ผ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 58 - I ็ฟป่ฝฌๅ•่ฏ้กบๅบ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 53 - I ๅœจๆŽ’ๅบๆ•ฐ็ป„ไธญๆŸฅๆ‰พๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 58 - II ๅทฆๆ—‹่ฝฌๅญ—็ฌฆไธฒ LCOF ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer 53 - II ็ผบๅคฑ็š„ๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 48 ๆœ€้•ฟไธๅซ้‡ๅคๅญ—็ฌฆ็š„ๅญๅญ—็ฌฆไธฒ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 54 ไบŒๅ‰ๆœ็ดขๆ ‘็š„็ฌฌkๅคง่Š‚็‚น LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 49 ไธ‘ๆ•ฐ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 65 ไธ็”จๅŠ ๅ‡ไน˜้™คๅšๅŠ ๆณ• LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 59 - I ๆป‘ๅŠจ็ช—ๅฃ็š„ๆœ€ๅคงๅ€ผ LCOF ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 59 - II ้˜Ÿๅˆ—็š„ๆœ€ๅคงๅ€ผ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 66 ๆž„ๅปบไน˜็งฏๆ•ฐ็ป„ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 60 nไธช้ชฐๅญ็š„็‚นๆ•ฐ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 67 ๆŠŠๅญ—็ฌฆไธฒ่ฝฌๆขๆˆๆ•ดๆ•ฐ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 61 ๆ‰‘ๅ…‹็‰Œไธญ็š„้กบๅญ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 55 - II ๅนณ่กกไบŒๅ‰ๆ ‘ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 62 ๅœ†ๅœˆไธญๆœ€ๅŽๅ‰ฉไธ‹็š„ๆ•ฐๅญ— LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 63 ่‚ก็ฅจ็š„ๆœ€ๅคงๅˆฉๆถฆ LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 64 ๆฑ‚1+2+โ€ฆ+n LCOF ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 68 - I ไบŒๅ‰ๆœ็ดขๆ ‘็š„ๆœ€่ฟ‘ๅ…ฌๅ…ฑ็ฅ–ๅ…ˆ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer 68 - II ไบŒๅ‰ๆ ‘็š„ๆœ€่ฟ‘ๅ…ฌๅ…ฑ็ฅ–ๅ…ˆ LCOF ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 001 ๆ•ดๆ•ฐ้™คๆณ• ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 081 ๅ…่ฎธ้‡ๅค้€‰ๆ‹ฉๅ…ƒ็ด ็š„็ป„ๅˆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 003 ๅ‰ n ไธชๆ•ฐๅญ—ไบŒ่ฟ›ๅˆถไธญ 1 ็š„ไธชๆ•ฐ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 002 ไบŒ่ฟ›ๅˆถๅŠ ๆณ• ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 082 ๅซๆœ‰้‡ๅคๅ…ƒ็ด ้›†ๅˆ็š„็ป„ๅˆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 004 ๅชๅ‡บ็Žฐไธ€ๆฌก็š„ๆ•ฐๅญ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 083 ๆฒกๆœ‰้‡ๅคๅ…ƒ็ด ้›†ๅˆ็š„ๅ…จๆŽ’ๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 084 ๅซๆœ‰้‡ๅคๅ…ƒ็ด ้›†ๅˆ็š„ๅ…จๆŽ’ๅˆ— ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 005 ๅ•่ฏ้•ฟๅบฆ็š„ๆœ€ๅคงไน˜็งฏ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 006 ๆŽ’ๅบๆ•ฐ็ป„ไธญไธคไธชๆ•ฐๅญ—ไน‹ๅ’Œ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 085 ็”ŸๆˆๅŒน้…็š„ๆ‹ฌๅท ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 007 ๆ•ฐ็ป„ไธญๅ’Œไธบ 0 ็š„ไธ‰ไธชๆ•ฐ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 086 ๅˆ†ๅ‰ฒๅ›žๆ–‡ๅญๅญ—็ฌฆไธฒ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 087 ๅคๅŽŸ IP ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 008 ๅ’ŒๅคงไบŽ็ญ‰ไบŽ target ็š„ๆœ€็Ÿญๅญๆ•ฐ็ป„ ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 088 ็ˆฌๆฅผๆขฏ็š„ๆœ€ๅฐ‘ๆˆๆœฌ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 009 ไน˜็งฏๅฐไบŽ K ็š„ๅญๆ•ฐ็ป„ ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 089 ๆˆฟๅฑ‹ๅท็›— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 010 ๅ’Œไธบ k ็š„ๅญๆ•ฐ็ป„ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 011 0 ๅ’Œ 1 ไธชๆ•ฐ็›ธๅŒ็š„ๅญๆ•ฐ็ป„ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 012 ๅทฆๅณไธค่พนๅญๆ•ฐ็ป„็š„ๅ’Œ็›ธ็ญ‰ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 013 ไบŒ็ปดๅญ็Ÿฉ้˜ต็š„ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 014 ๅญ—็ฌฆไธฒไธญ็š„ๅ˜ไฝ่ฏ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 015 ๅญ—็ฌฆไธฒไธญ็š„ๆ‰€ๆœ‰ๅ˜ไฝ่ฏ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 016 ไธๅซ้‡ๅคๅญ—็ฌฆ็š„ๆœ€้•ฟๅญๅญ—็ฌฆไธฒ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 017 ๅซๆœ‰ๆ‰€ๆœ‰ๅญ—็ฌฆ็š„ๆœ€็Ÿญๅญ—็ฌฆไธฒ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 018 ๆœ‰ๆ•ˆ็š„ๅ›žๆ–‡ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 019 ๆœ€ๅคšๅˆ ้™คไธ€ไธชๅญ—็ฌฆๅพ—ๅˆฐๅ›žๆ–‡ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 020 ๅ›žๆ–‡ๅญๅญ—็ฌฆไธฒ็š„ไธชๆ•ฐ ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 021 ๅˆ ้™ค้“พ่กจ็š„ๅ€’ๆ•ฐ็ฌฌ n ไธช็ป“็‚น ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 022 ้“พ่กจไธญ็Žฏ็š„ๅ…ฅๅฃ่Š‚็‚น ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 023 ไธคไธช้“พ่กจ็š„็ฌฌไธ€ไธช้‡ๅˆ่Š‚็‚น ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 024 ๅ่ฝฌ้“พ่กจ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 025 ้“พ่กจไธญ็š„ไธคๆ•ฐ็›ธๅŠ  ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 026 ้‡ๆŽ’้“พ่กจ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 027 ๅ›žๆ–‡้“พ่กจ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 028 ๅฑ•ๅนณๅคš็บงๅŒๅ‘้“พ่กจ ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 029 ๆŽ’ๅบ็š„ๅพช็Žฏ้“พ่กจ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 090 ็Žฏๅฝขๆˆฟๅฑ‹ๅท็›— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 030 ๆ’ๅ…ฅใ€ๅˆ ้™คๅ’Œ้šๆœบ่ฎฟ้—ฎ้ƒฝๆ˜ฏ O(1) ็š„ๅฎนๅ™จ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 091 ็ฒ‰ๅˆทๆˆฟๅญ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 092 ็ฟป่ฝฌๅญ—็ฌฆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 031 ๆœ€่ฟ‘ๆœ€ๅฐ‘ไฝฟ็”จ็ผ“ๅญ˜ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 093 ๆœ€้•ฟๆ–ๆณข้‚ฃๅฅ‘ๆ•ฐๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 094 ๆœ€ๅฐ‘ๅ›žๆ–‡ๅˆ†ๅ‰ฒ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 032 ๆœ‰ๆ•ˆ็š„ๅ˜ไฝ่ฏ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 095 ๆœ€้•ฟๅ…ฌๅ…ฑๅญๅบๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 033 ๅ˜ไฝ่ฏ็ป„ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 034 ๅค–ๆ˜Ÿ่ฏญ่จ€ๆ˜ฏๅฆๆŽ’ๅบ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 096 ๅญ—็ฌฆไธฒไบค็ป‡ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 035 ๆœ€ๅฐๆ—ถ้—ดๅทฎ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 036 ๅŽ็ผ€่กจ่พพๅผ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 097 ๅญๅบๅˆ—็š„ๆ•ฐ็›ฎ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 037 ๅฐ่กŒๆ˜Ÿ็ขฐๆ’ž ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 038 ๆฏๆ—ฅๆธฉๅบฆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 039 ็›ดๆ–นๅ›พๆœ€ๅคง็Ÿฉๅฝข้ข็งฏ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 040 ็Ÿฉ้˜ตไธญๆœ€ๅคง็š„็Ÿฉๅฝข ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 099 ๆœ€ๅฐ่ทฏๅพ„ไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 100 ไธ‰่ง’ๅฝขไธญๆœ€ๅฐ่ทฏๅพ„ไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 101 ๅˆ†ๅ‰ฒ็ญ‰ๅ’Œๅญ้›† ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 102 ๅŠ ๅ‡็š„็›ฎๆ ‡ๅ€ผ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 103 ๆœ€ๅฐ‘็š„็กฌๅธๆ•ฐ็›ฎ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 104 ๆŽ’ๅˆ—็š„ๆ•ฐ็›ฎ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 105 ๅฒ›ๅฑฟ็š„ๆœ€ๅคง้ข็งฏ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 041 ๆป‘ๅŠจ็ช—ๅฃ็š„ๅนณๅ‡ๅ€ผ ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer II 042 ๆœ€่ฟ‘่ฏทๆฑ‚ๆฌกๆ•ฐ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 106 ไบŒๅˆ†ๅ›พ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 043 ๅพ€ๅฎŒๅ…จไบŒๅ‰ๆ ‘ๆทปๅŠ ่Š‚็‚น ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 107 ็Ÿฉ้˜ตไธญ็š„่ท็ฆป ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 044 ไบŒๅ‰ๆ ‘ๆฏๅฑ‚็š„ๆœ€ๅคงๅ€ผ ๐Ÿค” ไธ€่ˆฌ โœ…
ๅ‰‘ๆŒ‡ Offer II 045 ไบŒๅ‰ๆ ‘ๆœ€ๅบ•ๅฑ‚ๆœ€ๅทฆ่พน็š„ๅ€ผ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 046 ไบŒๅ‰ๆ ‘็š„ๅณไพง่ง†ๅ›พ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 108 ๅ•่ฏๆผ”ๅ˜ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 047 ไบŒๅ‰ๆ ‘ๅ‰ชๆž ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 109 ๅผ€ๅฏ†็ ้” ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 110 ๆ‰€ๆœ‰่ทฏๅพ„ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 048 ๅบๅˆ—ๅŒ–ไธŽๅๅบๅˆ—ๅŒ–ไบŒๅ‰ๆ ‘ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 111 ่ฎก็ฎ—้™คๆณ• ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 049 ไปŽๆ น่Š‚็‚นๅˆฐๅถ่Š‚็‚น็š„่ทฏๅพ„ๆ•ฐๅญ—ไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 050 ๅ‘ไธ‹็š„่ทฏๅพ„่Š‚็‚นไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 112 ๆœ€้•ฟ้€’ๅขž่ทฏๅพ„ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 051 ่Š‚็‚นไน‹ๅ’Œๆœ€ๅคง็š„่ทฏๅพ„ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 113 ่ฏพ็จ‹้กบๅบ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 052 ๅฑ•ๅนณไบŒๅ‰ๆœ็ดขๆ ‘ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 114 ๅค–ๆ˜Ÿๆ–‡ๅญ—ๅ…ธ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 053 ไบŒๅ‰ๆœ็ดขๆ ‘ไธญ็š„ไธญๅบๅŽ็ปง ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 115 ้‡ๅปบๅบๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 054 ๆ‰€ๆœ‰ๅคงไบŽ็ญ‰ไบŽ่Š‚็‚น็š„ๅ€ผไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 055 ไบŒๅ‰ๆœ็ดขๆ ‘่ฟญไปฃๅ™จ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 117 ็›ธไผผ็š„ๅญ—็ฌฆไธฒ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 118 ๅคšไฝ™็š„่พน ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 056 ไบŒๅ‰ๆœ็ดขๆ ‘ไธญไธคไธช่Š‚็‚นไน‹ๅ’Œ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 119 ๆœ€้•ฟ่ฟž็ปญๅบๅˆ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 057 ๅ€ผๅ’Œไธ‹ๆ ‡ไน‹ๅทฎ้ƒฝๅœจ็ป™ๅฎš็š„่Œƒๅ›ดๅ†… ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 058 ๆ—ฅ็จ‹่กจ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 059 ๆ•ฐๆฎๆต็š„็ฌฌ K ๅคงๆ•ฐๅ€ผ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 060 ๅ‡บ็Žฐ้ข‘็Ž‡ๆœ€้ซ˜็š„ k ไธชๆ•ฐๅญ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 062 ๅฎž็Žฐๅ‰็ผ€ๆ ‘ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 061 ๅ’Œๆœ€ๅฐ็š„ k ไธชๆ•ฐๅฏน ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 063 ๆ›ฟๆขๅ•่ฏ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 064 ็ฅžๅฅ‡็š„ๅญ—ๅ…ธ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 065 ๆœ€็Ÿญ็š„ๅ•่ฏ็ผ–็  ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 066 ๅ•่ฏไน‹ๅ’Œ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 067 ๆœ€ๅคง็š„ๅผ‚ๆˆ– ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 068 ๆŸฅๆ‰พๆ’ๅ…ฅไฝ็ฝฎ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 069 ๅฑฑๅณฐๆ•ฐ็ป„็š„้กถ้ƒจ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 070 ๆŽ’ๅบๆ•ฐ็ป„ไธญๅชๅ‡บ็Žฐไธ€ๆฌก็š„ๆ•ฐๅญ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 071 ๆŒ‰ๆƒ้‡็”Ÿๆˆ้šๆœบๆ•ฐ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 072 ๆฑ‚ๅนณๆ–นๆ น ๐Ÿคฉ ็ฎ€ๅ• โœ…
ๅ‰‘ๆŒ‡ Offer II 073 ็‹’็‹’ๅƒ้ฆ™่•‰ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 074 ๅˆๅนถๅŒบ้—ด ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 075 ๆ•ฐ็ป„็›ธๅฏนๆŽ’ๅบ ๐Ÿคฉ ็ฎ€ๅ• ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 076 ๆ•ฐ็ป„ไธญ็š„็ฌฌ k ๅคง็š„ๆ•ฐๅญ— ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 077 ้“พ่กจๆŽ’ๅบ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 078 ๅˆๅนถๆŽ’ๅบ้“พ่กจ ๐Ÿคฏ ๅ›ฐ้šพ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 079 ๆ‰€ๆœ‰ๅญ้›† ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 080 ๅซๆœ‰ k ไธชๅ…ƒ็ด ็š„็ป„ๅˆ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 098 ่ทฏๅพ„็š„ๆ•ฐ็›ฎ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•
ๅ‰‘ๆŒ‡ Offer II 116 ็œไปฝๆ•ฐ้‡ ๐Ÿค” ไธ€่ˆฌ ๐Ÿ•

Releases

No releases published

Packages

No packages published