/LeetCode.playground

๐Ÿ“œ Bugen's LeetCode solutions in Swift Playground. ๐Ž๐ฏ๐ž๐ซ ๐Ÿ’๐ŸŽ๐ŸŽ ๐ฉ๐ซ๐จ๐›๐ฅ๐ž๐ฆ๐ฌ ๐ข๐ง๐œ๐ฅ๐ฎ๐๐ž๐!

Primary LanguageSwiftMIT LicenseMIT

LeetCode.playground

Language Progress Easy Medium Hard

struct LeetCodePlayground: CustomStringConvertible {
    let language    = "Swift 5.3"
    let description = "Bugen's LeetCode solutions in Swift Playground."

    typealias Priority = UInt
    enum Goal: Priority {
        case algorithm  = 0
        case clarity    = 1
        case runtime    = 2
    }

    enum Difficulty: String {
        case easy       = "๐Ÿ˜Š"
        case medium     = "๐Ÿคจ"
        case hard       = "๐Ÿ˜ซ"
        case marked     = "๐Ÿ”ž"
        case annoying   = "๐Ÿคฌ"
    }
}

Tags

More

Recent

  • ๐Ÿ˜Š [Q] [S] 0167. Two Sum II - Input array is sorted [Binary Search, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0160. Intersection of Two Linked Lists [Linked List, Two Pointers, O(n)]
  • ๐Ÿ˜Š [Q] [S] 0268. Missing Number
  • ๐Ÿคจ [Q] [S] 0581. Shortest Unsorted Continuous Subarray [O(n), Stack]
  • ๐Ÿคจ [Q] [S] 0946. Validate Stack Sequences [O(n), Stack]
  • ๐Ÿคจ [Q] [S] 0991. Broken Calculator [Greedy]
  • ๐Ÿคจ [Q] [S] 1249. Minimum Remove to Make Valid Parentheses [O(n), Stack, String]
  • ๐Ÿคจ [Q] [S] 0413. Arithmetic Slices [O(n), DP]
  • ๐Ÿ˜Š [Q] [S] 1337. The K Weakest Rows in a Matrix [Binary Search]
  • ๐Ÿคจ [Q] [S] 0138. Copy List with Random Pointer [Linked List]

Contests

  • ๐Ÿ”– [C] [S] Weekly Contest 211
  • ๐Ÿ”– [C] [S] Weekly Contest 210
  • ๐Ÿ”– [C] [S] Weekly Contest 209
  • ๐Ÿ”– [C] [S] Weekly Contest 205
  • ๐Ÿ”– [C] [S] Weekly Contest 203
  • ๐Ÿ”– [C] [S] Weekly Contest 202
  • ๐Ÿ”– [C] [S] Biweekly Contest 37

Problems

  • ๐Ÿ˜Š [Q] [S] 0001. Two Sum [Hash Table]
  • ๐Ÿคจ [Q] [S] 0002. Add Two Numbers [Linked List]
  • ๐Ÿคจ [Q] [S] 0003. Longest Substring Without Repeating Characters [Array]
  • ๐Ÿ”ž [Q] [S] 0004. Median of Two Sorted Arrays [Array, Binary Search]
  • ๐Ÿ”ž [Q] [S] 0005. Longest Palindromic Substring [DP]
  • ๐Ÿคจ [Q] [S] 0006. ZigZag Conversion [Array]
  • ๐Ÿ˜Š [Q] [S] 0007. Reverse Integer [Mathematics]
  • ๐Ÿคจ [Q] [S] 0008. String to Integer (atoi) [String]
  • ๐Ÿ˜Š [Q] [S] 0009. Palindrome Number [Mathematics]
  • ๐Ÿ˜ซ [Q] [S] 0010. Regular Expression Matching [String, DP]
  • ๐Ÿคจ [Q] [S] 0011. Container With Most Water [Two Pointers, Greedy]
  • ๐Ÿคจ [Q] [S] 0012. Integer to Roman [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 0013. Roman to Integer [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 0014. Longest Common Prefix [String]
  • ๐Ÿคจ [Q] [S] 0015. 3Sum [Two Pointers]
  • ๐Ÿคจ [Q] [S] 0016. 3Sum Closest [Two Pointers]
  • ๐Ÿคจ [Q] [S] 0017. Letter Combinations of a Phone Number [Array]
  • ๐Ÿคจ [Q] [S] 0019. Remove Nth Node From End of List [Linked List, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0020. Valid Parentheses [Stack]
  • ๐Ÿ˜Š [Q] [S] 0021. Merge Two Sorted Lists [Linked List]
  • ๐Ÿ”ž [Q] [S] 0022. Generate Parentheses [String]
  • ๐Ÿ˜ซ [Q] [S] 0023. Merge k Sorted Lists [Sort, Linked List]
  • ๐Ÿคจ [Q] [S] 0024. Swap Nodes in Pairs [Linked List]
  • ๐Ÿ˜ซ [Q] [S] 0025. Reverse Nodes in k-Group [Linked List]
  • ๐Ÿ˜Š [Q] [S] 0026. Remove Duplicates from Sorted Array [Array, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0027. Remove Element [Array, Two Pointers]
  • ๐Ÿ”ž [Q] [S] 0028. Implement strStr() [String]
  • ๐Ÿคจ [Q] [S] 0029. Divide Two Integers [Bit Manipulation, Mathematics]
  • ๐Ÿคจ [Q] [S] 0031. Next Permutation [Sort, O(n), Binary Search]
  • ๐Ÿ˜ซ [Q] [S] 0032. Longest Valid Parentheses [DP]
  • ๐Ÿคจ [Q] [S] 0033. Search in Rotated Sorted Array [Binary Search]
  • ๐Ÿคจ [Q] [S] 0034. Find First and Last Position of Element in Sorted Array [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 0035. Search Insert Position [Binary Search]
  • ๐Ÿคจ [Q] [S] 0036. Valid Sudoku [Hash Table]
  • ๐Ÿคจ [Q] [S] 0038. Count and Say
  • ๐Ÿคจ [Q] [S] 0039. Combination Sum [DFS]
  • ๐Ÿคจ [Q] [S] 0040. Combination Sum II [DFS]
  • ๐Ÿ”ž [Q] [S] 0041. First Missing Positive [Array]
  • ๐Ÿ”ž [Q] [S] 0042. Trapping Rain Water [Stack]
  • ๐Ÿ”ž [Q] [S] 0043. Multiply Strings [Mathematics]
  • ๐Ÿ”ž [Q] [S] 0044. Wildcard Matching [DFS, Greedy]
  • ๐Ÿ”ž [Q] [S] 0045. Jump Game II [Greedy, BFS]
  • ๐Ÿคจ [Q] [S] 0046. Permutations [Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0048. Rotate Image [Array, Mathematics]
  • ๐Ÿคจ [Q] [S] 0050. Pow(x, n) [Mathematics]
  • ๐Ÿ˜ซ [Q] [S] 0051. N-Queens [DFS, Bit Manipulation]
  • ๐Ÿ˜ซ [Q] [S] 0052. N-Queens II
  • ๐Ÿ˜Š [Q] [S] 0053. Maximum Subarray [DP]
  • ๐Ÿคจ [Q] [S] 0055. Jump Game [Greedy]
  • ๐Ÿคจ [Q] [S] 0056. Merge Intervals [Sort]
  • ๐Ÿคจ [Q] [S] 0057. Insert Interval [Sort]
  • ๐Ÿ˜Š [Q] [S] 0058. Length of Last Word
  • ๐Ÿ˜ซ [Q] [S] 0060. Permutation Sequence [Mathematics, String]
  • ๐Ÿคจ [Q] [S] 0061. Rotate List [Linked List]
  • ๐Ÿคจ [Q] [S] 0062. Unique Paths [Mathematics, DP]
  • ๐Ÿคจ [Q] [S] 0063. Unique Paths II [DP]
  • ๐Ÿคจ [Q] [S] 0064. Minimum Path Sum [DP]
  • ๐Ÿ”ž [Q] [S] 0065. Valid Number [State Machine, String]
  • ๐Ÿ˜Š [Q] [S] 0066. Plus One
  • ๐Ÿ˜Š [Q] [S] 0067. Add Binary
  • ๐Ÿ˜Š [Q] [S] 0069. Sqrt(x) [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 0070. Climbing Stairs [DP]
  • ๐Ÿคจ [Q] [S] 0071. Simplify Path [Stack]
  • ๐Ÿ˜ซ [Q] [S] 0072. Edit Distance [DP]
  • ๐Ÿคจ [Q] [S] 0074. Search a 2D Matrix [Binary Search]
  • ๐Ÿคจ [Q] [S] 0075. Sort Colors [Array, Two Pointers]
  • ๐Ÿ˜ซ [Q] [S] 0076. Minimum Window Substring [Sliding Windows, Hash Table, O(n)]
  • ๐Ÿคจ [Q] [S] 0078. Subsets [Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 0080. Remove Duplicates from Sorted Array II [Array, Two Pointers]
  • ๐Ÿ˜ซ [Q] [S] 0087. Scramble String [DP]
  • ๐Ÿคจ [Q] [S] 0090. Subsets II [Array, Hash Table]
  • ๐Ÿคจ [Q] [S] 0091. Decode Ways [DP]
  • ๐Ÿคจ [Q] [S] 0092. Reverse Linked List II [Linked List]
  • ๐Ÿคจ [Q] [S] 0096. Unique Binary Search Trees [Tree]
  • ๐Ÿ˜ซ [Q] [S] 0097. Interleaving String [DP]
  • ๐Ÿคจ [Q] [S] 0098. Validate Binary Search Tree
  • ๐Ÿ˜ซ [Q] [S] 0099. Recover Binary Search Tree [O(n), DFS, Tree]
  • ๐Ÿ˜Š [Q] [S] 0100. Same Tree [Tree]
  • ๐Ÿคจ [Q] [S] 0102. Binary Tree Level Order Traversal [Tree, BFS]
  • ๐Ÿคจ [Q] [S] 0103. Binary Tree Zigzag Level Order Traversal [Tree, BFS]
  • ๐Ÿคจ [Q] [S] 0105. Construct Binary Tree from Preorder and Inorder Traversal [Tree]
  • ๐Ÿคจ [Q] [S] 0106. Construct Binary Tree from Inorder and Postorder Traversal [Tree]
  • ๐Ÿคจ [Q] [S] 0107. Binary Tree Level Order Traversal II [BFS]
  • ๐Ÿ˜Š [Q] [S] 0111. Minimum Depth of Binary Tree [Tree]
  • ๐Ÿ˜Š [Q] [S] 0112. Path Sum [Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0113. Path Sum II [Tree, DFS]
  • ๐Ÿ˜Š [Q] [S] 0118. Pascal's Triangle
  • ๐Ÿ˜Š [Q] [S] 0119. Pascal's Triangle II
  • ๐Ÿคจ [Q] [S] 0120. Triangle [DP, Graph, Shortest Path]
  • ๐Ÿ˜Š [Q] [S] 0121. Best Time to Buy and Sell Stock [DP, State Machine]
  • ๐Ÿ˜Š [Q] [S] 0122. Best Time to Buy and Sell Stock II [Greedy]
  • ๐Ÿ”ž [Q] [S] 0123. Best Time to Buy and Sell Stock III [DP, State Machine]
  • ๐Ÿ˜Š [Q] [S] 0125. Valid Palindrome
  • ๐Ÿ˜ซ [Q] [S] 0127. Word Ladder [Graph, BFS, Shortest Path]
  • ๐Ÿคจ [Q] [S] 0129. Sum Root to Leaf Numbers [Tree, BFS]
  • ๐Ÿคจ [Q] [S] 0130. Surrounded Regions [Graph, DFS]
  • ๐Ÿคจ [Q] [S] 0131. Palindrome Partitioning [DP]
  • ๐Ÿ”ž [Q] [S] 0132. Palindrome Partitioning II [DP]
  • ๐Ÿคจ [Q] [S] 0133. Clone Graph [Graph]
  • ๐Ÿ”ž [Q] [S] 0134. Gas Station [O(n)]
  • ๐Ÿ˜ซ [Q] [S] 0135. Candy [Greedy, O(n)]
  • ๐Ÿ˜Š [Q] [S] 0136. Single Number [Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 0137. Single Number II [Bit Manipulation, State Machine]
  • ๐Ÿคจ [Q] [S] 0138. Copy List with Random Pointer [Linked List]
  • ๐Ÿคจ [Q] [S] 0139. Word Break [DP]
  • ๐Ÿ˜ซ [Q] [S] 0140. Word Break II [DP, DFS, String]
  • ๐Ÿ˜Š [Q] [S] 0141. Linked List Cycle [Linked List, Two Pointers]
  • ๐Ÿ”ž [Q] [S] 0142. Linked List Cycle II [Linked List, Two Pointers]
  • ๐Ÿ”ž [Q] [S] 0143. Reorder List [Linked List]
  • ๐Ÿคจ [Q] [S] 0147. Insertion Sort List [Linked List]
  • ๐Ÿคจ [Q] [S] 0148. Sort List [Linked List, Divide & Conquer, Sort, Two Pointers]
  • ๐Ÿคจ [Q] [S] 0151. Reverse Words in a String
  • ๐Ÿคจ [Q] [S] 0152. Maximum Product Subarray [DP, Divide & Conquer, O(n)]
  • ๐Ÿคจ [Q] [S] 0153. Find Minimum in Rotated Sorted Array [Binary Search]
  • ๐Ÿ˜ซ [Q] [S] 0154. Find Minimum in Rotated Sorted Array II [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 0160. Intersection of Two Linked Lists [Linked List, Two Pointers, O(n)]
  • ๐Ÿคจ [Q] [S] 0165. Compare Version Numbers [String]
  • ๐Ÿ˜Š [Q] [S] 0167. Two Sum II - Input array is sorted [Binary Search, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0169. Majority Element [Array, O(n)]
  • ๐Ÿ˜Š [Q] [S] 0171. Excel Sheet Column Number
  • ๐Ÿ”ž [Q] [S] 0174. Dungeon Game [DP]
  • ๐Ÿคจ [Q] [S] 0179. Largest Number [Sort]
  • ๐Ÿคจ [Q] [S] 0187. Repeated DNA Sequences [Hash Table]
  • ๐Ÿ˜ซ [Q] [S] 0188. Best Time to Buy and Sell Stock IV [Greedy, DP, State Machine]
  • ๐Ÿ”ž [Q] [S] 0189. Rotate Array [Array, O(n)]
  • ๐Ÿ”ž [Q] [S] 0190. Reverse Bits [Bit Manipulation]
  • ๐Ÿ˜Š [Q] [S] 0191. Number of 1 Bits
  • ๐Ÿคจ [Q] [S] 0198. House Robber [DP, O(n)]
  • ๐Ÿคจ [Q] [S] 0199. Binary Tree Right Side View [Tree, BFS]
  • ๐Ÿคจ [Q] [S] 0201. Bitwise AND of Numbers Range [Bit Manipulation]
  • ๐Ÿ˜Š [Q] [S] 0203. Remove Linked List Elements [Linked List]
  • ๐Ÿ˜Š [Q] [S] 0204. Count Primes [Mathematics]
  • ๐Ÿ”ž [Q] [S] 0206. Reverse Linked List [Linked List]
  • ๐Ÿคจ [Q] [S] 0207. Course Schedule [Graph]
  • ๐Ÿคจ [Q] [S] 0208. Implement Trie (Prefix Tree) [Tree]
  • ๐Ÿคจ [Q] [S] 0209. Minimum Size Subarray Sum [Sliding Windows, Array, O(n)]
  • ๐Ÿคจ [Q] [S] 0210. Course Schedule II [Graph]
  • ๐Ÿคจ [Q] [S] 0211. Design Add and Search Words Data Structure [Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0213. House Robber II [DP, O(n)]
  • ๐Ÿคจ [Q] [S] 0216. Combination Sum III [DFS]
  • ๐Ÿ˜Š [Q] [S] 0217. Contains Duplicate [Hash Table]
  • ๐Ÿ˜Š [Q] [S] 0219. Contains Duplicate II [Hash Table, Sliding Windows]
  • ๐Ÿคจ [Q] [S] 0220. Contains Duplicate III [Hash Table, Sliding Windows]
  • ๐Ÿคจ [Q] [S] 0222. Count Complete Tree Nodes [Tree]
  • ๐Ÿ˜Š [Q] [S] 0226. Invert Binary Tree [Tree]
  • ๐Ÿ˜Š [Q] [S] 0228. Summary Ranges
  • ๐Ÿ”ž [Q] [S] 0229. Majority Element II [Array, O(n)]
  • ๐Ÿคจ [Q] [S] 0230. Kth Smallest Element in a BST [Tree, DFS]
  • ๐Ÿ˜Š [Q] [S] 0231. Power of Two [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 0237. Delete Node in a Linked List [Linked List]
  • ๐Ÿ”ž [Q] [S] 0240. Search a 2D Matrix II [O(n)]
  • ๐Ÿ˜Š [Q] [S] 0242. Valid Anagram [Hash Table]
  • ๐Ÿ˜Š [Q] [S] 0258. Add Digits [Mathematics]
  • ๐Ÿคจ [Q] [S] 0260. Single Number III [Bit Manipulation, O(n)]
  • ๐Ÿ˜Š [Q] [S] 0263. Ugly Number
  • ๐Ÿคจ [Q] [S] 0264. Ugly Number II [Mathematics, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0268. Missing Number
  • ๐Ÿคจ [Q] [S] 0274. H-Index [Array, Sort]
  • ๐Ÿคจ [Q] [S] 0275. H-Index II [Binary Search, Array]
  • ๐Ÿ˜Š [Q] [S] 0278. First Bad Version [Binary Search]
  • ๐Ÿคจ [Q] [S] 0279. Perfect Squares [Mathematics]
  • ๐Ÿคจ [Q] [S] 0284. Peeking Iterator
  • ๐Ÿคจ [Q] [S] 0287. Find the Duplicate Number [Binary Search, Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0290. Word Pattern [Hash Table]
  • ๐Ÿ”ž [Q] [S] 0295. Find Median from Data Stream [Heap]
  • ๐Ÿคจ [Q] [S] 0299. Bulls and Cows
  • ๐Ÿ”ž [Q] [S] 0300. Longest Increasing Subsequence [DP, Binary Search]
  • ๐Ÿคจ [Q] [S] 0309. Best Time to Buy and Sell Stock with Cooldown [DP, State Machine, O(n)]
  • ๐Ÿ”ž [Q] [S] 0310. Minimum Height Trees [Tree]
  • ๐Ÿ”ž [Q] [S] 0315. Count of Smaller Numbers After Self [Sort, Divide & Conquer]
  • ๐Ÿคจ [Q] [S] 0316. Remove Duplicate Letters [Greedy, DP]
  • ๐Ÿ˜Š [Q] [S] 0326. Power of Three
  • ๐Ÿคจ [Q] [S] 0328. Odd Even Linked List [Linked List]
  • ๐Ÿ˜ซ [Q] [S] 0329. Longest Increasing Path in a Matrix [Graph]
  • ๐Ÿคจ [Q] [S] 0332. Reconstruct Itinerary [DFS]
  • ๐Ÿคจ [Q] [S] 0338. Counting Bits [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 0342. Power of Four [Bit Manipulation]
  • ๐Ÿ˜Š [Q] [S] 0344. Reverse String
  • ๐Ÿคจ [Q] [S] 0347. Top K Frequent Elements
  • ๐Ÿ˜Š [Q] [S] 0350. Intersection of Two Arrays II [Two Pointers]
  • ๐Ÿ˜Š [Q] [S] 0367. Valid Perfect Square [Mathematics, Binary Search]
  • ๐Ÿคจ [Q] [S] 0368. Largest Divisible Subset [DP]
  • ๐Ÿคจ [Q] [S] 0372. Super Pow [Mathematics]
  • ๐Ÿคจ [Q] [S] 0377. Combination Sum IV [DFS, DP]
  • ๐Ÿคจ [Q] [S] 0380. Insert Delete GetRandom O(1) [Hash Table]
  • ๐Ÿ˜Š [Q] [S] 0383. Ransom Note [Hash Table]
  • ๐Ÿ˜Š [Q] [S] 0387. First Unique Character in a String [String]
  • ๐Ÿ˜Š [Q] [S] 0389. Find the Difference [Bit Manipulation]
  • ๐Ÿ˜Š [Q] [S] 0392. Is Subsequence [DP, Greedy, Two Pointers, Binary Search]
  • ๐Ÿคจ [Q] [S] 0397. Integer Replacement [Mathematics]
  • ๐Ÿคจ [Q] [S] 0399. Evaluate Division [Graph, Shortest Path]
  • ๐Ÿคจ [Q] [S] 0402. Remove K Digits [Mathematics, Stack, Greedy]
  • ๐Ÿ˜Š [Q] [S] 0404. Sum of Left Leaves [Tree, DFS]
  • ๐Ÿ”ž [Q] [S] 0406. Queue Reconstruction by Height [Greedy, Sort]
  • ๐Ÿ˜Š [Q] [S] 0409. Longest Palindrome
  • ๐Ÿ˜ซ [Q] [S] 0410. Split Array Largest Sum [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 0412. Fizz Buzz
  • ๐Ÿคจ [Q] [S] 0413. Arithmetic Slices [O(n), DP]
  • ๐Ÿคจ [Q] [S] 0417. Pacific Atlantic Water Flow [DFS, Graph]
  • ๐Ÿคจ [Q] [S] 0421. Maximum XOR of Two Numbers in an Array [Bit Manipulation, O(n), Greedy]
  • ๐Ÿคจ [Q] [S] 0430. Flatten a Multilevel Doubly Linked List [Tree]
  • ๐Ÿ”ž [Q] [S] 0435. Non-overlapping Intervals [Greedy]
  • ๐Ÿคจ [Q] [S] 0436. Find Right Interval [Hash Table, Binary Search]
  • ๐Ÿคจ [Q] [S] 0437. Path Sum III [Hash Table, Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0438. Find All Anagrams in a String [Array]
  • ๐Ÿ˜Š [Q] [S] 0441. Arranging Coins [Mathematics]
  • ๐Ÿคจ [Q] [S] 0442. Find All Duplicates in an Array [Array, O(n)]
  • ๐Ÿคจ [Q] [S] 0449. Serialize and Deserialize BST [Tree, Stack, String]
  • ๐Ÿคจ [Q] [S] 0450. Delete Node in a BST [Tree]
  • ๐Ÿคจ [Q] [S] 0451. Sort Characters By Frequency [Hash Table, String]
  • ๐Ÿคจ [Q] [S] 0452. Minimum Number of Arrows to Burst Balloons [Greedy, Sort]
  • ๐Ÿ˜Š [Q] [S] 0455. Assign Cookies [Greedy, O(n)]
  • ๐Ÿ”ž [Q] [S] 0456. 132 Pattern [Stack, O(n)]
  • ๐Ÿ”ž [Q] [S] 0459. Repeated Substring Pattern [String]
  • ๐Ÿ˜Š [Q] [S] 0461. Hamming Distance
  • ๐Ÿ˜Š [Q] [S] 0463. Island Perimeter
  • ๐Ÿคจ [Q] [S] 0468. Validate IP Address
  • ๐Ÿ”ž [Q] [S] 0470. Implement Rand10() Using Rand7() [Mathematics]
  • ๐Ÿ˜ซ [Q] [S] 0472. Concatenated Words [String, Tree, DFS]
  • ๐Ÿ˜Š [Q] [S] 0476. Number Complement [Mathematics]
  • ๐Ÿคจ [Q] [S] 0477. Total Hamming Distance [Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 0486. Predict the Winner [DP]
  • ๐Ÿ˜Š [Q] [S] 0492. Construct the Rectangle
  • ๐Ÿ˜ซ [Q] [S] 0493. Reverse Pairs [Sort, Two Pointers, Divide & Conquer]
  • ๐Ÿคจ [Q] [S] 0495. Teemo Attacking [O(n)]
  • ๐Ÿคจ [Q] [S] 0497. Random Point in Non-overlapping Rectangles [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 0506. Relative Ranks
  • ๐Ÿคจ [Q] [S] 0515. Find Largest Value in Each Tree Row [Tree, BFS]
  • ๐Ÿคจ [Q] [S] 0518. Coin Change 2 [DP]
  • ๐Ÿ˜Š [Q] [S] 0520. Detect Capital
  • ๐Ÿคจ [Q] [S] 0525. Contiguous Array [Array]
  • ๐Ÿคจ [Q] [S] 0528. Random Pick with Weight [Binary Search]
  • ๐Ÿคจ [Q] [S] 0532. K-diff Pairs in an Array [Hash Table]
  • ๐Ÿคจ [Q] [S] 0540. Single Element in a Sorted Array [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 0559. Maximum Depth of N-ary Tree [BFS, Tree]
  • ๐Ÿคจ [Q] [S] 0567. Permutation in String
  • ๐Ÿคจ [Q] [S] 0581. Shortest Unsorted Continuous Subarray [O(n), Stack]
  • ๐Ÿคจ [Q] [S] 0593. Valid Square
  • ๐Ÿ˜Š [Q] [S] 0594. Longest Harmonious Subsequence [Hash Table]
  • ๐Ÿ”ž [Q] [S] 0600. Non-negative Integers without Consecutive Ones [DP, Bit Manipulation]
  • ๐Ÿ”ž [Q] [S] 0621. Task Scheduler [Heap, Sort, O(n)]
  • ๐Ÿ”ž [Q] [S] 0630. Course Schedule III [Greedy]
  • ๐Ÿคจ [Q] [S] 0662. Maximum Width of Binary Tree [Tree]
  • ๐Ÿคจ [Q] [S] 0669. Trim a Binary Search Tree [Tree]
  • ๐Ÿคจ [Q] [S] 0684. Redundant Connection [Graph, Union Find]
  • ๐Ÿคจ [Q] [S] 0686. Repeated String Match [String]
  • ๐Ÿ˜Š [Q] [S] 0693. Binary Number with Alternating Bits [Bit Manipulation]
  • ๐Ÿ˜Š [Q] [S] 0700. Search in a Binary Search Tree [Tree]
  • ๐Ÿคจ [Q] [S] 0701. Insert into a Binary Search Tree [Tree]
  • ๐Ÿ˜Š [Q] [S] 0704. Binary Search [Binary Search, Array]
  • ๐Ÿ˜Š [Q] [S] 0705. Design HashSet [Hash Table]
  • ๐Ÿ˜ซ [Q] [S] 0710. Random Pick with Blacklist [Mathematics]
  • ๐Ÿคจ [Q] [S] 0713. Subarray Product Less Than K [O(n), Two Pointers]
  • ๐Ÿคจ [Q] [S] 0714. Best Time to Buy and Sell Stock with Transaction Fee [DP, State Machine, O(n)]
  • ๐Ÿคจ [Q] [S] 0718. Maximum Length of Repeated Subarray [DP]
  • ๐Ÿคจ [Q] [S] 0725. Split Linked List in Parts [Linked List]
  • ๐Ÿ˜Š [Q] [S] 0733. Flood Fill [Graph, BFS]
  • ๐Ÿคจ [Q] [S] 0735. Asteroid Collision [Stack, O(n)]
  • ๐Ÿคจ [Q] [S] 0743. Network Delay Time [Graph, Shortest Path]
  • ๐Ÿ˜Š [Q] [S] 0746. Min Cost Climbing Stairs [DP]
  • ๐Ÿคจ [Q] [S] 0763. Partition Labels [Greedy]
  • ๐Ÿ˜Š [Q] [S] 0771. Jewels and Stones [Hash Table]
  • ๐Ÿคจ [Q] [S] 0784. Letter Case Permutation
  • ๐Ÿคจ [Q] [S] 0785. Is Graph Bipartite? [Graph, DFS]
  • ๐Ÿ“ [Q] [S] 0787. Cheapest Flights Within K Stops [Graph, Shortest Path]
  • ๐Ÿคจ [Q] [S] 0797. All Paths From Source to Target [DFS, Graph]
  • ๐Ÿคจ [Q] [S] 0799. Champagne Tower [DP]
  • ๐Ÿ˜ซ [Q] [S] 0815. Bus Routes [BFS]
  • ๐Ÿ˜Š [Q] [S] 0821. Shortest Distance to a Character [O(n)]
  • ๐Ÿ˜Š [Q] [S] 0824. Goat Latin
  • ๐Ÿ˜Š [Q] [S] 0832. Flipping an Image
  • ๐Ÿคจ [Q] [S] 0835. Image Overlap [Hash Table]
  • ๐Ÿ“ [Q] [S] 0839. Similar String Groups
  • ๐Ÿคจ [Q] [S] 0841. Keys and Rooms [Graph, DFS]
  • ๐Ÿคจ [Q] [S] 0848. Shifting Letters
  • ๐Ÿคจ [Q] [S] 0849. Maximize Distance to Closest Person [O(n)]
  • ๐Ÿ˜ซ [Q] [S] 0850. Rectangle Area II [Mathematics]
  • ๐Ÿ”ž [Q] [S] 0857. Minimum Cost to Hire K Workers [Heap, Greedy]
  • ๐Ÿ˜Š [Q] [S] 0859. Buddy Strings [String]
  • ๐Ÿคจ [Q] [S] 0881. Boats to Save People [Greedy, Two Pointers]
  • ๐Ÿคจ [Q] [S] 0886. Possible Bipartition [Graph, DFS]
  • ๐Ÿ”ž [Q] [S] 0887. Super Egg Drop [DP]
  • ๐Ÿ˜Š [Q] [S] 0896. Monotonic Array
  • ๐Ÿคจ [Q] [S] 0901. Online Stock Span [Array, Stack]
  • ๐Ÿ˜Š [Q] [S] 0905. Sort Array By Parity [Sort, O(n)]
  • ๐Ÿคจ [Q] [S] 0912. Sort an Array [Sort]
  • ๐Ÿคจ [Q] [S] 0918. Maximum Sum Circular Subarray [DP]
  • ๐Ÿ˜ซ [Q] [S] 0920. Number of Music Playlists [DP]
  • ๐Ÿคจ [Q] [S] 0921. Minimum Add to Make Parentheses Valid [Stack]
  • ๐Ÿ˜Š [Q] [S] 0922. Sort Array By Parity II [Sort, O(n)]
  • ๐Ÿคจ [Q] [S] 0931. Minimum Falling Path Sum [DP]
  • ๐Ÿ˜Š [Q] [S] 0933. Number of Recent Calls [Binary Search]
  • ๐Ÿ˜ซ [Q] [S] 0936. Stamping The Sequence [Greedy]
  • ๐Ÿคจ [Q] [S] 0946. Validate Stack Sequences [O(n), Stack]
  • ๐Ÿคจ [Q] [S] 0948. Bag of Tokens [Two Pointers, O(n), Greedy]
  • ๐Ÿคจ [Q] [S] 0949. Largest Time for Given Digits [String, Mathematics]
  • ๐Ÿ”ž [Q] [S] 0952. Largest Component Size by Common Factor [Mathematics, Union Find]
  • ๐Ÿคจ [Q] [S] 0957. Prison Cells After N Days [Hash Table]
  • ๐Ÿ”ž [Q] [S] 0959. Regions Cut By Slashes [Union Find]
  • ๐Ÿ”ž [Q] [S] 0962. Maximum Width Ramp [Stack, Two Pointers]
  • ๐Ÿคจ [Q] [S] 0967. Numbers With Same Consecutive Differences [DFS]
  • ๐Ÿคจ [Q] [S] 0969. Pancake Sorting [Sort]
  • ๐Ÿคจ [Q] [S] 0973. K Closest Points to Origin [Sort]
  • ๐Ÿคจ [Q] [S] 0974. Subarray Sums Divisible by K [Hash Table]
  • ๐Ÿคจ [Q] [S] 0978. Longest Turbulent Subarray [DP, Sliding Windows]
  • ๐Ÿ˜ซ [Q] [S] 0980. Unique Paths III [Graph, DFS]
  • ๐Ÿคจ [Q] [S] 0983. Minimum Cost For Tickets [DP]
  • ๐Ÿคจ [Q] [S] 0984. String Without AAA or BBB [Greedy]
  • ๐Ÿคจ [Q] [S] 0986. Interval List Intersections [Two Pointers, Greedy]
  • ๐Ÿคฌ [Q] [S] 0987. Vertical Order Traversal of a Binary Tree [Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0990. Satisfiability of Equality Equations [Union Find]
  • ๐Ÿคจ [Q] [S] 0991. Broken Calculator [Greedy]
  • ๐Ÿ˜Š [Q] [S] 0993. Cousins in Binary Tree [Tree, DFS]
  • ๐Ÿคจ [Q] [S] 0994. Rotting Oranges [Graph, BFS]
  • ๐Ÿ˜Š [Q] [S] 0997. Find the Town Judge [Graph]
  • ๐Ÿคจ [Q] [S] 1007. Minimum Domino Rotations For Equal Row
  • ๐Ÿคจ [Q] [S] 1008. Construct Binary Search Tree from Preorder Traversal [Tree]
  • ๐Ÿ˜Š [Q] [S] 1009. Complement of Base 10 Integer [Mathematics]
  • ๐Ÿคจ [Q] [S] 1015. Smallest Integer Divisible by K
  • ๐Ÿ˜Š [Q] [S] 1021. Remove Outermost Parentheses [Stack]
  • ๐Ÿ˜Š [Q] [S] 1022. Sum of Root To Leaf Binary Numbers [Tree, DFS]
  • ๐Ÿ˜Š [Q] [S] 1025. Divisor Game [Mathematics]
  • ๐Ÿคจ [Q] [S] 1029. Two City Scheduling [Greedy]
  • ๐Ÿ˜ซ [Q] [S] 1032. Stream of Characters [Tree, String]
  • ๐Ÿคจ [Q] [S] 1035. Uncrossed Lines [DP]
  • ๐Ÿคจ [Q] [S] 1041. Robot Bounded In Circle
  • ๐Ÿคจ [Q] [S] 1043. Partition Array for Maximum Sum [DP]
  • ๐Ÿคฌ [Q] [S] 1044. Longest Duplicate Substring [Hash Table, Sliding Windows, String, Binary Search]
  • ๐Ÿคจ [Q] [S] 1090. Largest Values From Labels [Greedy]
  • ๐Ÿคจ [Q] [S] 1094. Car Pooling [Array]
  • ๐Ÿ˜Š [Q] [S] 1103. Distribute Candies to People
  • ๐Ÿ˜Š [Q] [S] 1108. Defanging an IP Address
  • ๐Ÿ˜Š [Q] [S] 1122. Relative Sort Array [Hash Table, Sort]
  • ๐Ÿ˜Š [Q] [S] 1200. Minimum Absolute Difference
  • ๐Ÿ”ž [Q] [S] 1203. Sort Items by Groups Respecting Dependencies [Graph, DFS]
  • ๐Ÿ˜Š [Q] [S] 1217. Minimum Cost to Move Chips to The Same Position
  • ๐Ÿ˜Š [Q] [S] 1221. Split a String in Balanced Strings
  • ๐Ÿ˜Š [Q] [S] 1232. Check If It Is a Straight Line [Mathematics]
  • ๐Ÿคจ [Q] [S] 1233. Remove Sub-Folders from the Filesystem [Tree, DFS, String, Binary Search]
  • ๐Ÿ˜ซ [Q] [S] 1235. Maximum Profit in Job Scheduling [DP, Binary Search]
  • ๐Ÿคจ [Q] [S] 1249. Minimum Remove to Make Valid Parentheses [O(n), Stack, String]
  • ๐Ÿ˜ซ [Q] [S] 1250. Check If It Is a Good Array [Mathematics]
  • ๐Ÿ”ž [Q] [S] 1263. Minimum Moves to Move a Box to Their Target Location [Graph, BFS, Shortest Path]
  • ๐Ÿ˜Š [Q] [S] 1266. Minimum Time Visiting All Points
  • ๐Ÿ”ž [Q] [S] 1277. Count Square Submatrices with All Ones [DP]
  • ๐Ÿ˜ซ [Q] [S] 1278. Palindrome Partitioning III [DP]
  • ๐Ÿ˜Š [Q] [S] 1281. Subtract the Product and Sum of Digits of an Integer
  • ๐Ÿคจ [Q] [S] 1282. Group the People Given the Group Size They Belong To
  • ๐Ÿคจ [Q] [S] 1283. Find the Smallest Divisor Given a Threshold
  • ๐Ÿคจ [Q] [S] 1286. Iterator for Combination [Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 1288. Remove Covered Intervals [Greedy, Sort]
  • ๐Ÿ“ [Q] [S] 1289. Minimum Falling Path Sum II [DP]
  • ๐Ÿ˜Š [Q] [S] 1290. Convert Binary Number in a Linked List to Integer [Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 1291. Sequential Digits [DFS]
  • ๐Ÿ˜Š [Q] [S] 1295. Find Numbers with Even Number of Digits
  • ๐Ÿ˜Š [Q] [S] 1299. Replace Elements with Greatest Element on Right Side
  • ๐Ÿคจ [Q] [S] 1305. All Elements in Two Binary Search Trees [Tree]
  • ๐Ÿคจ [Q] [S] 1306. Jump Game III [BFS]
  • ๐Ÿ˜Š [Q] [S] 1309. Decrypt String from Alphabet to Integer Mapping
  • ๐Ÿ˜Š [Q] [S] 1313. Decompress Run-Length Encoded List
  • ๐Ÿคจ [Q] [S] 1319. Number of Operations to Make Network Connected [Graph, Union Find]
  • ๐Ÿ”ž [Q] [S] 1330. Reverse Subarray To Maximize Array Value [Mathematics, O(n)]
  • ๐Ÿคจ [Q] [S] 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance [Graph, Shortest Path]
  • ๐Ÿ˜Š [Q] [S] 1337. The K Weakest Rows in a Matrix [Binary Search]
  • ๐Ÿ˜Š [Q] [S] 1342. Number of Steps to Reduce a Number to Zero
  • ๐Ÿคจ [Q] [S] 1344. Angle Between Hands of a Clock
  • ๐Ÿ˜ซ [Q] [S] 1345. Jump Game IV [BFS]
  • ๐Ÿ˜Š [Q] [S] 1351. Count Negative Numbers in a Sorted Matrix
  • ๐Ÿ˜ซ [Q] [S] 1363. Largest Multiple of Three [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 1365. How Many Numbers Are Smaller Than the Current Number
  • ๐Ÿคจ [Q] [S] 1367. Linked List in Binary Tree [Tree, DFS]
  • ๐Ÿ˜ซ [Q] [S] 1368. Minimum Cost to Make at Least One Valid Path in a Grid [Graph, Shortest Path]
  • ๐Ÿคจ [Q] [S] 1386. Cinema Seat Allocation [Greedy]
  • ๐Ÿคจ [Q] [S] 1391. Check if There is a Valid Path in a Grid [Graph, BFS]
  • ๐Ÿคจ [Q] [S] 1395. Count Number of Teams [Mathematics]
  • ๐Ÿคจ [Q] [S] 1404. Number of Steps to Reduce a Number in Binary Representation to One [O(n), Bit Manipulation]
  • ๐Ÿคจ [Q] [S] 1405. Longest Happy String [Greedy]
  • ๐Ÿ˜Š [Q] [S] 1431. Kids With the Greatest Number of Candies [Array]
  • ๐Ÿคจ [Q] [S] 1432. Max Difference You Can Get From Changing an Integer [Mathematics, Greedy]
  • ๐Ÿ˜Š [Q] [S] 1436. Destination City [Hash Table, Graph]
  • ๐Ÿ˜Š [Q] [S] 1446. Consecutive Characters
  • ๐Ÿ˜Š [Q] [S] 1450. Number of Students Doing Homework at a Given Time
  • ๐Ÿคจ [Q] [S] 1457. Pseudo-Palindromic Paths in a Binary Tree [Bit Manipulation, Tree]
  • ๐Ÿ˜Š [Q] [S] 1464. Maximum Product of Two Elements in an Array [Mathematics]
  • ๐Ÿ˜Š [Q] [S] 1475. Final Prices With a Special Discount in a Shop [Stack, O(n)]
  • ๐Ÿ”ž [Q] [S] 1494. Parallel Courses II [DP, Bit Manipulation, NP Complete]
  • ๐Ÿ˜Š [Q] [S] 1496. Path Crossing [Hash Table]
  • ๐Ÿ˜ซ [Q] [S] 1510. Stone Game IV [DP]
Todo
  • ๐Ÿคจ [Q] [S] 0018. 4Sum
  • ๐Ÿ˜ซ [Q] [S] 0030. Substring with Concatenation of All Words
  • ๐Ÿ˜ซ [Q] [S] 0037. Sudoku Solver
  • ๐Ÿคจ [Q] [S] 0047. Permutations II
  • ๐Ÿคจ [Q] [S] 0049. Group Anagrams
  • ๐Ÿคจ [Q] [S] 0054. Spiral Matrix
  • ๐Ÿคจ [Q] [S] 0059. Spiral Matrix II
  • ๐Ÿ˜ซ [Q] [S] 0068. Text Justification
  • ๐Ÿคจ [Q] [S] 0073. Set Matrix Zeroes
  • ๐Ÿคจ [Q] [S] 0077. Combinations
  • ๐Ÿคจ [Q] [S] 0079. Word Search
  • ๐Ÿคจ [Q] [S] 0081. Search in Rotated Sorted Array II
  • ๐Ÿคจ [Q] [S] 0082. Remove Duplicates from Sorted List II
  • ๐Ÿ˜Š [Q] [S] 0083. Remove Duplicates from Sorted List
  • ๐Ÿ˜ซ [Q] [S] 0084. Largest Rectangle in Histogram
  • ๐Ÿ˜ซ [Q] [S] 0085. Maximal Rectangle
  • ๐Ÿคจ [Q] [S] 0086. Partition List
  • ๐Ÿ˜Š [Q] [S] 0088. Merge Sorted Array
  • ๐Ÿคจ [Q] [S] 0089. Gray Code
  • ๐Ÿคจ [Q] [S] 0093. Restore IP Addresses
  • ๐Ÿคจ [Q] [S] 0094. Binary Tree Inorder Traversal
  • ๐Ÿคจ [Q] [S] 0095. Unique Binary Search Trees II
  • ๐Ÿ˜Š [Q] [S] 0101. Symmetric Tree
  • ๐Ÿ˜Š [Q] [S] 0104. Maximum Depth of Binary Tree
  • ๐Ÿ˜Š [Q] [S] 0108. Convert Sorted Array to Binary Search Tree
  • ๐Ÿคจ [Q] [S] 0109. Convert Sorted List to Binary Search Tree
  • ๐Ÿ˜Š [Q] [S] 0110. Balanced Binary Tree
  • ๐Ÿคจ [Q] [S] 0114. Flatten Binary Tree to Linked List
  • ๐Ÿ˜ซ [Q] [S] 0115. Distinct Subsequences
  • ๐Ÿคจ [Q] [S] 0116. Populating Next Right Pointers in Each Node
  • ๐Ÿคจ [Q] [S] 0117. Populating Next Right Pointers in Each Node II
  • ๐Ÿ˜ซ [Q] [S] 0124. Binary Tree Maximum Path Sum
  • ๐Ÿ˜ซ [Q] [S] 0126. Word Ladder II
  • ๐Ÿ˜ซ [Q] [S] 0128. Longest Consecutive Sequence
  • ๐Ÿคจ [Q] [S] 0144. Binary Tree Preorder Traversal
  • ๐Ÿคจ [Q] [S] 0145. Binary Tree Postorder Traversal
  • ๐Ÿคจ [Q] [S] 0146. LRU Cache
  • ๐Ÿ˜ซ [Q] [S] 0149. Max Points on a Line
  • ๐Ÿคจ [Q] [S] 0150. Evaluate Reverse Polish Notation
  • ๐Ÿ˜Š [Q] [S] 0155. Min Stack
  • ๐Ÿคจ [Q] [S] 0156. Binary Tree Upside Down
  • ๐Ÿ˜Š [Q] [S] 0157. Read N Characters Given Read4
  • ๐Ÿ˜ซ [Q] [S] 0158. Read N Characters Given Read4 II - Call multiple times
  • ๐Ÿคจ [Q] [S] 0159. Longest Substring with At Most Two Distinct Characters
  • ๐Ÿคจ [Q] [S] 0161. One Edit Distance
  • ๐Ÿคจ [Q] [S] 0162. Find Peak Element
  • ๐Ÿ˜Š [Q] [S] 0163. Missing Ranges
  • ๐Ÿ˜ซ [Q] [S] 0164. Maximum Gap
  • ๐Ÿคจ [Q] [S] 0166. Fraction to Recurring Decimal
  • ๐Ÿ˜Š [Q] [S] 0168. Excel Sheet Column Title
  • ๐Ÿ˜Š [Q] [S] 0170. Two Sum III - Data structure design
  • ๐Ÿ˜Š [Q] [S] 0172. Factorial Trailing Zeroes
  • ๐Ÿคจ [Q] [S] 0173. Binary Search Tree Iterator
  • ๐Ÿคจ [Q] [S] 0186. Reverse Words in a String II
  • ๐Ÿคจ [Q] [S] 0200. Number of Islands
  • ๐Ÿ˜Š [Q] [S] 0202. Happy Number
  • ๐Ÿ˜Š [Q] [S] 0205. Isomorphic Strings
  • ๐Ÿ˜ซ [Q] [S] 0212. Word Search II
  • ๐Ÿ˜ซ [Q] [S] 0214. Shortest Palindrome
  • ๐Ÿคจ [Q] [S] 0215. Kth Largest Element in an Array
  • ๐Ÿ˜ซ [Q] [S] 0218. The Skyline Problem
  • ๐Ÿคจ [Q] [S] 0221. Maximal Square
  • ๐Ÿคจ [Q] [S] 0223. Rectangle Area
  • ๐Ÿ˜ซ [Q] [S] 0224. Basic Calculator
  • ๐Ÿ˜Š [Q] [S] 0225. Implement Stack using Queues
  • ๐Ÿคจ [Q] [S] 0227. Basic Calculator II
  • ๐Ÿ˜Š [Q] [S] 0232. Implement Queue using Stacks
  • ๐Ÿ˜ซ [Q] [S] 0233. Number of Digit One
  • ๐Ÿ˜Š [Q] [S] 0234. Palindrome Linked List
  • ๐Ÿ˜Š [Q] [S] 0235. Lowest Common Ancestor of a Binary Search Tree
  • ๐Ÿคจ [Q] [S] 0236. Lowest Common Ancestor of a Binary Tree
  • ๐Ÿคจ [Q] [S] 0238. Product of Array Except Self
  • ๐Ÿ˜ซ [Q] [S] 0239. Sliding Window Maximum
  • ๐Ÿคจ [Q] [S] 0241. Different Ways to Add Parentheses
  • ๐Ÿ˜Š [Q] [S] 0243. Shortest Word Distance
  • ๐Ÿคจ [Q] [S] 0244. Shortest Word Distance II
  • ๐Ÿคจ [Q] [S] 0245. Shortest Word Distance III
  • ๐Ÿ˜Š [Q] [S] 0246. Strobogrammatic Number
  • ๐Ÿคจ [Q] [S] 0247. Strobogrammatic Number II
  • ๐Ÿ˜ซ [Q] [S] 0248. Strobogrammatic Number III
  • ๐Ÿคจ [Q] [S] 0249. Group Shifted Strings
  • ๐Ÿคจ [Q] [S] 0250. Count Univalue Subtrees
  • ๐Ÿคจ [Q] [S] 0251. Flatten 2D Vector
  • ๐Ÿ˜Š [Q] [S] 0252. Meeting Rooms
  • ๐Ÿคจ [Q] [S] 0253. Meeting Rooms II
  • ๐Ÿคจ [Q] [S] 0254. Factor Combinations
  • ๐Ÿคจ [Q] [S] 0255. Verify Preorder Sequence in Binary Search Tree
  • ๐Ÿคจ [Q] [S] 0256. Paint House
  • ๐Ÿ˜Š [Q] [S] 0257. Binary Tree Paths
  • ๐Ÿคจ [Q] [S] 0259. 3Sum Smaller
  • ๐Ÿคจ [Q] [S] 0261. Graph Valid Tree
  • ๐Ÿ˜ซ [Q] [S] 0265. Paint House II
  • ๐Ÿ˜Š [Q] [S] 0266. Palindrome Permutation
  • ๐Ÿคจ [Q] [S] 0267. Palindrome Permutation II
  • ๐Ÿ˜ซ [Q] [S] 0269. Alien Dictionary
  • ๐Ÿ˜Š [Q] [S] 0270. Closest Binary Search Tree Value
  • ๐Ÿคจ [Q] [S] 0271. Encode and Decode Strings
  • ๐Ÿ˜ซ [Q] [S] 0272. Closest Binary Search Tree Value II
  • ๐Ÿ˜ซ [Q] [S] 0273. Integer to English Words
  • ๐Ÿคจ [Q] [S] 0276. Paint Fence
  • ๐Ÿคจ [Q] [S] 0277. Find the Celebrity
  • ๐Ÿคจ [Q] [S] 0280. Wiggle Sort
  • ๐Ÿคจ [Q] [S] 0281. Zigzag Iterator
  • ๐Ÿ˜ซ [Q] [S] 0282. Expression Add Operators
  • ๐Ÿ˜Š [Q] [S] 0283. Move Zeroes
  • ๐Ÿคจ [Q] [S] 0285. Inorder Successor in BST
  • ๐Ÿคจ [Q] [S] 0286. Walls and Gates
  • ๐Ÿคจ [Q] [S] 0288. Unique Word Abbreviation
  • ๐Ÿคจ [Q] [S] 0289. Game of Life
  • ๐Ÿคจ [Q] [S] 0291. Word Pattern II
  • ๐Ÿ˜Š [Q] [S] 0292. Nim Game
  • ๐Ÿ˜Š [Q] [S] 0293. Flip Game
  • ๐Ÿคจ [Q] [S] 0294. Flip Game II
  • ๐Ÿ˜ซ [Q] [S] 0296. Best Meeting Point
  • ๐Ÿ˜ซ [Q] [S] 0297. Serialize and Deserialize Binary Tree
  • ๐Ÿคจ [Q] [S] 0298. Binary Tree Longest Consecutive Sequence
  • ๐Ÿ˜ซ [Q] [S] 0301. Remove Invalid Parentheses
  • ๐Ÿ˜ซ [Q] [S] 0302. Smallest Rectangle Enclosing Black Pixels
  • ๐Ÿ˜Š [Q] [S] 0303. Range Sum Query - Immutable
  • ๐Ÿคจ [Q] [S] 0304. Range Sum Query 2D - Immutable
  • ๐Ÿ˜ซ [Q] [S] 0305. Number of Islands II
  • ๐Ÿคจ [Q] [S] 0306. Additive Number
  • ๐Ÿคจ [Q] [S] 0307. Range Sum Query - Mutable
  • ๐Ÿ˜ซ [Q] [S] 0308. Range Sum Query 2D - Mutable
  • ๐Ÿคจ [Q] [S] 0311. Sparse Matrix Multiplication
  • ๐Ÿ˜ซ [Q] [S] 0312. Burst Balloons
  • ๐Ÿคจ [Q] [S] 0313. Super Ugly Number
  • ๐Ÿคจ [Q] [S] 0314. Binary Tree Vertical Order Traversal
  • ๐Ÿ˜ซ [Q] [S] 0317. Shortest Distance from All Buildings
  • ๐Ÿคจ [Q] [S] 0318. Maximum Product of Word Lengths
  • ๐Ÿคจ [Q] [S] 0319. Bulb Switcher
  • ๐Ÿคจ [Q] [S] 0320. Generalized Abbreviation
  • ๐Ÿ˜ซ [Q] [S] 0321. Create Maximum Number
  • ๐Ÿคจ [Q] [S] 0322. Coin Change
  • ๐Ÿคจ [Q] [S] 0323. Number of Connected Components in an Undirected Graph
  • ๐Ÿคจ [Q] [S] 0324. Wiggle Sort II
  • ๐Ÿคจ [Q] [S] 0325. Maximum Size Subarray Sum Equals k
  • ๐Ÿ˜ซ [Q] [S] 0327. Count of Range Sum
  • ๐Ÿ˜ซ [Q] [S] 0330. Patching Array
  • ๐Ÿคจ [Q] [S] 0331. Verify Preorder Serialization of a Binary Tree
  • ๐Ÿคจ [Q] [S] 0333. Largest BST Subtree
  • ๐Ÿคจ [Q] [S] 0334. Increasing Triplet Subsequence
  • ๐Ÿ˜ซ [Q] [S] 0335. Self Crossing
  • ๐Ÿ˜ซ [Q] [S] 0336. Palindrome Pairs
  • ๐Ÿคจ [Q] [S] 0337. House Robber III
  • ๐Ÿคจ [Q] [S] 0339. Nested List Weight Sum
  • ๐Ÿคจ [Q] [S] 0340. Longest Substring with At Most K Distinct Characters
  • ๐Ÿคจ [Q] [S] 0341. Flatten Nested List Iterator
  • ๐Ÿคจ [Q] [S] 0343. Integer Break
  • ๐Ÿ˜Š [Q] [S] 0345. Reverse Vowels of a String
  • ๐Ÿ˜Š [Q] [S] 0346. Moving Average from Data Stream
  • ๐Ÿคจ [Q] [S] 0348. Design Tic-Tac-Toe
  • ๐Ÿ˜Š [Q] [S] 0349. Intersection of Two Arrays
  • ๐Ÿคจ [Q] [S] 0351. Android Unlock Patterns
  • ๐Ÿ˜ซ [Q] [S] 0352. Data Stream as Disjoint Intervals
  • ๐Ÿคจ [Q] [S] 0353. Design Snake Game
  • ๐Ÿ˜ซ [Q] [S] 0354. Russian Doll Envelopes
  • ๐Ÿคจ [Q] [S] 0355. Design Twitter
  • ๐Ÿคจ [Q] [S] 0356. Line Reflection
  • ๐Ÿคจ [Q] [S] 0357. Count Numbers with Unique Digits
  • ๐Ÿ˜ซ [Q] [S] 0358. Rearrange String k Distance Apart
  • ๐Ÿ˜Š [Q] [S] 0359. Logger Rate Limiter
  • ๐Ÿคจ [Q] [S] 0360. Sort Transformed Array
  • ๐Ÿคจ [Q] [S] 0361. Bomb Enemy
  • ๐Ÿคจ [Q] [S] 0362. Design Hit Counter
  • ๐Ÿ˜ซ [Q] [S] 0363. Max Sum of Rectangle No Larger Than K
  • ๐Ÿคจ [Q] [S] 0364. Nested List Weight Sum II
  • ๐Ÿคจ [Q] [S] 0365. Water and Jug Problem
  • ๐Ÿคจ [Q] [S] 0366. Find Leaves of Binary Tree
  • ๐Ÿคจ [Q] [S] 0369. Plus One Linked List
  • ๐Ÿคจ [Q] [S] 0370. Range Addition
  • ๐Ÿคจ [Q] [S] 0371. Sum of Two Integers
  • ๐Ÿคจ [Q] [S] 0373. Find K Pairs with Smallest Sums
  • ๐Ÿ˜Š [Q] [S] 0374. Guess Number Higher or Lower
  • ๐Ÿคจ [Q] [S] 0375. Guess Number Higher or Lower II
  • ๐Ÿคจ [Q] [S] 0376. Wiggle Subsequence
  • ๐Ÿคจ [Q] [S] 0378. Kth Smallest Element in a Sorted Matrix
  • ๐Ÿคจ [Q] [S] 0379. Design Phone Directory
  • ๐Ÿ˜ซ [Q] [S] 0381. Insert Delete GetRandom O(1) - Duplicates allowed
  • ๐Ÿคจ [Q] [S] 0382. Linked List Random Node
  • ๐Ÿคจ [Q] [S] 0384. Shuffle an Array
  • ๐Ÿคจ [Q] [S] 0385. Mini Parser
  • ๐Ÿคจ [Q] [S] 0386. Lexicographical Numbers
  • ๐Ÿคจ [Q] [S] 0388. Longest Absolute File Path
  • ๐Ÿคจ [Q] [S] 0390. Elimination Game
  • ๐Ÿ˜ซ [Q] [S] 0391. Perfect Rectangle
  • ๐Ÿคจ [Q] [S] 0393. UTF-8 Validation
  • ๐Ÿคจ [Q] [S] 0394. Decode String
  • ๐Ÿคจ [Q] [S] 0395. Longest Substring with At Least K Repeating Characters
  • ๐Ÿคจ [Q] [S] 0396. Rotate Function
  • ๐Ÿคจ [Q] [S] 0398. Random Pick Index
  • ๐Ÿคจ [Q] [S] 0400. Nth Digit
  • ๐Ÿ˜Š [Q] [S] 0401. Binary Watch
  • ๐Ÿ˜ซ [Q] [S] 0403. Frog Jump
  • ๐Ÿ˜Š [Q] [S] 0405. Convert a Number to Hexadecimal
  • ๐Ÿ˜ซ [Q] [S] 0407. Trapping Rain Water II
  • ๐Ÿ˜Š [Q] [S] 0408. Valid Word Abbreviation
  • ๐Ÿ˜ซ [Q] [S] 0411. Minimum Unique Word Abbreviation
  • ๐Ÿ˜Š [Q] [S] 0414. Third Maximum Number
  • ๐Ÿ˜Š [Q] [S] 0415. Add Strings
  • ๐Ÿคจ [Q] [S] 0416. Partition Equal Subset Sum
  • ๐Ÿคจ [Q] [S] 0418. Sentence Screen Fitting
  • ๐Ÿคจ [Q] [S] 0419. Battleships in a Board
  • ๐Ÿ˜ซ [Q] [S] 0420. Strong Password Checker
  • ๐Ÿ˜Š [Q] [S] 0422. Valid Word Square
  • ๐Ÿคจ [Q] [S] 0423. Reconstruct Original Digits from English
  • ๐Ÿคจ [Q] [S] 0424. Longest Repeating Character Replacement
  • ๐Ÿ˜ซ [Q] [S] 0425. Word Squares
  • ๐Ÿคจ [Q] [S] 0426. Convert Binary Search Tree to Sorted Doubly Linked List
  • ๐Ÿคจ [Q] [S] 0427. Construct Quad Tree
  • ๐Ÿ˜ซ [Q] [S] 0428. Serialize and Deserialize N-ary Tree
  • ๐Ÿคจ [Q] [S] 0429. N-ary Tree Level Order Traversal
  • ๐Ÿ˜ซ [Q] [S] 0431. Encode N-ary Tree to Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 0432. All O`one Data Structure
  • ๐Ÿคจ [Q] [S] 0433. Minimum Genetic Mutation
  • ๐Ÿ˜Š [Q] [S] 0434. Number of Segments in a String
  • ๐Ÿคจ [Q] [S] 0439. Ternary Expression Parser
  • ๐Ÿ˜ซ [Q] [S] 0440. K-th Smallest in Lexicographical Order
  • ๐Ÿคจ [Q] [S] 0443. String Compression
  • ๐Ÿคจ [Q] [S] 0444. Sequence Reconstruction
  • ๐Ÿคจ [Q] [S] 0445. Add Two Numbers II
  • ๐Ÿ˜ซ [Q] [S] 0446. Arithmetic Slices II - Subsequence
  • ๐Ÿคจ [Q] [S] 0447. Number of Boomerangs
  • ๐Ÿ˜Š [Q] [S] 0448. Find All Numbers Disappeared in an Array
  • ๐Ÿ˜Š [Q] [S] 0453. Minimum Moves to Equal Array Elements
  • ๐Ÿคจ [Q] [S] 0454. 4Sum II
  • ๐Ÿคจ [Q] [S] 0457. Circular Array Loop
  • ๐Ÿ˜ซ [Q] [S] 0458. Poor Pigs
  • ๐Ÿ˜ซ [Q] [S] 0460. LFU Cache
  • ๐Ÿคจ [Q] [S] 0462. Minimum Moves to Equal Array Elements II
  • ๐Ÿคจ [Q] [S] 0464. Can I Win
  • ๐Ÿ˜ซ [Q] [S] 0465. Optimal Account Balancing
  • ๐Ÿ˜ซ [Q] [S] 0466. Count The Repetitions
  • ๐Ÿคจ [Q] [S] 0467. Unique Substrings in Wraparound String
  • ๐Ÿคจ [Q] [S] 0469. Convex Polygon
  • ๐Ÿ˜ซ [Q] [S] 0471. Encode String with Shortest Length
  • ๐Ÿคจ [Q] [S] 0473. Matchsticks to Square
  • ๐Ÿคจ [Q] [S] 0474. Ones and Zeroes
  • ๐Ÿคจ [Q] [S] 0475. Heaters
  • ๐Ÿคจ [Q] [S] 0478. Generate Random Point in a Circle
  • ๐Ÿ˜ซ [Q] [S] 0479. Largest Palindrome Product
  • ๐Ÿ˜ซ [Q] [S] 0480. Sliding Window Median
  • ๐Ÿคจ [Q] [S] 0481. Magical String
  • ๐Ÿ˜Š [Q] [S] 0482. License Key Formatting
  • ๐Ÿ˜ซ [Q] [S] 0483. Smallest Good Base
  • ๐Ÿคจ [Q] [S] 0484. Find Permutation
  • ๐Ÿ˜Š [Q] [S] 0485. Max Consecutive Ones
  • ๐Ÿคจ [Q] [S] 0487. Max Consecutive Ones II
  • ๐Ÿ˜ซ [Q] [S] 0488. Zuma Game
  • ๐Ÿ˜ซ [Q] [S] 0489. Robot Room Cleaner
  • ๐Ÿคจ [Q] [S] 0490. The Maze
  • ๐Ÿคจ [Q] [S] 0491. Increasing Subsequences
  • ๐Ÿคจ [Q] [S] 0494. Target Sum
  • ๐Ÿ˜Š [Q] [S] 0496. Next Greater Element I
  • ๐Ÿคจ [Q] [S] 0498. Diagonal Traverse
  • ๐Ÿ˜ซ [Q] [S] 0499. The Maze III
  • ๐Ÿ˜Š [Q] [S] 0500. Keyboard Row
  • ๐Ÿ˜Š [Q] [S] 0501. Find Mode in Binary Search Tree
  • ๐Ÿ˜ซ [Q] [S] 0502. IPO
  • ๐Ÿคจ [Q] [S] 0503. Next Greater Element II
  • ๐Ÿ˜Š [Q] [S] 0504. Base 7
  • ๐Ÿคจ [Q] [S] 0505. The Maze II
  • ๐Ÿ˜Š [Q] [S] 0507. Perfect Number
  • ๐Ÿคจ [Q] [S] 0508. Most Frequent Subtree Sum
  • ๐Ÿ˜Š [Q] [S] 0509. Fibonacci Number
  • ๐Ÿคจ [Q] [S] 0510. Inorder Successor in BST II
  • ๐Ÿคจ [Q] [S] 0513. Find Bottom Left Tree Value
  • ๐Ÿ˜ซ [Q] [S] 0514. Freedom Trail
  • ๐Ÿคจ [Q] [S] 0516. Longest Palindromic Subsequence
  • ๐Ÿ˜ซ [Q] [S] 0517. Super Washing Machines
  • ๐Ÿคจ [Q] [S] 0519. Random Flip Matrix
  • ๐Ÿ˜Š [Q] [S] 0521. Longest Uncommon Subsequence I
  • ๐Ÿคจ [Q] [S] 0522. Longest Uncommon Subsequence II
  • ๐Ÿคจ [Q] [S] 0523. Continuous Subarray Sum
  • ๐Ÿคจ [Q] [S] 0524. Longest Word in Dictionary through Deleting
  • ๐Ÿคจ [Q] [S] 0526. Beautiful Arrangement
  • ๐Ÿ˜ซ [Q] [S] 0527. Word Abbreviation
  • ๐Ÿคจ [Q] [S] 0529. Minesweeper
  • ๐Ÿ˜Š [Q] [S] 0530. Minimum Absolute Difference in BST
  • ๐Ÿคจ [Q] [S] 0531. Lonely Pixel I
  • ๐Ÿคจ [Q] [S] 0533. Lonely Pixel II
  • ๐Ÿคจ [Q] [S] 0535. Encode and Decode TinyURL
  • ๐Ÿคจ [Q] [S] 0536. Construct Binary Tree from String
  • ๐Ÿคจ [Q] [S] 0537. Complex Number Multiplication
  • ๐Ÿคจ [Q] [S] 0538. Convert BST to Greater Tree
  • ๐Ÿคจ [Q] [S] 0539. Minimum Time Difference
  • ๐Ÿ˜Š [Q] [S] 0541. Reverse String II
  • ๐Ÿคจ [Q] [S] 0542. 01 Matrix
  • ๐Ÿ˜Š [Q] [S] 0543. Diameter of Binary Tree
  • ๐Ÿคจ [Q] [S] 0544. Output Contest Matches
  • ๐Ÿคจ [Q] [S] 0545. Boundary of Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 0546. Remove Boxes
  • ๐Ÿคจ [Q] [S] 0547. Number of Provinces
  • ๐Ÿคจ [Q] [S] 0548. Split Array with Equal Sum
  • ๐Ÿคจ [Q] [S] 0549. Binary Tree Longest Consecutive Sequence II
  • ๐Ÿ˜Š [Q] [S] 0551. Student Attendance Record I
  • ๐Ÿ˜ซ [Q] [S] 0552. Student Attendance Record II
  • ๐Ÿคจ [Q] [S] 0553. Optimal Division
  • ๐Ÿคจ [Q] [S] 0554. Brick Wall
  • ๐Ÿคจ [Q] [S] 0555. Split Concatenated Strings
  • ๐Ÿคจ [Q] [S] 0556. Next Greater Element III
  • ๐Ÿ˜Š [Q] [S] 0557. Reverse Words in a String III
  • ๐Ÿคจ [Q] [S] 0558. Logical OR of Two Binary Grids Represented as Quad-Trees
  • ๐Ÿคจ [Q] [S] 0560. Subarray Sum Equals K
  • ๐Ÿ˜Š [Q] [S] 0561. Array Partition I
  • ๐Ÿคจ [Q] [S] 0562. Longest Line of Consecutive One in Matrix
  • ๐Ÿ˜Š [Q] [S] 0563. Binary Tree Tilt
  • ๐Ÿ˜ซ [Q] [S] 0564. Find the Closest Palindrome
  • ๐Ÿคจ [Q] [S] 0565. Array Nesting
  • ๐Ÿ˜Š [Q] [S] 0566. Reshape the Matrix
  • ๐Ÿ˜ซ [Q] [S] 0568. Maximum Vacation Days
  • ๐Ÿ˜Š [Q] [S] 0572. Subtree of Another Tree
  • ๐Ÿคจ [Q] [S] 0573. Squirrel Simulation
  • ๐Ÿ˜Š [Q] [S] 0575. Distribute Candies
  • ๐Ÿคจ [Q] [S] 0576. Out of Boundary Paths
  • ๐Ÿคจ [Q] [S] 0582. Kill Process
  • ๐Ÿคจ [Q] [S] 0583. Delete Operation for Two Strings
  • ๐Ÿ˜ซ [Q] [S] 0587. Erect the Fence
  • ๐Ÿ˜ซ [Q] [S] 0588. Design In-Memory File System
  • ๐Ÿ˜Š [Q] [S] 0589. N-ary Tree Preorder Traversal
  • ๐Ÿ˜Š [Q] [S] 0590. N-ary Tree Postorder Traversal
  • ๐Ÿ˜ซ [Q] [S] 0591. Tag Validator
  • ๐Ÿคจ [Q] [S] 0592. Fraction Addition and Subtraction
  • ๐Ÿ˜Š [Q] [S] 0598. Range Addition II
  • ๐Ÿ˜Š [Q] [S] 0599. Minimum Index Sum of Two Lists
  • ๐Ÿ˜Š [Q] [S] 0604. Design Compressed String Iterator
  • ๐Ÿ˜Š [Q] [S] 0605. Can Place Flowers
  • ๐Ÿ˜Š [Q] [S] 0606. Construct String from Binary Tree
  • ๐Ÿคจ [Q] [S] 0609. Find Duplicate File in System
  • ๐Ÿคจ [Q] [S] 0611. Valid Triangle Number
  • ๐Ÿคจ [Q] [S] 0616. Add Bold Tag in String
  • ๐Ÿ˜Š [Q] [S] 0617. Merge Two Binary Trees
  • ๐Ÿคจ [Q] [S] 0622. Design Circular Queue
  • ๐Ÿคจ [Q] [S] 0623. Add One Row to Tree
  • ๐Ÿคจ [Q] [S] 0624. Maximum Distance in Arrays
  • ๐Ÿคจ [Q] [S] 0625. Minimum Factorization
  • ๐Ÿ˜Š [Q] [S] 0628. Maximum Product of Three Numbers
  • ๐Ÿ˜ซ [Q] [S] 0629. K Inverse Pairs Array
  • ๐Ÿ˜ซ [Q] [S] 0631. Design Excel Sum Formula
  • ๐Ÿ˜ซ [Q] [S] 0632. Smallest Range Covering Elements from K Lists
  • ๐Ÿคจ [Q] [S] 0633. Sum of Square Numbers
  • ๐Ÿคจ [Q] [S] 0634. Find the Derangement of An Array
  • ๐Ÿคจ [Q] [S] 0635. Design Log Storage System
  • ๐Ÿคจ [Q] [S] 0636. Exclusive Time of Functions
  • ๐Ÿ˜Š [Q] [S] 0637. Average of Levels in Binary Tree
  • ๐Ÿคจ [Q] [S] 0638. Shopping Offers
  • ๐Ÿ˜ซ [Q] [S] 0639. Decode Ways II
  • ๐Ÿคจ [Q] [S] 0640. Solve the Equation
  • ๐Ÿคจ [Q] [S] 0641. Design Circular Deque
  • ๐Ÿ˜ซ [Q] [S] 0642. Design Search Autocomplete System
  • ๐Ÿ˜Š [Q] [S] 0643. Maximum Average Subarray I
  • ๐Ÿ˜ซ [Q] [S] 0644. Maximum Average Subarray II
  • ๐Ÿ˜Š [Q] [S] 0645. Set Mismatch
  • ๐Ÿคจ [Q] [S] 0646. Maximum Length of Pair Chain
  • ๐Ÿคจ [Q] [S] 0647. Palindromic Substrings
  • ๐Ÿคจ [Q] [S] 0648. Replace Words
  • ๐Ÿคจ [Q] [S] 0649. Dota2 Senate
  • ๐Ÿคจ [Q] [S] 0650. 2 Keys Keyboard
  • ๐Ÿคจ [Q] [S] 0651. 4 Keys Keyboard
  • ๐Ÿคจ [Q] [S] 0652. Find Duplicate Subtrees
  • ๐Ÿ˜Š [Q] [S] 0653. Two Sum IV - Input is a BST
  • ๐Ÿคจ [Q] [S] 0654. Maximum Binary Tree
  • ๐Ÿคจ [Q] [S] 0655. Print Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 0656. Coin Path
  • ๐Ÿ˜Š [Q] [S] 0657. Robot Return to Origin
  • ๐Ÿคจ [Q] [S] 0658. Find K Closest Elements
  • ๐Ÿคจ [Q] [S] 0659. Split Array into Consecutive Subsequences
  • ๐Ÿ˜ซ [Q] [S] 0660. Remove 9
  • ๐Ÿ˜Š [Q] [S] 0661. Image Smoother
  • ๐Ÿคจ [Q] [S] 0663. Equal Tree Partition
  • ๐Ÿ˜ซ [Q] [S] 0664. Strange Printer
  • ๐Ÿคจ [Q] [S] 0665. Non-decreasing Array
  • ๐Ÿคจ [Q] [S] 0666. Path Sum IV
  • ๐Ÿคจ [Q] [S] 0667. Beautiful Arrangement II
  • ๐Ÿ˜ซ [Q] [S] 0668. Kth Smallest Number in Multiplication Table
  • ๐Ÿคจ [Q] [S] 0670. Maximum Swap
  • ๐Ÿ˜Š [Q] [S] 0671. Second Minimum Node In a Binary Tree
  • ๐Ÿคจ [Q] [S] 0672. Bulb Switcher II
  • ๐Ÿคจ [Q] [S] 0673. Number of Longest Increasing Subsequence
  • ๐Ÿ˜Š [Q] [S] 0674. Longest Continuous Increasing Subsequence
  • ๐Ÿ˜ซ [Q] [S] 0675. Cut Off Trees for Golf Event
  • ๐Ÿคจ [Q] [S] 0676. Implement Magic Dictionary
  • ๐Ÿคจ [Q] [S] 0677. Map Sum Pairs
  • ๐Ÿคจ [Q] [S] 0678. Valid Parenthesis String
  • ๐Ÿ˜ซ [Q] [S] 0679. 24 Game
  • ๐Ÿ˜Š [Q] [S] 0680. Valid Palindrome II
  • ๐Ÿคจ [Q] [S] 0681. Next Closest Time
  • ๐Ÿ˜Š [Q] [S] 0682. Baseball Game
  • ๐Ÿ˜ซ [Q] [S] 0683. K Empty Slots
  • ๐Ÿ˜ซ [Q] [S] 0685. Redundant Connection II
  • ๐Ÿคจ [Q] [S] 0687. Longest Univalue Path
  • ๐Ÿคจ [Q] [S] 0688. Knight Probability in Chessboard
  • ๐Ÿ˜ซ [Q] [S] 0689. Maximum Sum of 3 Non-Overlapping Subarrays
  • ๐Ÿ˜Š [Q] [S] 0690. Employee Importance
  • ๐Ÿ˜ซ [Q] [S] 0691. Stickers to Spell Word
  • ๐Ÿคจ [Q] [S] 0692. Top K Frequent Words
  • ๐Ÿคจ [Q] [S] 0694. Number of Distinct Islands
  • ๐Ÿคจ [Q] [S] 0695. Max Area of Island
  • ๐Ÿ˜Š [Q] [S] 0696. Count Binary Substrings
  • ๐Ÿ˜Š [Q] [S] 0697. Degree of an Array
  • ๐Ÿคจ [Q] [S] 0698. Partition to K Equal Sum Subsets
  • ๐Ÿ˜ซ [Q] [S] 0699. Falling Squares
  • ๐Ÿคจ [Q] [S] 0702. Search in a Sorted Array of Unknown Size
  • ๐Ÿ˜Š [Q] [S] 0703. Kth Largest Element in a Stream
  • ๐Ÿ˜Š [Q] [S] 0706. Design HashMap
  • ๐Ÿคจ [Q] [S] 0707. Design Linked List
  • ๐Ÿคจ [Q] [S] 0708. Insert into a Sorted Circular Linked List
  • ๐Ÿ˜Š [Q] [S] 0709. To Lower Case
  • ๐Ÿ˜ซ [Q] [S] 0711. Number of Distinct Islands II
  • ๐Ÿคจ [Q] [S] 0712. Minimum ASCII Delete Sum for Two Strings
  • ๐Ÿ˜ซ [Q] [S] 0715. Range Module
  • ๐Ÿ˜Š [Q] [S] 0716. Max Stack
  • ๐Ÿ˜Š [Q] [S] 0717. 1-bit and 2-bit Characters
  • ๐Ÿ˜ซ [Q] [S] 0719. Find K-th Smallest Pair Distance
  • ๐Ÿ˜Š [Q] [S] 0720. Longest Word in Dictionary
  • ๐Ÿคจ [Q] [S] 0721. Accounts Merge
  • ๐Ÿคจ [Q] [S] 0722. Remove Comments
  • ๐Ÿคจ [Q] [S] 0723. Candy Crush
  • ๐Ÿ˜Š [Q] [S] 0724. Find Pivot Index
  • ๐Ÿ˜ซ [Q] [S] 0726. Number of Atoms
  • ๐Ÿ˜ซ [Q] [S] 0727. Minimum Window Subsequence
  • ๐Ÿ˜Š [Q] [S] 0728. Self Dividing Numbers
  • ๐Ÿคจ [Q] [S] 0729. My Calendar I
  • ๐Ÿ˜ซ [Q] [S] 0730. Count Different Palindromic Subsequences
  • ๐Ÿคจ [Q] [S] 0731. My Calendar II
  • ๐Ÿ˜ซ [Q] [S] 0732. My Calendar III
  • ๐Ÿ˜Š [Q] [S] 0734. Sentence Similarity
  • ๐Ÿ˜ซ [Q] [S] 0736. Parse Lisp Expression
  • ๐Ÿคจ [Q] [S] 0737. Sentence Similarity II
  • ๐Ÿคจ [Q] [S] 0738. Monotone Increasing Digits
  • ๐Ÿคจ [Q] [S] 0739. Daily Temperatures
  • ๐Ÿคจ [Q] [S] 0740. Delete and Earn
  • ๐Ÿ˜ซ [Q] [S] 0741. Cherry Pickup
  • ๐Ÿคจ [Q] [S] 0742. Closest Leaf in a Binary Tree
  • ๐Ÿ˜Š [Q] [S] 0744. Find Smallest Letter Greater Than Target
  • ๐Ÿ˜ซ [Q] [S] 0745. Prefix and Suffix Search
  • ๐Ÿ˜Š [Q] [S] 0747. Largest Number At Least Twice of Others
  • ๐Ÿ˜Š [Q] [S] 0748. Shortest Completing Word
  • ๐Ÿ˜ซ [Q] [S] 0749. Contain Virus
  • ๐Ÿคจ [Q] [S] 0750. Number Of Corner Rectangles
  • ๐Ÿคจ [Q] [S] 0751. IP to CIDR
  • ๐Ÿคจ [Q] [S] 0752. Open the Lock
  • ๐Ÿ˜ซ [Q] [S] 0753. Cracking the Safe
  • ๐Ÿคจ [Q] [S] 0754. Reach a Number
  • ๐Ÿคจ [Q] [S] 0755. Pour Water
  • ๐Ÿคจ [Q] [S] 0756. Pyramid Transition Matrix
  • ๐Ÿ˜ซ [Q] [S] 0757. Set Intersection Size At Least Two
  • ๐Ÿ˜Š [Q] [S] 0758. Bold Words in String
  • ๐Ÿ˜ซ [Q] [S] 0759. Employee Free Time
  • ๐Ÿ˜Š [Q] [S] 0760. Find Anagram Mappings
  • ๐Ÿ˜ซ [Q] [S] 0761. Special Binary String
  • ๐Ÿ˜Š [Q] [S] 0762. Prime Number of Set Bits in Binary Representation
  • ๐Ÿคจ [Q] [S] 0764. Largest Plus Sign
  • ๐Ÿ˜ซ [Q] [S] 0765. Couples Holding Hands
  • ๐Ÿ˜Š [Q] [S] 0766. Toeplitz Matrix
  • ๐Ÿคจ [Q] [S] 0767. Reorganize String
  • ๐Ÿ˜ซ [Q] [S] 0768. Max Chunks To Make Sorted II
  • ๐Ÿคจ [Q] [S] 0769. Max Chunks To Make Sorted
  • ๐Ÿ˜ซ [Q] [S] 0770. Basic Calculator IV
  • ๐Ÿ˜ซ [Q] [S] 0772. Basic Calculator III
  • ๐Ÿ˜ซ [Q] [S] 0773. Sliding Puzzle
  • ๐Ÿ˜ซ [Q] [S] 0774. Minimize Max Distance to Gas Station
  • ๐Ÿคจ [Q] [S] 0775. Global and Local Inversions
  • ๐Ÿคจ [Q] [S] 0776. Split BST
  • ๐Ÿคจ [Q] [S] 0777. Swap Adjacent in LR String
  • ๐Ÿ˜ซ [Q] [S] 0778. Swim in Rising Water
  • ๐Ÿคจ [Q] [S] 0779. K-th Symbol in Grammar
  • ๐Ÿ˜ซ [Q] [S] 0780. Reaching Points
  • ๐Ÿคจ [Q] [S] 0781. Rabbits in Forest
  • ๐Ÿ˜ซ [Q] [S] 0782. Transform to Chessboard
  • ๐Ÿ˜Š [Q] [S] 0783. Minimum Distance Between BST Nodes
  • ๐Ÿ˜ซ [Q] [S] 0786. K-th Smallest Prime Fraction
  • ๐Ÿ˜Š [Q] [S] 0788. Rotated Digits
  • ๐Ÿคจ [Q] [S] 0789. Escape The Ghosts
  • ๐Ÿคจ [Q] [S] 0790. Domino and Tromino Tiling
  • ๐Ÿคจ [Q] [S] 0791. Custom Sort String
  • ๐Ÿคจ [Q] [S] 0792. Number of Matching Subsequences
  • ๐Ÿ˜ซ [Q] [S] 0793. Preimage Size of Factorial Zeroes Function
  • ๐Ÿคจ [Q] [S] 0794. Valid Tic-Tac-Toe State
  • ๐Ÿคจ [Q] [S] 0795. Number of Subarrays with Bounded Maximum
  • ๐Ÿ˜Š [Q] [S] 0796. Rotate String
  • ๐Ÿ˜ซ [Q] [S] 0798. Smallest Rotation with Highest Score
  • ๐Ÿ˜Š [Q] [S] 0800. Similar RGB Color
  • ๐Ÿคจ [Q] [S] 0801. Minimum Swaps To Make Sequences Increasing
  • ๐Ÿคจ [Q] [S] 0802. Find Eventual Safe States
  • ๐Ÿ˜ซ [Q] [S] 0803. Bricks Falling When Hit
  • ๐Ÿ˜Š [Q] [S] 0804. Unique Morse Code Words
  • ๐Ÿ˜ซ [Q] [S] 0805. Split Array With Same Average
  • ๐Ÿ˜Š [Q] [S] 0806. Number of Lines To Write String
  • ๐Ÿคจ [Q] [S] 0807. Max Increase to Keep City Skyline
  • ๐Ÿคจ [Q] [S] 0808. Soup Servings
  • ๐Ÿคจ [Q] [S] 0809. Expressive Words
  • ๐Ÿ˜ซ [Q] [S] 0810. Chalkboard XOR Game
  • ๐Ÿ˜Š [Q] [S] 0811. Subdomain Visit Count
  • ๐Ÿ˜Š [Q] [S] 0812. Largest Triangle Area
  • ๐Ÿคจ [Q] [S] 0813. Largest Sum of Averages
  • ๐Ÿคจ [Q] [S] 0814. Binary Tree Pruning
  • ๐Ÿคจ [Q] [S] 0816. Ambiguous Coordinates
  • ๐Ÿคจ [Q] [S] 0817. Linked List Components
  • ๐Ÿ˜ซ [Q] [S] 0818. Race Car
  • ๐Ÿ˜Š [Q] [S] 0819. Most Common Word
  • ๐Ÿคจ [Q] [S] 0820. Short Encoding of Words
  • ๐Ÿคจ [Q] [S] 0822. Card Flipping Game
  • ๐Ÿคจ [Q] [S] 0823. Binary Trees With Factors
  • ๐Ÿคจ [Q] [S] 0825. Friends Of Appropriate Ages
  • ๐Ÿคจ [Q] [S] 0826. Most Profit Assigning Work
  • ๐Ÿ˜ซ [Q] [S] 0827. Making A Large Island
  • ๐Ÿ˜ซ [Q] [S] 0828. Count Unique Characters of All Substrings of a Given String
  • ๐Ÿ˜ซ [Q] [S] 0829. Consecutive Numbers Sum
  • ๐Ÿ˜Š [Q] [S] 0830. Positions of Large Groups
  • ๐Ÿคจ [Q] [S] 0831. Masking Personal Information
  • ๐Ÿคจ [Q] [S] 0833. Find And Replace in String
  • ๐Ÿ˜ซ [Q] [S] 0834. Sum of Distances in Tree
  • ๐Ÿ˜Š [Q] [S] 0836. Rectangle Overlap
  • ๐Ÿคจ [Q] [S] 0837. New 21 Game
  • ๐Ÿคจ [Q] [S] 0838. Push Dominoes
  • ๐Ÿคจ [Q] [S] 0840. Magic Squares In Grid
  • ๐Ÿคจ [Q] [S] 0842. Split Array into Fibonacci Sequence
  • ๐Ÿ˜ซ [Q] [S] 0843. Guess the Word
  • ๐Ÿ˜Š [Q] [S] 0844. Backspace String Compare
  • ๐Ÿคจ [Q] [S] 0845. Longest Mountain in Array
  • ๐Ÿคจ [Q] [S] 0846. Hand of Straights
  • ๐Ÿ˜ซ [Q] [S] 0847. Shortest Path Visiting All Nodes
  • ๐Ÿคจ [Q] [S] 0851. Loud and Rich
  • ๐Ÿ˜Š [Q] [S] 0852. Peak Index in a Mountain Array
  • ๐Ÿคจ [Q] [S] 0853. Car Fleet
  • ๐Ÿ˜ซ [Q] [S] 0854. K-Similar Strings
  • ๐Ÿคจ [Q] [S] 0855. Exam Room
  • ๐Ÿคจ [Q] [S] 0856. Score of Parentheses
  • ๐Ÿคจ [Q] [S] 0858. Mirror Reflection
  • ๐Ÿ˜Š [Q] [S] 0860. Lemonade Change
  • ๐Ÿคจ [Q] [S] 0861. Score After Flipping Matrix
  • ๐Ÿ˜ซ [Q] [S] 0862. Shortest Subarray with Sum at Least K
  • ๐Ÿคจ [Q] [S] 0863. All Nodes Distance K in Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 0864. Shortest Path to Get All Keys
  • ๐Ÿคจ [Q] [S] 0865. Smallest Subtree with all the Deepest Nodes
  • ๐Ÿคจ [Q] [S] 0866. Prime Palindrome
  • ๐Ÿ˜Š [Q] [S] 0867. Transpose Matrix
  • ๐Ÿ˜Š [Q] [S] 0868. Binary Gap
  • ๐Ÿคจ [Q] [S] 0869. Reordered Power of 2
  • ๐Ÿคจ [Q] [S] 0870. Advantage Shuffle
  • ๐Ÿ˜ซ [Q] [S] 0871. Minimum Number of Refueling Stops
  • ๐Ÿ˜Š [Q] [S] 0872. Leaf-Similar Trees
  • ๐Ÿคจ [Q] [S] 0873. Length of Longest Fibonacci Subsequence
  • ๐Ÿ˜Š [Q] [S] 0874. Walking Robot Simulation
  • ๐Ÿคจ [Q] [S] 0875. Koko Eating Bananas
  • ๐Ÿ˜Š [Q] [S] 0876. Middle of the Linked List
  • ๐Ÿคจ [Q] [S] 0877. Stone Game
  • ๐Ÿ˜ซ [Q] [S] 0878. Nth Magical Number
  • ๐Ÿ˜ซ [Q] [S] 0879. Profitable Schemes
  • ๐Ÿคจ [Q] [S] 0880. Decoded String at Index
  • ๐Ÿ˜ซ [Q] [S] 0882. Reachable Nodes In Subdivided Graph
  • ๐Ÿ˜Š [Q] [S] 0883. Projection Area of 3D Shapes
  • ๐Ÿ˜Š [Q] [S] 0884. Uncommon Words from Two Sentences
  • ๐Ÿคจ [Q] [S] 0885. Spiral Matrix III
  • ๐Ÿ˜Š [Q] [S] 0888. Fair Candy Swap
  • ๐Ÿคจ [Q] [S] 0889. Construct Binary Tree from Preorder and Postorder Traversal
  • ๐Ÿคจ [Q] [S] 0890. Find and Replace Pattern
  • ๐Ÿ˜ซ [Q] [S] 0891. Sum of Subsequence Widths
  • ๐Ÿ˜Š [Q] [S] 0892. Surface Area of 3D Shapes
  • ๐Ÿ˜Š [Q] [S] 0893. Groups of Special-Equivalent Strings
  • ๐Ÿคจ [Q] [S] 0894. All Possible Full Binary Trees
  • ๐Ÿ˜ซ [Q] [S] 0895. Maximum Frequency Stack
  • ๐Ÿ˜Š [Q] [S] 0897. Increasing Order Search Tree
  • ๐Ÿคจ [Q] [S] 0898. Bitwise ORs of Subarrays
  • ๐Ÿ˜ซ [Q] [S] 0899. Orderly Queue
  • ๐Ÿคจ [Q] [S] 0900. RLE Iterator
  • ๐Ÿ˜ซ [Q] [S] 0902. Numbers At Most N Given Digit Set
  • ๐Ÿ˜ซ [Q] [S] 0903. Valid Permutations for DI Sequence
  • ๐Ÿคจ [Q] [S] 0904. Fruit Into Baskets
  • ๐Ÿ˜ซ [Q] [S] 0906. Super Palindromes
  • ๐Ÿคจ [Q] [S] 0907. Sum of Subarray Minimums
  • ๐Ÿ˜Š [Q] [S] 0908. Smallest Range I
  • ๐Ÿคจ [Q] [S] 0909. Snakes and Ladders
  • ๐Ÿคจ [Q] [S] 0910. Smallest Range II
  • ๐Ÿคจ [Q] [S] 0911. Online Election
  • ๐Ÿ˜ซ [Q] [S] 0913. Cat and Mouse
  • ๐Ÿ˜Š [Q] [S] 0914. X of a Kind in a Deck of Cards
  • ๐Ÿคจ [Q] [S] 0915. Partition Array into Disjoint Intervals
  • ๐Ÿคจ [Q] [S] 0916. Word Subsets
  • ๐Ÿ˜Š [Q] [S] 0917. Reverse Only Letters
  • ๐Ÿคจ [Q] [S] 0919. Complete Binary Tree Inserter
  • ๐Ÿคจ [Q] [S] 0923. 3Sum With Multiplicity
  • ๐Ÿ˜ซ [Q] [S] 0924. Minimize Malware Spread
  • ๐Ÿ˜Š [Q] [S] 0925. Long Pressed Name
  • ๐Ÿคจ [Q] [S] 0926. Flip String to Monotone Increasing
  • ๐Ÿ˜ซ [Q] [S] 0927. Three Equal Parts
  • ๐Ÿ˜ซ [Q] [S] 0928. Minimize Malware Spread II
  • ๐Ÿ˜Š [Q] [S] 0929. Unique Email Addresses
  • ๐Ÿคจ [Q] [S] 0930. Binary Subarrays With Sum
  • ๐Ÿคจ [Q] [S] 0932. Beautiful Array
  • ๐Ÿคจ [Q] [S] 0934. Shortest Bridge
  • ๐Ÿคจ [Q] [S] 0935. Knight Dialer
  • ๐Ÿ˜Š [Q] [S] 0937. Reorder Data in Log Files
  • ๐Ÿ˜Š [Q] [S] 0938. Range Sum of BST
  • ๐Ÿคจ [Q] [S] 0939. Minimum Area Rectangle
  • ๐Ÿ˜ซ [Q] [S] 0940. Distinct Subsequences II
  • ๐Ÿ˜Š [Q] [S] 0941. Valid Mountain Array
  • ๐Ÿ˜Š [Q] [S] 0942. DI String Match
  • ๐Ÿ˜ซ [Q] [S] 0943. Find the Shortest Superstring
  • ๐Ÿ˜Š [Q] [S] 0944. Delete Columns to Make Sorted
  • ๐Ÿคจ [Q] [S] 0945. Minimum Increment to Make Array Unique
  • ๐Ÿคจ [Q] [S] 0947. Most Stones Removed with Same Row or Column
  • ๐Ÿคจ [Q] [S] 0950. Reveal Cards In Increasing Order
  • ๐Ÿคจ [Q] [S] 0951. Flip Equivalent Binary Trees
  • ๐Ÿ˜Š [Q] [S] 0953. Verifying an Alien Dictionary
  • ๐Ÿคจ [Q] [S] 0954. Array of Doubled Pairs
  • ๐Ÿคจ [Q] [S] 0955. Delete Columns to Make Sorted II
  • ๐Ÿ˜ซ [Q] [S] 0956. Tallest Billboard
  • ๐Ÿคจ [Q] [S] 0958. Check Completeness of a Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 0960. Delete Columns to Make Sorted III
  • ๐Ÿ˜Š [Q] [S] 0961. N-Repeated Element in Size 2N Array
  • ๐Ÿคจ [Q] [S] 0963. Minimum Area Rectangle II
  • ๐Ÿ˜ซ [Q] [S] 0964. Least Operators to Express Number
  • ๐Ÿ˜Š [Q] [S] 0965. Univalued Binary Tree
  • ๐Ÿคจ [Q] [S] 0966. Vowel Spellchecker
  • ๐Ÿ˜ซ [Q] [S] 0968. Binary Tree Cameras
  • ๐Ÿคจ [Q] [S] 0970. Powerful Integers
  • ๐Ÿคจ [Q] [S] 0971. Flip Binary Tree To Match Preorder Traversal
  • ๐Ÿ˜ซ [Q] [S] 0972. Equal Rational Numbers
  • ๐Ÿ˜ซ [Q] [S] 0975. Odd Even Jump
  • ๐Ÿ˜Š [Q] [S] 0976. Largest Perimeter Triangle
  • ๐Ÿ˜Š [Q] [S] 0977. Squares of a Sorted Array
  • ๐Ÿคจ [Q] [S] 0979. Distribute Coins in Binary Tree
  • ๐Ÿคจ [Q] [S] 0981. Time Based Key-Value Store
  • ๐Ÿ˜ซ [Q] [S] 0982. Triples with Bitwise AND Equal To Zero
  • ๐Ÿ˜Š [Q] [S] 0985. Sum of Even Numbers After Queries
  • ๐Ÿคจ [Q] [S] 0988. Smallest String Starting From Leaf
  • ๐Ÿ˜Š [Q] [S] 0989. Add to Array-Form of Integer
  • ๐Ÿ˜ซ [Q] [S] 0992. Subarrays with K Different Integers
  • ๐Ÿ˜ซ [Q] [S] 0995. Minimum Number of K Consecutive Bit Flips
  • ๐Ÿ˜ซ [Q] [S] 0996. Number of Squareful Arrays
  • ๐Ÿคจ [Q] [S] 0998. Maximum Binary Tree II
  • ๐Ÿ˜Š [Q] [S] 0999. Available Captures for Rook
  • ๐Ÿ˜ซ [Q] [S] 1000. Minimum Cost to Merge Stones
  • ๐Ÿ˜ซ [Q] [S] 1001. Grid Illumination
  • ๐Ÿ˜Š [Q] [S] 1002. Find Common Characters
  • ๐Ÿคจ [Q] [S] 1003. Check If Word Is Valid After Substitutions
  • ๐Ÿคจ [Q] [S] 1004. Max Consecutive Ones III
  • ๐Ÿ˜Š [Q] [S] 1005. Maximize Sum Of Array After K Negations
  • ๐Ÿคจ [Q] [S] 1006. Clumsy Factorial
  • ๐Ÿคจ [Q] [S] 1010. Pairs of Songs With Total Durations Divisible by 60
  • ๐Ÿคจ [Q] [S] 1011. Capacity To Ship Packages Within D Days
  • ๐Ÿ˜ซ [Q] [S] 1012. Numbers With Repeated Digits
  • ๐Ÿ˜Š [Q] [S] 1013. Partition Array Into Three Parts With Equal Sum
  • ๐Ÿคจ [Q] [S] 1014. Best Sightseeing Pair
  • ๐Ÿคจ [Q] [S] 1016. Binary String With Substrings Representing 1 To N
  • ๐Ÿคจ [Q] [S] 1017. Convert to Base -2
  • ๐Ÿ˜Š [Q] [S] 1018. Binary Prefix Divisible By 5
  • ๐Ÿคจ [Q] [S] 1019. Next Greater Node In Linked List
  • ๐Ÿคจ [Q] [S] 1020. Number of Enclaves
  • ๐Ÿคจ [Q] [S] 1023. Camelcase Matching
  • ๐Ÿคจ [Q] [S] 1024. Video Stitching
  • ๐Ÿคจ [Q] [S] 1026. Maximum Difference Between Node and Ancestor
  • ๐Ÿคจ [Q] [S] 1027. Longest Arithmetic Subsequence
  • ๐Ÿ˜ซ [Q] [S] 1028. Recover a Tree From Preorder Traversal
  • ๐Ÿ˜Š [Q] [S] 1030. Matrix Cells in Distance Order
  • ๐Ÿคจ [Q] [S] 1031. Maximum Sum of Two Non-Overlapping Subarrays
  • ๐Ÿ˜Š [Q] [S] 1033. Moving Stones Until Consecutive
  • ๐Ÿคจ [Q] [S] 1034. Coloring A Border
  • ๐Ÿ˜ซ [Q] [S] 1036. Escape a Large Maze
  • ๐Ÿ˜Š [Q] [S] 1037. Valid Boomerang
  • ๐Ÿคจ [Q] [S] 1038. Binary Search Tree to Greater Sum Tree
  • ๐Ÿคจ [Q] [S] 1039. Minimum Score Triangulation of Polygon
  • ๐Ÿคจ [Q] [S] 1040. Moving Stones Until Consecutive II
  • ๐Ÿคจ [Q] [S] 1042. Flower Planting With No Adjacent
  • ๐Ÿ˜Š [Q] [S] 1046. Last Stone Weight
  • ๐Ÿ˜Š [Q] [S] 1047. Remove All Adjacent Duplicates In String
  • ๐Ÿคจ [Q] [S] 1048. Longest String Chain
  • ๐Ÿคจ [Q] [S] 1049. Last Stone Weight II
  • ๐Ÿ˜Š [Q] [S] 1051. Height Checker
  • ๐Ÿคจ [Q] [S] 1052. Grumpy Bookstore Owner
  • ๐Ÿคจ [Q] [S] 1053. Previous Permutation With One Swap
  • ๐Ÿคจ [Q] [S] 1054. Distant Barcodes
  • ๐Ÿคจ [Q] [S] 1055. Shortest Way to Form String
  • ๐Ÿ˜Š [Q] [S] 1056. Confusing Number
  • ๐Ÿคจ [Q] [S] 1057. Campus Bikes
  • ๐Ÿคจ [Q] [S] 1058. Minimize Rounding Error to Meet Target
  • ๐Ÿคจ [Q] [S] 1059. All Paths from Source Lead to Destination
  • ๐Ÿคจ [Q] [S] 1060. Missing Element in Sorted Array
  • ๐Ÿคจ [Q] [S] 1061. Lexicographically Smallest Equivalent String
  • ๐Ÿคจ [Q] [S] 1062. Longest Repeating Substring
  • ๐Ÿ˜ซ [Q] [S] 1063. Number of Valid Subarrays
  • ๐Ÿ˜Š [Q] [S] 1064. Fixed Point
  • ๐Ÿ˜Š [Q] [S] 1065. Index Pairs of a String
  • ๐Ÿคจ [Q] [S] 1066. Campus Bikes II
  • ๐Ÿ˜ซ [Q] [S] 1067. Digit Count in Range
  • ๐Ÿ˜Š [Q] [S] 1071. Greatest Common Divisor of Strings
  • ๐Ÿคจ [Q] [S] 1072. Flip Columns For Maximum Number of Equal Rows
  • ๐Ÿคจ [Q] [S] 1073. Adding Two Negabinary Numbers
  • ๐Ÿ˜ซ [Q] [S] 1074. Number of Submatrices That Sum to Target
  • ๐Ÿ˜Š [Q] [S] 1078. Occurrences After Bigram
  • ๐Ÿคจ [Q] [S] 1079. Letter Tile Possibilities
  • ๐Ÿคจ [Q] [S] 1080. Insufficient Nodes in Root to Leaf Paths
  • ๐Ÿคจ [Q] [S] 1081. Smallest Subsequence of Distinct Characters
  • ๐Ÿ˜Š [Q] [S] 1085. Sum of Digits in the Minimum Number
  • ๐Ÿ˜Š [Q] [S] 1086. High Five
  • ๐Ÿคจ [Q] [S] 1087. Brace Expansion
  • ๐Ÿ˜ซ [Q] [S] 1088. Confusing Number II
  • ๐Ÿ˜Š [Q] [S] 1089. Duplicate Zeros
  • ๐Ÿคจ [Q] [S] 1091. Shortest Path in Binary Matrix
  • ๐Ÿ˜ซ [Q] [S] 1092. Shortest Common Supersequence
  • ๐Ÿคจ [Q] [S] 1093. Statistics from a Large Sample
  • ๐Ÿ˜ซ [Q] [S] 1095. Find in Mountain Array
  • ๐Ÿ˜ซ [Q] [S] 1096. Brace Expansion II
  • ๐Ÿ˜Š [Q] [S] 1099. Two Sum Less Than K
  • ๐Ÿคจ [Q] [S] 1100. Find K-Length Substrings With No Repeated Characters
  • ๐Ÿคจ [Q] [S] 1101. The Earliest Moment When Everyone Become Friends
  • ๐Ÿคจ [Q] [S] 1102. Path With Maximum Minimum Value
  • ๐Ÿคจ [Q] [S] 1104. Path In Zigzag Labelled Binary Tree
  • ๐Ÿคจ [Q] [S] 1105. Filling Bookcase Shelves
  • ๐Ÿ˜ซ [Q] [S] 1106. Parsing A Boolean Expression
  • ๐Ÿคจ [Q] [S] 1109. Corporate Flight Bookings
  • ๐Ÿคจ [Q] [S] 1110. Delete Nodes And Return Forest
  • ๐Ÿคจ [Q] [S] 1111. Maximum Nesting Depth of Two Valid Parentheses Strings
  • ๐Ÿ˜Š [Q] [S] 1118. Number of Days in a Month
  • ๐Ÿ˜Š [Q] [S] 1119. Remove Vowels from a String
  • ๐Ÿคจ [Q] [S] 1120. Maximum Average Subtree
  • ๐Ÿ˜ซ [Q] [S] 1121. Divide Array Into Increasing Sequences
  • ๐Ÿคจ [Q] [S] 1123. Lowest Common Ancestor of Deepest Leaves
  • ๐Ÿคจ [Q] [S] 1124. Longest Well-Performing Interval
  • ๐Ÿ˜ซ [Q] [S] 1125. Smallest Sufficient Team
  • ๐Ÿ˜Š [Q] [S] 1128. Number of Equivalent Domino Pairs
  • ๐Ÿคจ [Q] [S] 1129. Shortest Path with Alternating Colors
  • ๐Ÿคจ [Q] [S] 1130. Minimum Cost Tree From Leaf Values
  • ๐Ÿคจ [Q] [S] 1131. Maximum of Absolute Value Expression
  • ๐Ÿ˜Š [Q] [S] 1133. Largest Unique Number
  • ๐Ÿ˜Š [Q] [S] 1134. Armstrong Number
  • ๐Ÿคจ [Q] [S] 1135. Connecting Cities With Minimum Cost
  • ๐Ÿคจ [Q] [S] 1136. Parallel Courses
  • ๐Ÿ˜Š [Q] [S] 1137. N-th Tribonacci Number
  • ๐Ÿคจ [Q] [S] 1138. Alphabet Board Path
  • ๐Ÿคจ [Q] [S] 1139. Largest 1-Bordered Square
  • ๐Ÿคจ [Q] [S] 1140. Stone Game II
  • ๐Ÿคจ [Q] [S] 1143. Longest Common Subsequence
  • ๐Ÿคจ [Q] [S] 1144. Decrease Elements To Make Array Zigzag
  • ๐Ÿคจ [Q] [S] 1145. Binary Tree Coloring Game
  • ๐Ÿคจ [Q] [S] 1146. Snapshot Array
  • ๐Ÿ˜ซ [Q] [S] 1147. Longest Chunked Palindrome Decomposition
  • ๐Ÿ˜Š [Q] [S] 1150. Check If a Number Is Majority Element in a Sorted Array
  • ๐Ÿคจ [Q] [S] 1151. Minimum Swaps to Group All 1's Together
  • ๐Ÿคจ [Q] [S] 1152. Analyze User Website Visit Pattern
  • ๐Ÿ˜ซ [Q] [S] 1153. String Transforms Into Another String
  • ๐Ÿ˜Š [Q] [S] 1154. Day of the Year
  • ๐Ÿคจ [Q] [S] 1155. Number of Dice Rolls With Target Sum
  • ๐Ÿคจ [Q] [S] 1156. Swap For Longest Repeated Character Substring
  • ๐Ÿ˜ซ [Q] [S] 1157. Online Majority Element In Subarray
  • ๐Ÿ˜Š [Q] [S] 1160. Find Words That Can Be Formed by Characters
  • ๐Ÿคจ [Q] [S] 1161. Maximum Level Sum of a Binary Tree
  • ๐Ÿคจ [Q] [S] 1162. As Far from Land as Possible
  • ๐Ÿ˜ซ [Q] [S] 1163. Last Substring in Lexicographical Order
  • ๐Ÿ˜Š [Q] [S] 1165. Single-Row Keyboard
  • ๐Ÿคจ [Q] [S] 1166. Design File System
  • ๐Ÿคจ [Q] [S] 1167. Minimum Cost to Connect Sticks
  • ๐Ÿ˜ซ [Q] [S] 1168. Optimize Water Distribution in a Village
  • ๐Ÿคจ [Q] [S] 1169. Invalid Transactions
  • ๐Ÿคจ [Q] [S] 1170. Compare Strings by Frequency of the Smallest Character
  • ๐Ÿคจ [Q] [S] 1171. Remove Zero Sum Consecutive Nodes from Linked List
  • ๐Ÿ˜ซ [Q] [S] 1172. Dinner Plate Stacks
  • ๐Ÿ˜Š [Q] [S] 1175. Prime Arrangements
  • ๐Ÿ˜Š [Q] [S] 1176. Diet Plan Performance
  • ๐Ÿคจ [Q] [S] 1177. Can Make Palindrome from Substring
  • ๐Ÿ˜ซ [Q] [S] 1178. Number of Valid Words for Each Puzzle
  • ๐Ÿ˜Š [Q] [S] 1180. Count Substrings with Only One Distinct Letter
  • ๐Ÿคจ [Q] [S] 1181. Before and After Puzzle
  • ๐Ÿคจ [Q] [S] 1182. Shortest Distance to Target Color
  • ๐Ÿ˜ซ [Q] [S] 1183. Maximum Number of Ones
  • ๐Ÿ˜Š [Q] [S] 1184. Distance Between Bus Stops
  • ๐Ÿ˜Š [Q] [S] 1185. Day of the Week
  • ๐Ÿคจ [Q] [S] 1186. Maximum Subarray Sum with One Deletion
  • ๐Ÿ˜ซ [Q] [S] 1187. Make Array Strictly Increasing
  • ๐Ÿ˜Š [Q] [S] 1189. Maximum Number of Balloons
  • ๐Ÿคจ [Q] [S] 1190. Reverse Substrings Between Each Pair of Parentheses
  • ๐Ÿคจ [Q] [S] 1191. K-Concatenation Maximum Sum
  • ๐Ÿ˜ซ [Q] [S] 1192. Critical Connections in a Network
  • ๐Ÿ˜Š [Q] [S] 1196. How Many Apples Can You Put into the Basket
  • ๐Ÿคจ [Q] [S] 1197. Minimum Knight Moves
  • ๐Ÿคจ [Q] [S] 1198. Find Smallest Common Element in All Rows
  • ๐Ÿ˜ซ [Q] [S] 1199. Minimum Time to Build Blocks
  • ๐Ÿคจ [Q] [S] 1201. Ugly Number III
  • ๐Ÿคจ [Q] [S] 1202. Smallest String With Swaps
  • ๐Ÿ˜ซ [Q] [S] 1206. Design Skiplist
  • ๐Ÿ˜Š [Q] [S] 1207. Unique Number of Occurrences
  • ๐Ÿคจ [Q] [S] 1208. Get Equal Substrings Within Budget
  • ๐Ÿคจ [Q] [S] 1209. Remove All Adjacent Duplicates in String II
  • ๐Ÿ˜ซ [Q] [S] 1210. Minimum Moves to Reach Target with Rotations
  • ๐Ÿ˜Š [Q] [S] 1213. Intersection of Three Sorted Arrays
  • ๐Ÿคจ [Q] [S] 1214. Two Sum BSTs
  • ๐Ÿคจ [Q] [S] 1215. Stepping Numbers
  • ๐Ÿ˜ซ [Q] [S] 1216. Valid Palindrome III
  • ๐Ÿคจ [Q] [S] 1218. Longest Arithmetic Subsequence of Given Difference
  • ๐Ÿคจ [Q] [S] 1219. Path with Maximum Gold
  • ๐Ÿ˜ซ [Q] [S] 1220. Count Vowels Permutation
  • ๐Ÿคจ [Q] [S] 1222. Queens That Can Attack the King
  • ๐Ÿ˜ซ [Q] [S] 1223. Dice Roll Simulation
  • ๐Ÿ˜ซ [Q] [S] 1224. Maximum Equal Frequency
  • ๐Ÿคจ [Q] [S] 1227. Airplane Seat Assignment Probability
  • ๐Ÿ˜Š [Q] [S] 1228. Missing Number In Arithmetic Progression
  • ๐Ÿคจ [Q] [S] 1229. Meeting Scheduler
  • ๐Ÿคจ [Q] [S] 1230. Toss Strange Coins
  • ๐Ÿ˜ซ [Q] [S] 1231. Divide Chocolate
  • ๐Ÿคจ [Q] [S] 1234. Replace the Substring for Balanced String
  • ๐Ÿคจ [Q] [S] 1236. Web Crawler
  • ๐Ÿคจ [Q] [S] 1237. Find Positive Integer Solution for a Given Equation
  • ๐Ÿคจ [Q] [S] 1238. Circular Permutation in Binary Representation
  • ๐Ÿคจ [Q] [S] 1239. Maximum Length of a Concatenated String with Unique Characters
  • ๐Ÿ˜ซ [Q] [S] 1240. Tiling a Rectangle with the Fewest Squares
  • ๐Ÿ˜Š [Q] [S] 1243. Array Transformation
  • ๐Ÿคจ [Q] [S] 1244. Design A Leaderboard
  • ๐Ÿคจ [Q] [S] 1245. Tree Diameter
  • ๐Ÿ˜ซ [Q] [S] 1246. Palindrome Removal
  • ๐Ÿคจ [Q] [S] 1247. Minimum Swaps to Make Strings Equal
  • ๐Ÿคจ [Q] [S] 1248. Count Number of Nice Subarrays
  • ๐Ÿ˜Š [Q] [S] 1252. Cells with Odd Values in a Matrix
  • ๐Ÿคจ [Q] [S] 1253. Reconstruct a 2-Row Binary Matrix
  • ๐Ÿคจ [Q] [S] 1254. Number of Closed Islands
  • ๐Ÿ˜ซ [Q] [S] 1255. Maximum Score Words Formed by Letters
  • ๐Ÿคจ [Q] [S] 1256. Encode Number
  • ๐Ÿคจ [Q] [S] 1257. Smallest Common Region
  • ๐Ÿคจ [Q] [S] 1258. Synonymous Sentences
  • ๐Ÿ˜ซ [Q] [S] 1259. Handshakes That Don't Cross
  • ๐Ÿ˜Š [Q] [S] 1260. Shift 2D Grid
  • ๐Ÿคจ [Q] [S] 1261. Find Elements in a Contaminated Binary Tree
  • ๐Ÿคจ [Q] [S] 1262. Greatest Sum Divisible by Three
  • ๐Ÿคจ [Q] [S] 1265. Print Immutable Linked List in Reverse
  • ๐Ÿคจ [Q] [S] 1267. Count Servers that Communicate
  • ๐Ÿคจ [Q] [S] 1268. Search Suggestions System
  • ๐Ÿ˜ซ [Q] [S] 1269. Number of Ways to Stay in the Same Place After Some Steps
  • ๐Ÿ˜Š [Q] [S] 1271. Hexspeak
  • ๐Ÿคจ [Q] [S] 1272. Remove Interval
  • ๐Ÿคจ [Q] [S] 1273. Delete Tree Nodes
  • ๐Ÿ˜ซ [Q] [S] 1274. Number of Ships in a Rectangle
  • ๐Ÿ˜Š [Q] [S] 1275. Find Winner on a Tic Tac Toe Game
  • ๐Ÿคจ [Q] [S] 1276. Number of Burgers with No Waste of Ingredients
  • ๐Ÿ˜ซ [Q] [S] 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
  • ๐Ÿ˜Š [Q] [S] 1287. Element Appearing More Than 25% In Sorted Array
  • ๐Ÿคจ [Q] [S] 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
  • ๐Ÿ˜ซ [Q] [S] 1293. Shortest Path in a Grid with Obstacles Elimination
  • ๐Ÿคจ [Q] [S] 1296. Divide Array in Sets of K Consecutive Numbers
  • ๐Ÿคจ [Q] [S] 1297. Maximum Number of Occurrences of a Substring
  • ๐Ÿ˜ซ [Q] [S] 1298. Maximum Candies You Can Get from Boxes
  • ๐Ÿคจ [Q] [S] 1300. Sum of Mutated Array Closest to Target
  • ๐Ÿ˜ซ [Q] [S] 1301. Number of Paths with Max Score
  • ๐Ÿคจ [Q] [S] 1302. Deepest Leaves Sum
  • ๐Ÿ˜Š [Q] [S] 1304. Find N Unique Integers Sum up to Zero
  • ๐Ÿ˜ซ [Q] [S] 1307. Verbal Arithmetic Puzzle
  • ๐Ÿคจ [Q] [S] 1310. XOR Queries of a Subarray
  • ๐Ÿคจ [Q] [S] 1311. Get Watched Videos by Your Friends
  • ๐Ÿ˜ซ [Q] [S] 1312. Minimum Insertion Steps to Make a String Palindrome
  • ๐Ÿคจ [Q] [S] 1314. Matrix Block Sum
  • ๐Ÿคจ [Q] [S] 1315. Sum of Nodes with Even-Valued Grandparent
  • ๐Ÿ˜ซ [Q] [S] 1316. Distinct Echo Substrings
  • ๐Ÿ˜Š [Q] [S] 1317. Convert Integer to the Sum of Two No-Zero Integers
  • ๐Ÿคจ [Q] [S] 1318. Minimum Flips to Make a OR b Equal to c
  • ๐Ÿ˜ซ [Q] [S] 1320. Minimum Distance to Type a Word Using Two Fingers
  • ๐Ÿ˜Š [Q] [S] 1323. Maximum 69 Number
  • ๐Ÿคจ [Q] [S] 1324. Print Words Vertically
  • ๐Ÿคจ [Q] [S] 1325. Delete Leaves With a Given Value
  • ๐Ÿ˜ซ [Q] [S] 1326. Minimum Number of Taps to Open to Water a Garden
  • ๐Ÿคจ [Q] [S] 1328. Break a Palindrome
  • ๐Ÿคจ [Q] [S] 1329. Sort the Matrix Diagonally
  • ๐Ÿ˜Š [Q] [S] 1331. Rank Transform of an Array
  • ๐Ÿ˜Š [Q] [S] 1332. Remove Palindromic Subsequences
  • ๐Ÿคจ [Q] [S] 1333. Filter Restaurants by Vegan-Friendly, Price and Distance
  • ๐Ÿ˜ซ [Q] [S] 1335. Minimum Difficulty of a Job Schedule
  • ๐Ÿคจ [Q] [S] 1338. Reduce Array Size to The Half
  • ๐Ÿคจ [Q] [S] 1339. Maximum Product of Splitted Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 1340. Jump Game V
  • ๐Ÿคจ [Q] [S] 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
  • ๐Ÿ˜Š [Q] [S] 1346. Check If N and Its Double Exist
  • ๐Ÿคจ [Q] [S] 1347. Minimum Number of Steps to Make Two Strings Anagram
  • ๐Ÿคจ [Q] [S] 1348. Tweet Counts Per Frequency
  • ๐Ÿ˜ซ [Q] [S] 1349. Maximum Students Taking Exam
  • ๐Ÿคจ [Q] [S] 1352. Product of the Last K Numbers
  • ๐Ÿคจ [Q] [S] 1353. Maximum Number of Events That Can Be Attended
  • ๐Ÿ˜ซ [Q] [S] 1354. Construct Target Array With Multiple Sums
  • ๐Ÿ˜Š [Q] [S] 1356. Sort Integers by The Number of 1 Bits
  • ๐Ÿคจ [Q] [S] 1357. Apply Discount Every n Orders
  • ๐Ÿคจ [Q] [S] 1358. Number of Substrings Containing All Three Characters
  • ๐Ÿ˜ซ [Q] [S] 1359. Count All Valid Pickup and Delivery Options
  • ๐Ÿ˜Š [Q] [S] 1360. Number of Days Between Two Dates
  • ๐Ÿคจ [Q] [S] 1361. Validate Binary Tree Nodes
  • ๐Ÿคจ [Q] [S] 1362. Closest Divisors
  • ๐Ÿคจ [Q] [S] 1366. Rank Teams by Votes
  • ๐Ÿ˜Š [Q] [S] 1370. Increasing Decreasing String
  • ๐Ÿคจ [Q] [S] 1371. Find the Longest Substring Containing Vowels in Even Counts
  • ๐Ÿคจ [Q] [S] 1372. Longest ZigZag Path in a Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 1373. Maximum Sum BST in Binary Tree
  • ๐Ÿ˜Š [Q] [S] 1374. Generate a String With Characters That Have Odd Counts
  • ๐Ÿคจ [Q] [S] 1375. Bulb Switcher III
  • ๐Ÿคจ [Q] [S] 1376. Time Needed to Inform All Employees
  • ๐Ÿ˜ซ [Q] [S] 1377. Frog Position After T Seconds
  • ๐Ÿคจ [Q] [S] 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
  • ๐Ÿ˜Š [Q] [S] 1380. Lucky Numbers in a Matrix
  • ๐Ÿคจ [Q] [S] 1381. Design a Stack With Increment Operation
  • ๐Ÿคจ [Q] [S] 1382. Balance a Binary Search Tree
  • ๐Ÿ˜ซ [Q] [S] 1383. Maximum Performance of a Team
  • ๐Ÿ˜Š [Q] [S] 1385. Find the Distance Value Between Two Arrays
  • ๐Ÿคจ [Q] [S] 1387. Sort Integers by The Power Value
  • ๐Ÿ˜ซ [Q] [S] 1388. Pizza With 3n Slices
  • ๐Ÿ˜Š [Q] [S] 1389. Create Target Array in the Given Order
  • ๐Ÿคจ [Q] [S] 1390. Four Divisors
  • ๐Ÿ˜ซ [Q] [S] 1392. Longest Happy Prefix
  • ๐Ÿ˜Š [Q] [S] 1394. Find Lucky Integer in an Array
  • ๐Ÿคจ [Q] [S] 1396. Design Underground System
  • ๐Ÿ˜ซ [Q] [S] 1397. Find All Good Strings
  • ๐Ÿ˜Š [Q] [S] 1399. Count Largest Group
  • ๐Ÿคจ [Q] [S] 1400. Construct K Palindrome Strings
  • ๐Ÿคจ [Q] [S] 1401. Circle and Rectangle Overlapping
  • ๐Ÿ˜ซ [Q] [S] 1402. Reducing Dishes
  • ๐Ÿ˜Š [Q] [S] 1403. Minimum Subsequence in Non-Increasing Order
  • ๐Ÿ˜ซ [Q] [S] 1406. Stone Game III
  • ๐Ÿ˜Š [Q] [S] 1408. String Matching in an Array
  • ๐Ÿคจ [Q] [S] 1409. Queries on a Permutation With Key
  • ๐Ÿคจ [Q] [S] 1410. HTML Entity Parser
  • ๐Ÿ˜ซ [Q] [S] 1411. Number of Ways to Paint N ร— 3 Grid
  • ๐Ÿ˜Š [Q] [S] 1413. Minimum Value to Get Positive Step by Step Sum
  • ๐Ÿคจ [Q] [S] 1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
  • ๐Ÿคจ [Q] [S] 1415. The k-th Lexicographical String of All Happy Strings of Length n
  • ๐Ÿ˜ซ [Q] [S] 1416. Restore The Array
  • ๐Ÿ˜Š [Q] [S] 1417. Reformat The String
  • ๐Ÿคจ [Q] [S] 1418. Display Table of Food Orders in a Restaurant
  • ๐Ÿคจ [Q] [S] 1419. Minimum Number of Frogs Croaking
  • ๐Ÿ˜ซ [Q] [S] 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
  • ๐Ÿ˜Š [Q] [S] 1422. Maximum Score After Splitting a String
  • ๐Ÿคจ [Q] [S] 1423. Maximum Points You Can Obtain from Cards
  • ๐Ÿคจ [Q] [S] 1424. Diagonal Traverse II
  • ๐Ÿ˜ซ [Q] [S] 1425. Constrained Subsequence Sum
  • ๐Ÿ˜Š [Q] [S] 1426. Counting Elements
  • ๐Ÿ˜Š [Q] [S] 1427. Perform String Shifts
  • ๐Ÿคจ [Q] [S] 1428. Leftmost Column with at Least a One
  • ๐Ÿคจ [Q] [S] 1429. First Unique Number
  • ๐Ÿคจ [Q] [S] 1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
  • ๐Ÿคจ [Q] [S] 1433. Check If a String Can Break Another String
  • ๐Ÿ˜ซ [Q] [S] 1434. Number of Ways to Wear Different Hats to Each Other
  • ๐Ÿ˜Š [Q] [S] 1437. Check If All 1's Are at Least Length K Places Away
  • ๐Ÿคจ [Q] [S] 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
  • ๐Ÿ˜ซ [Q] [S] 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows
  • ๐Ÿ˜Š [Q] [S] 1441. Build an Array With Stack Operations
  • ๐Ÿคจ [Q] [S] 1442. Count Triplets That Can Form Two Arrays of Equal XOR
  • ๐Ÿคจ [Q] [S] 1443. Minimum Time to Collect All Apples in a Tree
  • ๐Ÿ˜ซ [Q] [S] 1444. Number of Ways of Cutting a Pizza
  • ๐Ÿคจ [Q] [S] 1447. Simplified Fractions
  • ๐Ÿคจ [Q] [S] 1448. Count Good Nodes in Binary Tree
  • ๐Ÿ˜ซ [Q] [S] 1449. Form Largest Integer With Digits That Add up to Target
  • ๐Ÿคจ [Q] [S] 1451. Rearrange Words in a Sentence
  • ๐Ÿคจ [Q] [S] 1452. People Whose List of Favorite Companies Is Not a Subset of Another List
  • ๐Ÿ˜ซ [Q] [S] 1453. Maximum Number of Darts Inside of a Circular Dartboard
  • ๐Ÿ˜Š [Q] [S] 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
  • ๐Ÿคจ [Q] [S] 1456. Maximum Number of Vowels in a Substring of Given Length
  • ๐Ÿ˜ซ [Q] [S] 1458. Max Dot Product of Two Subsequences
  • ๐Ÿ˜Š [Q] [S] 1460. Make Two Arrays Equal by Reversing Sub-arrays
  • ๐Ÿคจ [Q] [S] 1461. Check If a String Contains All Binary Codes of Size K
  • ๐Ÿคจ [Q] [S] 1462. Course Schedule IV
  • ๐Ÿ˜ซ [Q] [S] 1463. Cherry Pickup II
  • ๐Ÿคจ [Q] [S] 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
  • ๐Ÿคจ [Q] [S] 1466. Reorder Routes to Make All Paths Lead to the City Zero
  • ๐Ÿ˜ซ [Q] [S] 1467. Probability of a Two Boxes Having The Same Number of Distinct Balls
  • ๐Ÿ˜Š [Q] [S] 1469. Find All The Lonely Nodes
  • ๐Ÿ˜Š [Q] [S] 1470. Shuffle the Array
  • ๐Ÿคจ [Q] [S] 1471. The k Strongest Values in an Array
  • ๐Ÿคจ [Q] [S] 1472. Design Browser History
  • ๐Ÿ˜ซ [Q] [S] 1473. Paint House III
  • ๐Ÿ˜Š [Q] [S] 1474. Delete N Nodes After M Nodes of a Linked List
  • ๐Ÿคจ [Q] [S] 1476. Subrectangle Queries
  • ๐Ÿคจ [Q] [S] 1477. Find Two Non-overlapping Sub-arrays Each With Target Sum
  • ๐Ÿ˜ซ [Q] [S] 1478. Allocate Mailboxes
  • ๐Ÿ˜Š [Q] [S] 1480. Running Sum of 1d Array
  • ๐Ÿคจ [Q] [S] 1481. Least Number of Unique Integers after K Removals
  • ๐Ÿคจ [Q] [S] 1482. Minimum Number of Days to Make m Bouquets
  • ๐Ÿ˜ซ [Q] [S] 1483. Kth Ancestor of a Tree Node
  • ๐Ÿคจ [Q] [S] 1485. Clone Binary Tree With Random Pointer
  • ๐Ÿ˜Š [Q] [S] 1486. XOR Operation in an Array
  • ๐Ÿคจ [Q] [S] 1487. Making File Names Unique
  • ๐Ÿคจ [Q] [S] 1488. Avoid Flood in The City
  • ๐Ÿ˜ซ [Q] [S] 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
  • ๐Ÿคจ [Q] [S] 1490. Clone N-ary Tree
  • ๐Ÿ˜Š [Q] [S] 1491. Average Salary Excluding the Minimum and Maximum Salary
  • ๐Ÿคจ [Q] [S] 1492. The kth Factor of n
  • ๐Ÿคจ [Q] [S] 1493. Longest Subarray of 1's After Deleting One Element
  • ๐Ÿคจ [Q] [S] 1497. Check If Array Pairs Are Divisible by k
  • ๐Ÿคจ [Q] [S] 1498. Number of Subsequences That Satisfy the Given Sum Condition
  • ๐Ÿ˜ซ [Q] [S] 1499. Max Value of Equation
  • ๐Ÿคจ [Q] [S] 1500. Design a File Sharing System
  • ๐Ÿ˜Š [Q] [S] 1502. Can Make Arithmetic Progression From Sequence
  • ๐Ÿคจ [Q] [S] 1503. Last Moment Before All Ants Fall Out of a Plank
  • ๐Ÿคจ [Q] [S] 1504. Count Submatrices With All Ones
  • ๐Ÿ˜ซ [Q] [S] 1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits
  • ๐Ÿคจ [Q] [S] 1506. Find Root of N-Ary Tree
  • ๐Ÿ˜Š [Q] [S] 1507. Reformat Date
  • ๐Ÿคจ [Q] [S] 1508. Range Sum of Sorted Subarray Sums
  • ๐Ÿคจ [Q] [S] 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
  • ๐Ÿ˜Š [Q] [S] 1512. Number of Good Pairs
  • ๐Ÿคจ [Q] [S] 1513. Number of Substrings With Only 1s
  • ๐Ÿคจ [Q] [S] 1514. Path with Maximum Probability
  • ๐Ÿ˜ซ [Q] [S] 1515. Best Position for a Service Centre
  • ๐Ÿ˜ซ [Q] [S] 1516. Move Sub-Tree of N-Ary Tree
  • ๐Ÿ˜Š [Q] [S] 1518. Water Bottles
  • ๐Ÿคจ [Q] [S] 1519. Number of Nodes in the Sub-Tree With the Same Label
  • ๐Ÿ˜ซ [Q] [S] 1520. Maximum Number of Non-Overlapping Substrings
  • ๐Ÿ˜ซ [Q] [S] 1521. Find a Value of a Mysterious Function Closest to Target
  • ๐Ÿคจ [Q] [S] 1522. Diameter of N-Ary Tree
  • ๐Ÿ˜Š [Q] [S] 1523. Count Odd Numbers in an Interval Range
  • ๐Ÿคจ [Q] [S] 1524. Number of Sub-arrays With Odd Sum
  • ๐Ÿคจ [Q] [S] 1525. Number of Good Ways to Split a String
  • ๐Ÿ˜ซ [Q] [S] 1526. Minimum Number of Increments on Subarrays to Form a Target Array
  • ๐Ÿ˜Š [Q] [S] 1528. Shuffle String
  • ๐Ÿคจ [Q] [S] 1529. Bulb Switcher IV
  • ๐Ÿคจ [Q] [S] 1530. Number of Good Leaf Nodes Pairs
  • ๐Ÿ˜ซ [Q] [S] 1531. String Compression II
  • ๐Ÿคจ [Q] [S] 1533. Find the Index of the Large Integer
  • ๐Ÿ˜Š [Q] [S] 1534. Count Good Triplets
  • ๐Ÿคจ [Q] [S] 1535. Find the Winner of an Array Game
  • ๐Ÿคจ [Q] [S] 1536. Minimum Swaps to Arrange a Binary Grid
  • ๐Ÿ˜ซ [Q] [S] 1537. Get the Maximum Score
  • ๐Ÿคจ [Q] [S] 1538. Guess the Majority in a Hidden Array
  • ๐Ÿ˜Š [Q] [S] 1539. Kth Missing Positive Number
  • ๐Ÿคจ [Q] [S] 1540. Can Convert String in K Moves
  • ๐Ÿคจ [Q] [S] 1541. Minimum Insertions to Balance a Parentheses String
  • ๐Ÿ˜ซ [Q] [S] 1542. Find Longest Awesome Substring
  • ๐Ÿ˜Š [Q] [S] 1544. Make The String Great
  • ๐Ÿคจ [Q] [S] 1545. Find Kth Bit in Nth Binary String
  • ๐Ÿคจ [Q] [S] 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
  • ๐Ÿ˜ซ [Q] [S] 1547. Minimum Cost to Cut a Stick
  • ๐Ÿ˜ซ [Q] [S] 1548. The Most Similar Path in a Graph
  • ๐Ÿ˜Š [Q] [S] 1550. Three Consecutive Odds
  • ๐Ÿคจ [Q] [S] 1551. Minimum Operations to Make Array Equal
  • ๐Ÿคจ [Q] [S] 1552. Magnetic Force Between Two Balls
  • ๐Ÿ˜ซ [Q] [S] 1553. Minimum Number of Days to Eat N Oranges
  • ๐Ÿคจ [Q] [S] 1554. Strings Differ by One Character
  • ๐Ÿ˜Š [Q] [S] 1556. Thousand Separator
  • ๐Ÿคจ [Q] [S] 1557. Minimum Number of Vertices to Reach All Nodes
  • ๐Ÿคจ [Q] [S] 1558. Minimum Numbers of Function Calls to Make Target Array
  • ๐Ÿ˜ซ [Q] [S] 1559. Detect Cycles in 2D Grid
  • ๐Ÿ˜Š [Q] [S] 1560. Most Visited Sector in a Circular Track
  • ๐Ÿคจ [Q] [S] 1561. Maximum Number of Coins You Can Get
  • ๐Ÿคจ [Q] [S] 1562. Find Latest Group of Size M
  • ๐Ÿ˜ซ [Q] [S] 1563. Stone Game V
  • ๐Ÿคจ [Q] [S] 1564. Put Boxes Into the Warehouse I
  • ๐Ÿ˜Š [Q] [S] 1566. Detect Pattern of Length M Repeated K or More Times
  • ๐Ÿคจ [Q] [S] 1567. Maximum Length of Subarray With Positive Product
  • ๐Ÿ˜ซ [Q] [S] 1568. Minimum Number of Days to Disconnect Island
  • ๐Ÿ˜ซ [Q] [S] 1569. Number of Ways to Reorder Array to Get Same BST
  • ๐Ÿคจ [Q] [S] 1570. Dot Product of Two Sparse Vectors
  • ๐Ÿ˜Š [Q] [S] 1572. Matrix Diagonal Sum
  • ๐Ÿคจ [Q] [S] 1573. Number of Ways to Split a String
  • ๐Ÿคจ [Q] [S] 1574. Shortest Subarray to be Removed to Make Array Sorted
  • ๐Ÿ˜ซ [Q] [S] 1575. Count All Possible Routes
  • ๐Ÿ˜Š [Q] [S] 1576. Replace All ?'s to Avoid Consecutive Repeating Characters
  • ๐Ÿคจ [Q] [S] 1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers
  • ๐Ÿคจ [Q] [S] 1578. Minimum Deletion Cost to Avoid Repeating Letters
  • ๐Ÿ˜ซ [Q] [S] 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
  • ๐Ÿคจ [Q] [S] 1580. Put Boxes Into the Warehouse II
  • ๐Ÿ˜Š [Q] [S] 1582. Special Positions in a Binary Matrix
  • ๐Ÿคจ [Q] [S] 1583. Count Unhappy Friends
  • ๐Ÿคจ [Q] [S] 1584. Min Cost to Connect All Points
  • ๐Ÿ˜ซ [Q] [S] 1585. Check If String Is Transformable With Substring Sort Operations
  • ๐Ÿคจ [Q] [S] 1586. Binary Search Tree Iterator II
  • ๐Ÿ˜Š [Q] [S] 1588. Sum of All Odd Length Subarrays
  • ๐Ÿคจ [Q] [S] 1589. Maximum Sum Obtained of Any Permutation
  • ๐Ÿคจ [Q] [S] 1590. Make Sum Divisible by P
  • ๐Ÿ˜ซ [Q] [S] 1591. Strange Printer II
  • ๐Ÿ˜Š [Q] [S] 1592. Rearrange Spaces Between Words
  • ๐Ÿคจ [Q] [S] 1593. Split a String Into the Max Number of Unique Substrings
  • ๐Ÿคจ [Q] [S] 1594. Maximum Non Negative Product in a Matrix
  • ๐Ÿ˜ซ [Q] [S] 1595. Minimum Cost to Connect Two Groups of Points
  • ๐Ÿ˜ซ [Q] [S] 1597. Build Binary Expression Tree From Infix Expression
  • ๐Ÿ˜Š [Q] [S] 1598. Crawler Log Folder
  • ๐Ÿคจ [Q] [S] 1599. Maximum Profit of Operating a Centennial Wheel
  • ๐Ÿคจ [Q] [S] 1600. Throne Inheritance
  • ๐Ÿ˜ซ [Q] [S] 1601. Maximum Number of Achievable Transfer Requests
  • ๐Ÿคจ [Q] [S] 1602. Find Nearest Right Node in Binary Tree
  • ๐Ÿ˜Š [Q] [S] 1603. Design Parking System
  • ๐Ÿคจ [Q] [S] 1604. Alert Using Same Key-Card Three or More Times in a One Hour Period
  • ๐Ÿคจ [Q] [S] 1605. Find Valid Matrix Given Row and Column Sums
  • ๐Ÿ˜ซ [Q] [S] 1606. Find Servers That Handled Most Number of Requests
  • ๐Ÿ˜Š [Q] [S] 1608. Special Array With X Elements Greater Than or Equal X
  • ๐Ÿคจ [Q] [S] 1609. Even Odd Tree
  • ๐Ÿ˜ซ [Q] [S] 1610. Maximum Number of Visible Points
  • ๐Ÿ˜ซ [Q] [S] 1611. Minimum One Bit Operations to Make Integers Zero
  • ๐Ÿคจ [Q] [S] 1612. Check If Two Expression Trees are Equivalent
  • ๐Ÿ˜Š [Q] [S] 1614. Maximum Nesting Depth of the Parentheses
  • ๐Ÿคจ [Q] [S] 1615. Maximal Network Rank
  • ๐Ÿคจ [Q] [S] 1616. Split Two Strings to Make Palindrome
  • ๐Ÿ˜ซ [Q] [S] 1617. Count Subtrees With Max Distance Between Cities
  • ๐Ÿคจ [Q] [S] 1618. Maximum Font to Fit a Sentence in a Screen
  • ๐Ÿ˜Š [Q] [S] 1619. Mean of Array After Removing Some Elements
  • ๐Ÿคจ [Q] [S] 1620. Coordinate With Maximum Network Quality
  • ๐Ÿคจ [Q] [S] 1621. Number of Sets of K Non-Overlapping Line Segments
  • ๐Ÿ˜ซ [Q] [S] 1622. Fancy Sequence
  • ๐Ÿ˜Š [Q] [S] 1624. Largest Substring Between Two Equal Characters
  • ๐Ÿคจ [Q] [S] 1625. Lexicographically Smallest String After Applying Operations
  • ๐Ÿคจ [Q] [S] 1626. Best Team With No Conflicts
  • ๐Ÿ˜ซ [Q] [S] 1627. Graph Connectivity With Threshold
  • ๐Ÿคจ [Q] [S] 1628. Design an Expression Tree With Evaluate Function
  • ๐Ÿ˜Š [Q] [S] 1629. Slowest Key
  • ๐Ÿคจ [Q] [S] 1630. Arithmetic Subarrays
  • ๐Ÿคจ [Q] [S] 1631. Path With Minimum Effort
  • ๐Ÿ˜ซ [Q] [S] 1632. Rank Transform of a Matrix
  • ๐Ÿคจ [Q] [S] 1634. Add Two Polynomials Represented as Linked Lists
  • ๐Ÿ˜Š [Q] [S] 1636. Sort Array by Increasing Frequency
  • ๐Ÿคจ [Q] [S] 1637. Widest Vertical Area Between Two Points Containing No Points
  • ๐Ÿคจ [Q] [S] 1638. Count Substrings That Differ by One Character
  • ๐Ÿ˜ซ [Q] [S] 1639. Number of Ways to Form a Target String Given a Dictionary
  • ๐Ÿ˜Š [Q] [S] 1640. Check Array Formation Through Concatenation
  • ๐Ÿคจ [Q] [S] 1641. Count Sorted Vowel Strings
  • ๐Ÿคจ [Q] [S] 1642. Furthest Building You Can Reach
  • ๐Ÿ˜ซ [Q] [S] 1643. Kth Smallest Instructions
  • ๐Ÿคจ [Q] [S] 1644. Lowest Common Ancestor of a Binary Tree II
  • ๐Ÿ˜Š [Q] [S] 1646. Get Maximum in Generated Array
  • ๐Ÿคจ [Q] [S] 1647. Minimum Deletions to Make Character Frequencies Unique
  • ๐Ÿคจ [Q] [S] 1648. Sell Diminishing-Valued Colored Balls
  • ๐Ÿ˜ซ [Q] [S] 1649. Create Sorted Array through Instructions
  • ๐Ÿคจ [Q] [S] 1650. Lowest Common Ancestor of a Binary Tree III
  • ๐Ÿ˜Š [Q] [S] 1652. Defuse the Bomb
  • ๐Ÿคจ [Q] [S] 1653. Minimum Deletions to Make String Balanced
  • ๐Ÿคจ [Q] [S] 1654. Minimum Jumps to Reach Home
  • ๐Ÿ˜ซ [Q] [S] 1655. Distribute Repeating Integers
  • ๐Ÿ˜Š [Q] [S] 1656. Design an Ordered Stream
  • ๐Ÿคจ [Q] [S] 1657. Determine if Two Strings Are Close
  • ๐Ÿคจ [Q] [S] 1658. Minimum Operations to Reduce X to Zero
  • ๐Ÿ˜ซ [Q] [S] 1659. Maximize Grid Happiness
  • ๐Ÿคจ [Q] [S] 1660. Correct a Binary Tree
  • ๐Ÿ˜Š [Q] [S] 1662. Check If Two String Arrays are Equivalent
  • ๐Ÿคจ [Q] [S] 1663. Smallest String With A Given Numeric Value
  • ๐Ÿคจ [Q] [S] 1664. Ways to Make a Fair Array
  • ๐Ÿ˜ซ [Q] [S] 1665. Minimum Initial Energy to Finish Tasks
  • ๐Ÿคจ [Q] [S] 1666. Change the Root of a Binary Tree
  • ๐Ÿ˜Š [Q] [S] 1668. Maximum Repeating Substring
  • ๐Ÿคจ [Q] [S] 1669. Merge In Between Linked Lists
  • ๐Ÿคจ [Q] [S] 1670. Design Front Middle Back Queue
  • ๐Ÿ˜ซ [Q] [S] 1671. Minimum Number of Removals to Make Mountain Array
  • ๐Ÿ˜Š [Q] [S] 1672. Richest Customer Wealth
  • ๐Ÿคจ [Q] [S] 1673. Find the Most Competitive Subsequence
  • ๐Ÿคจ [Q] [S] 1674. Minimum Moves to Make Array Complementary
  • ๐Ÿ˜ซ [Q] [S] 1675. Minimize Deviation in Array
  • ๐Ÿคจ [Q] [S] 1676. Lowest Common Ancestor of a Binary Tree IV
  • ๐Ÿ˜Š [Q] [S] 1678. Goal Parser Interpretation
  • ๐Ÿคจ [Q] [S] 1679. Max Number of K-Sum Pairs
  • ๐Ÿคจ [Q] [S] 1680. Concatenation of Consecutive Binary Numbers
  • ๐Ÿ˜ซ [Q] [S] 1681. Minimum Incompatibility
  • ๐Ÿคจ [Q] [S] 1682. Longest Palindromic Subsequence II
  • ๐Ÿ˜Š [Q] [S] 1684. Count the Number of Consistent Strings
  • ๐Ÿคจ [Q] [S] 1685. Sum of Absolute Differences in a Sorted Array
  • ๐Ÿคจ [Q] [S] 1686. Stone Game VI
  • ๐Ÿ˜ซ [Q] [S] 1687. Delivering Boxes from Storage to Ports
  • ๐Ÿ˜Š [Q] [S] 1688. Count of Matches in Tournament
  • ๐Ÿคจ [Q] [S] 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
  • ๐Ÿคจ [Q] [S] 1690. Stone Game VII
  • ๐Ÿ˜ซ [Q] [S] 1691. Maximum Height by Stacking Cuboids
  • ๐Ÿ˜ซ [Q] [S] 1692. Count Ways to Distribute Candies
  • ๐Ÿ˜Š [Q] [S] 1694. Reformat Phone Number
  • ๐Ÿคจ [Q] [S] 1695. Maximum Erasure Value
  • ๐Ÿคจ [Q] [S] 1696. Jump Game VI
  • ๐Ÿ˜ซ [Q] [S] 1697. Checking Existence of Edge Length Limited Paths
  • ๐Ÿคจ [Q] [S] 1698. Number of Distinct Substrings in a String
  • ๐Ÿ˜Š [Q] [S] 1700. Number of Students Unable to Eat Lunch
  • ๐Ÿคจ [Q] [S] 1701. Average Waiting Time
  • ๐Ÿคจ [Q] [S] 1702. Maximum Binary String After Change
  • ๐Ÿ˜ซ [Q] [S] 1703. Minimum Adjacent Swaps for K Consecutive Ones
  • ๐Ÿ˜Š [Q] [S] 1704. Determine if String Halves Are Alike
  • ๐Ÿคจ [Q] [S] 1705. Maximum Number of Eaten Apples
  • ๐Ÿคจ [Q] [S] 1706. Where Will the Ball Fall
  • ๐Ÿ˜ซ [Q] [S] 1707. Maximum XOR With an Element From Array
  • ๐Ÿ˜Š [Q] [S] 1708. Largest Subarray Length K
  • ๐Ÿ˜Š [Q] [S] 1710. Maximum Units on a Truck
  • ๐Ÿคจ [Q] [S] 1711. Count Good Meals
  • ๐Ÿคจ [Q] [S] 1712. Ways to Split Array Into Three Subarrays
  • ๐Ÿ˜ซ [Q] [S] 1713. Minimum Operations to Make a Subsequence
  • ๐Ÿ˜ซ [Q] [S] 1714. Sum Of Special Evenly-Spaced Elements In Array
  • ๐Ÿ˜Š [Q] [S] 1716. Calculate Money in Leetcode Bank
  • ๐Ÿคจ [Q] [S] 1717. Maximum Score From Removing Substrings
  • ๐Ÿคจ [Q] [S] 1718. Construct the Lexicographically Largest Valid Sequence
  • ๐Ÿ˜ซ [Q] [S] 1719. Number Of Ways To Reconstruct A Tree
  • ๐Ÿ˜Š [Q] [S] 1720. Decode XORed Array
  • ๐Ÿคจ [Q] [S] 1721. Swapping Nodes in a Linked List
  • ๐Ÿคจ [Q] [S] 1722. Minimize Hamming Distance After Swap Operations
  • ๐Ÿ˜ซ [Q] [S] 1723. Find Minimum Time to Finish All Jobs
  • ๐Ÿ˜ซ [Q] [S] 1724. Checking Existence of Edge Length Limited Paths II
  • ๐Ÿ˜Š [Q] [S] 1725. Number Of Rectangles That Can Form The Largest Square
  • ๐Ÿคจ [Q] [S] 1726. Tuple with Same Product
  • ๐Ÿคจ [Q] [S] 1727. Largest Submatrix With Rearrangements
  • ๐Ÿ˜ซ [Q] [S] 1728. Cat and Mouse II
  • ๐Ÿคจ [Q] [S] 1730. Shortest Path to Get Food
  • ๐Ÿ˜Š [Q] [S] 1732. Find the Highest Altitude
  • ๐Ÿคจ [Q] [S] 1733. Minimum Number of People to Teach
  • ๐Ÿคจ [Q] [S] 1734. Decode XORed Permutation
  • ๐Ÿ˜ซ [Q] [S] 1735. Count Ways to Make Array With Product
  • ๐Ÿ˜Š [Q] [S] 1736. Latest Time by Replacing Hidden Digits
  • ๐Ÿคจ [Q] [S] 1737. Change Minimum Characters to Satisfy One of Three Conditions
  • ๐Ÿคจ [Q] [S] 1738. Find Kth Largest XOR Coordinate Value
  • ๐Ÿ˜ซ [Q] [S] 1739. Building Boxes
  • ๐Ÿคจ [Q] [S] 1740. Find Distance in a Binary Tree
  • ๐Ÿ˜Š [Q] [S] 1742. Maximum Number of Balls in a Box
  • ๐Ÿคจ [Q] [S] 1743. Restore the Array From Adjacent Pairs
  • ๐Ÿคจ [Q] [S] 1744. Can You Eat Your Favorite Candy on Your Favorite Day?
  • ๐Ÿ˜ซ [Q] [S] 1745. Palindrome Partitioning IV
  • ๐Ÿคจ [Q] [S] 1746. Maximum Subarray Sum After One Operation
  • ๐Ÿ˜Š [Q] [S] 1748. Sum of Unique Elements
  • ๐Ÿคจ [Q] [S] 1749. Maximum Absolute Sum of Any Subarray
  • ๐Ÿคจ [Q] [S] 1750. Minimum Length of String After Deleting Similar Ends
  • ๐Ÿ˜ซ [Q] [S] 1751. Maximum Number of Events That Can Be Attended II
  • ๐Ÿ˜Š [Q] [S] 1752. Check if Array Is Sorted and Rotated
  • ๐Ÿคจ [Q] [S] 1753. Maximum Score From Removing Stones
  • ๐Ÿคจ [Q] [S] 1754. Largest Merge Of Two Strings
  • ๐Ÿ˜ซ [Q] [S] 1755. Closest Subsequence Sum
  • ๐Ÿคจ [Q] [S] 1756. Design Most Recently Used Queue
  • ๐Ÿ˜Š [Q] [S] 1758. Minimum Changes To Make Alternating Binary String
  • ๐Ÿคจ [Q] [S] 1759. Count Number of Homogenous Substrings
  • ๐Ÿคจ [Q] [S] 1760. Minimum Limit of Balls in a Bag
  • ๐Ÿ˜ซ [Q] [S] 1761. Minimum Degree of a Connected Trio in a Graph
  • ๐Ÿคจ [Q] [S] 1762. Buildings With an Ocean View
  • ๐Ÿ˜Š [Q] [S] 1763. Longest Nice Substring
  • ๐Ÿคจ [Q] [S] 1764. Form Array by Concatenating Subarrays of Another Array
  • ๐Ÿคจ [Q] [S] 1765. Map of Highest Peak
  • ๐Ÿ˜ซ [Q] [S] 1766. Tree of Coprimes
  • ๐Ÿ˜Š [Q] [S] 1768. Merge Strings Alternately
  • ๐Ÿคจ [Q] [S] 1769. Minimum Number of Operations to Move All Balls to Each Box
  • ๐Ÿคจ [Q] [S] 1770. Maximum Score from Performing Multiplication Operations
  • ๐Ÿ˜ซ [Q] [S] 1771. Maximize Palindrome Length From Subsequences
  • ๐Ÿคจ [Q] [S] 1772. Sort Features by Popularity
  • ๐Ÿ˜Š [Q] [S] 1773. Count Items Matching a Rule
  • ๐Ÿคจ [Q] [S] 1774. Closest Dessert Cost
  • ๐Ÿคจ [Q] [S] 1775. Equal Sum Arrays With Minimum Number of Operations
  • ๐Ÿ˜ซ [Q] [S] 1776. Car Fleet II
  • ๐Ÿคจ [Q] [S] 1778. Shortest Path in a Hidden Grid
  • ๐Ÿ˜Š [Q] [S] 1779. Find Nearest Point That Has the Same X or Y Coordinate
  • ๐Ÿคจ [Q] [S] 1780. Check if Number is a Sum of Powers of Three
  • ๐Ÿคจ [Q] [S] 1781. Sum of Beauty of All Substrings
  • ๐Ÿ˜ซ [Q] [S] 1782. Count Pairs Of Nodes
  • ๐Ÿ˜Š [Q] [S] 1784. Check if Binary String Has at Most One Segment of Ones
  • ๐Ÿคจ [Q] [S] 1785. Minimum Elements to Add to Form a Given Sum
  • ๐Ÿคจ [Q] [S] 1786. Number of Restricted Paths From First to Last Node
  • ๐Ÿ˜ซ [Q] [S] 1787. Make the XOR of All Segments Equal to Zero

How am I generated?

Based on SwiftSyntax, the renderer walks through the directories and analyzes the syntax of each solution to fetch its metadata.

For example, it can collect the tag info if the following statement appears in the solution:

let tags: [Tag] = [.marked, .dp, .graph]

For more details, check here!