/Leetcode

Leetcode exercises

Primary LanguagePython

Leetcode

  • Leetcode exercises for SQL and algorithm problems.

SQL

Num Title Level
175 Combine Two Tables Easy
176 Second Highest Salary Easy
177 Nth Highest Salary Medium
178 Rank Scores Medium
180 Consecutive Numbers Medium
181 Employees Earning More Than Their Managers Easy
182 Duplicate Emails Easy
183 Customers Who Never Order Easy
184 Department Highest Salary Medium
185 Department Top Three Salaries Hard
196 Delete Duplicate Emails Easy
197 Rising Temperature Easy
262 Trips and Users Hard
511 Game Play Analysis I Easy
512 Game Play Analysis II Easy
534 Game Play Analysis III Medium
550 Game Play Analysis IV Medium
569 Median Employee Salary Hard
570 Managers with at Least 5 Direct Reports Medium
571 Find Median Given Frequency of Numbers Hard
574 Winning Candidate Medium
577 Employee Bonus Easy
578 Get Highest Answer Rate Question Medium
579 Find Cumulative Salary of an Employee Hard
580 Count Student Number in Departments Medium
584 Find Customer Referee Easy
585 Investments in 2016 Medium
586 Customer Placing the Largest Number of Orders Easy
595 Big Countries Easy
596 Classes More Than 5 Students Easy
597 Friend Requests I: Overall Acceptance Rate Easy
601 Human Traffic of Stadium Hard
602 Friend Requests II: Who Has the Most Friends Medium
603 Consecutive Available Seats Easy
607 Sales Person Easy
608 Tree Node Medium
610 Triangle Judgement Easy
612 Shortest Distance in a Plane Medium
613 Shortest Distance in a Line Easy
614 Second Degree Follower Medium
615 Average Salary: Departments VS Company Hard
618 Students Report By Geography Hard
619 Biggest Single Number Easy
620 Not Boring Movies Easy
626 Exchange Seats Medium
627 Swap Salary Easy
1045 Customers Who Bought All Products Medium
1050 Actors and Directors Who Cooperated At Least Three Times Easy
1068 Product Sales Analysis I Easy
1069 Product Sales Analysis II Easy

Algorithm

  • The algorithm problems contain Leetcode and lintcode problems.
  • The level is the Leetcode level.
  • 必看！九章算法 GitHub

九章 python

  • 範例 (23 題)
Chapter Lintcode Level Leetcode Level
1 9. Fizz Buzz Easy 412. Fizz Buzz Easy
1 37. Reverse 3-digit Integer Naive
2 239. Root of Equation (locked) Easy
3 241. String To Integer (locked) Naive 8. String to Integer (atoi) Medium
3 8. Rotate Character Array Easy 796. Rotate String Easy
3 172. Remove Element Easy 27. Remove Element Easy
3 35. Reverse Linked List Easy 206. Reverse Linked List Easy
3 174. Remove Nth Node From End of List Easy 19. Remove Nth Node From End of List Medium
4 495. Implement Stack Easy 225. Implement Stack using Queues Easy
4 423. Valid Parentheses Easy 20. Valid Parentheses Easy
4 492. Implement Queue by Linked List Easy 232. Implement Queue using Stacks Easy
5 366. Fibonacci Naive 509. Fibonacci Number Easy
5 481. Binary Tree Leaf Sum (locked) Easy
5 97. Maximum Depth of Binary Tree Easy 104. Maximum Depth of Binary Tree Easy
5 Identical Binary Tree
5 66. Binary Tree Preorder Traversal Easy 144. Binary Tree Preorder Traversal Easy
5 67. Binary Tree Inorder Traversal Easy 94. Binary Tree Inorder Traversal Easy
5 68. Binary Tree Postorder Traversal Easy 145. Binary Tree Postorder Traversal Easy
6 6. Merge Two Sorted Arrays Easy 88. Merge Sorted Array Easy
6 464. Sort Integers II Easy
6 Merge Sort
6 31. Partition Array Medium 561. Array Partition I Easy
6 Quick Sort
  • 作業 (42 題)
Chapter LintCode Level Leetcode Level
1 479. Second Max of Array Easy
1 478. Simple Calculator (locked) Naive
1 283. Max of 3 Numbers Naive
1 145. Lowercase to Uppercase Naive
1 37. Reverse 3-digit Integer Naive 7. Reverse Integer Medium
1 9. Fizz Buzz Easy 412. Fizz Buzz Easy
2 454. Rectangle Area Naive 223. Rectangle Area Medium
2 222. Setter and Getter (locked) Naive
2 455. Student ID (locked) Easy
2 218. Student Level (locked) Easy
2 497. Shape Factory Easy
3 483. Convert Linked List to Array List (locked) Naive
3 225. Find Node in Linked List (locked) Naive
3 219. Insert Node in Sorted Linked List (locked) Easy
3 452. Remove Linked List Elements Easy 203. Remove Linked List Elements Easy
3 241. String To Integer (locked) Naive 8. String to Integer (atoi) Medium
3 415. Valid Palindrome Medium 125. Valid Palindrome Easy
3 174. Remove Nth Node From End of List Easy 19. Remove Nth Node From End of List Medium
3 165. Merge Two Sorted Lists Easy 21. Merge Two Sorted Lists Easy
4 495. Implement Stack Easy 225. Implement Stack using Queues Easy
4 494. Implement Stack by Two Queues (locked) Easy 225. Implement Stack using Queues Easy
4 423. Valid Parentheses Easy 20. Valid Parentheses Easy
4 40. Implement Queue by Two Stacks Medium 232. Implement Queue using Stacks Easy
5 647. Find All Anagrams in a String (locked) Medium 438. Find All Anagrams in a String Medium
5 644. Strobogrammatic Number Easy 246. Strobogrammatic Number (locked) Easy
5 557. Count Characters (locked) Easy
5 457. Classical Binary Search Easy 704. Binary Search Easy
5 487. Name Deduplication (locked) Easy
6 481. Binary Tree Leaf Sum (locked) Easy
6 480. Binary Tree Paths Easy 257. Binary Tree Paths Easy
6 97. Maximum Depth of Binary Tree Easy 104. Maximum Depth of Binary Tree Easy
6 376. Binary Tree Path Sum (locked) Easy 124. Binary Tree Maximum Path Sum Hard
6 482. Binary Tree Level Sum (locked) Easy 1161. Maximum Level Sum of a Binary Tree Medium
7 463. Sort Integers Naive
7 464. Sort Integers II Easy
7 173. Insertion Sort List Easy 147. Insertion Sort List Medium
7 184. Largest Number Medium 179. Largest Number Medium
7 148. Sort Colors Medium 75. Sort Colors Medium
7 143. Sort Colors II Medium
7 139. Subarray Sum Closest (locked) Medium
7 98. Sort List Medium 148. Sort List Medium
7 5. Kth Largest Element Medium 215. Kth Largest Element in an Array Medium

九章算法

  • ch1.

  • ch2. Binary Search

  • ch3. Binary Tree & Divide Conquer

  • ch4. BFS

  • ch5. DFS

  • ch6. Linked List

  • ch7. Two Pointers

  • ch8. Hash & Heap

  • ch9. Dynamic Programming

  • 範例 (151 題)

Chapter Lintcode Level Leetcode Level
1 13. Implement strStr() Naive 28. Implement strStr() Easy
1 17. Subsets Medium 78. Subsets Medium
1 18. Subsets II Medium 90. Subsets II Medium
2 Binary search
2 457. Classical Binary Search Easy 704. Binary Search Easy
2 14. First Position of Target Easy 34. Find First and Last Position of Element in Sorted Array Medium
2 458. Last Position of Target Easy 34. Find First and Last Position of Element in Sorted Array Medium
2 74. First Bad Version Medium 278. First Bad Version Easy
2 447. Search in a Big Sorted Array Medium
2 159. Find Minimum in Rotated Sorted Array Medium 153. Find Minimum in Rotated Sorted Array Medium
2 28. Search a 2D Matrix Easy 74. Search a 2D Matrix Medium
2 38. Search a 2D Matrix II Medium 240. Search a 2D Matrix II Medium
2 61. Search for a Range Medium
2 462. Total Occurrence of Target Easy
2 585. Maximum Number in Mountain Sequence Medium
2 600. Smallest Rectangle Enclosing Black Pixels Hard 302. Smallest Rectangle Enclosing Black Pixels (locked) Hard
2 75. Find Peak Element Medium 162. Find Peak Element Medium
2 62. Search in Rotated Sorted Array Medium 33. Search in Rotated Sorted Array Medium
2 39. Recover Rotated Sorted Array Easy
2 1790. Rotate String II Easy 796. Rotate String Easy
3 66. Binary Tree Preorder Traversal Easy 144. Binary Tree Preorder Traversal Easy
3 67. Binary Tree Inorder Traversal Easy 94. Binary Tree Inorder Traversal Easy
3 68. Binary Tree Postorder Traversal Easy 145. Binary Tree Postorder Traversal Easy
3 97. Maximum Depth of Binary Tree Easy 104. Maximum Depth of Binary Tree Easy
3 480. Binary Tree Paths Easy 257. Binary Tree Paths Easy
3 596. Minimum Subtree Easy
3 93. Balanced Binary Tree Easy 110. Balanced Binary Tree Easy
3 597. Subtree with Maximum Average Easy 1120. Maximum Average Subtree (locked) Medium
3 453. Flatten Binary Tree to Linked List Easy 114. Flatten Binary Tree to Linked List Medium
3 88. Lowest Common Ancestor of a Binary Tree Medium 236. Lowest Common Ancestor of a Binary Tree Medium
3 595. Binary Tree Longest Consecutive Sequence Easy 298. Binary Tree Longest Consecutive Sequence (locked) Medium
3 376. Binary Tree Path Sum Easy
3 246. Binary Tree Path Sum II Medium
3 472. Binary Tree Path Sum III Hard
3 95. Validate Binary Search Tree Medium 98. Validate Binary Search Tree Medium
3 1534. Convert Binary Search Tree to Sorted Doubly Linked List Medium 426. Convert Binary Search Tree to Sorted Doubly Linked List (locked) Medium
3 86. Binary Search Tree Iterator Hard 173. Binary Search Tree Iterator Medium
3 448. Inorder Successor in BST Medium 285. Inorder Successor in BST (locked) Medium
3 11. Search Range in Binary Search Tree Medium 700. Search in a Binary Search Tree Easy
3 85. Insert Node in a Binary Search Tree Easy 701. Insert into a Binary Search Tree Medium
3 87. Remove Node in Binary Search Tree Hard
4 69. Binary Tree Level Order Traversal Easy 102. Binary Tree Level Order Traversal Medium
4 7. Serialize and Deserialize Binary Tree Medium 297. Serialize and Deserialize Binary Tree Hard
4 70. Binary Tree Level Order Traversal II Medium 107. Binary Tree Level Order Traversal II Medium
4 71. Binary Tree Zigzag Level Order Traversal Medium 103. Binary Tree Zigzag Level Order Traversal Medium
4 242. Convert Binary Tree to Linked Lists by Depth Easy
4 178. Graph Valid Tree Medium 261. Graph Valid Tree (locked) Medium
4 137. Clone Graph Medium 133. Clone Graph Medium
4 618. Search Graph Nodes Medium
4 127. Topological Sorting Medium
4 615. Course Schedule Medium 207. Course Schedule Medium
4 616. Course Schedule II Medium 210. Course Schedule II Medium
4 605. Sequence Reconstruction Medium 444. Sequence Reconstruction (locked) Medium
4 433. Number of Islands Easy 200. Number of Islands Medium
4 598. Zombie in Matrix Medium
4 611. Knight Shortest Path Medium
4 573. Build Post Office II Hard
4 431. Connected Component in Undirected Graph Medium
4 600. Smallest Rectangle Enclosing Black Pixels Hard 302. Smallest Rectangle Enclosing Black Pixels (locked) Hard
4 120. Word Ladder Hard 127. Word Ladder Hard
5 135. Combination Sum Medium 39. Combination Sum Medium
5 153. Combination Sum II Medium 40. Combination Sum II Medium
5 136. Palindrome Partitioning Medium 131. Palindrome Partitioning Medium
5 15. Permutations Medium 46. Permutations Medium
5 16. Permutations II Medium 47. Permutations II Medium
5 33. N-Queens Medium 51. N-Queens Hard
5 120. Word Ladder Hard 127. Word Ladder Hard
5 121. Word Ladder II Hard 126. Word Ladder II Hard
5 66. Binary Tree Preorder Traversal Easy 144. Binary Tree Preorder Traversal Easy
5 67. Binary Tree Inorder Traversal Easy 94. Binary Tree Inorder Traversal Easy
5 68. Binary Tree Postorder Traversal Easy 145. Binary Tree Postorder Traversal Easy
5 86. Binary Search Tree Iterator Hard 173. Binary Search Tree Iterator Medium
5 17. Subsets Medium 78. Subsets Medium
6 450. Reverse Nodes in k-Group Hard 25. Reverse Nodes in k-Group Hard
6 96. Partition List Easy 86. Partition List Medium
6 165. Merge Two Sorted Lists Easy 21. Merge Two Sorted Lists Easy
6 36. Reverse Linked List II Medium 92. Reverse Linked List II Medium
6 511. Swap Two Nodes in Linked List Medium
6 99. Reorder List Medium 143. Reorder List Medium
6 170. Rotate List Medium 61. Rotate List Medium
6 105. Copy List with Random Pointer Medium 138. Copy List with Random Pointer Medium
6 102. Linked List Cycle Medium 141. Linked List Cycle Easy
6 103. Linked List Cycle II (locked) Medium 142. Linked List Cycle II Medium
6 380. Intersection of Two Linked Lists Medium 160. Intersection of Two Linked Lists Easy
6 98. Sort List Medium 148. Sort List Medium
6 106. Convert Sorted List to Binary Search Tree Medium 109. Convert Sorted List to Binary Search Tree Medium
6 Delete Node in the Middle of Singly Linked List 2095. Delete the Middle Node of a Linked List Medium
6 1534. Convert Binary Search Tree to Sorted Doubly Linked List Medium 426. Convert Binary Search Tree to Sorted Doubly Linked List (locked) Medium
6 6. Merge Two Sorted Arrays Easy
6 64. Merge Sorted Array Easy 88. Merge Sorted Array Easy
6 547. Intersection of Two Arrays Easy 349. Intersection of Two Arrays Easy
6 65. Median of two Sorted Arrays Hard 4. Median of Two Sorted Arrays Hard
6 41. Maximum Subarray Easy 53. Maximum Subarray Medium
6 138. Subarray Sum Easy
6 139. Subarray Sum Closest (locked) Medium
7 604. Window Sum (locked) Easy
7 539. Move Zeroes Easy 283. Move Zeroes Easy
7 521. Remove Duplicate Numbers in Array (locked) Easy
7 415. Valid Palindrome Medium 125. Valid Palindrome Easy
7 Rotat String 796. Rotate String Easy
7 39. Recover Rotated Sorted Array Easy
7 56. Two Sum Easy 1. Two Sum Easy
7 607. Two Sum III - Data structure design Easy 170. Two Sum III - Data structure design (locked) Easy
7 608. Two Sum II - input array is sorted (locked) Medium 167. Two Sum II - Input Array Is Sorted Medium
7 587. Two Sum - Unique pairs (locked) Medium
7 57. 3Sum Medium 15. 3Sum Medium
7 382. Triangle Count (locked) Medium
7 609. Two Sum - less than or equal to target (locked) Medium 1099. Two Sum Less Than K (locked) Easy
7 443. Two Sum - Greater than target (locked) Medium
7 533. Two Sum - Closest to target (locked) Medium
7 59. 3Sum Closest Medium 16. 3Sum Closest Medium
7 58. 4Sum Medium 18. 4Sum Medium
7 610. Two Sum - Difference equals to target (locked) Medium
7 31. Partition Array Medium 561. Array Partition Easy
7 461. Kth Smallest Numbers in Unsorted Array (locked) Medium
7 5. Kth Largest Element Medium 215. Kth Largest Element in an Array Medium
7 373. Partition Array by Odd and Even (locked) Easy
7 144. Interleaving Positive and Negative Numbers Medium
7 49. Sort Letters by Case Medium
7 148. Sort Colors Medium 75. Sort Colors Medium
7 143. Sort Colors II Medium
8 129. Rehashing (locked) Medium
8 134. LRU Cache Hard 146. LRU Cache Medium
8 138. Subarray Sum Easy
8 105. Copy List with Random Pointer Medium 138. Copy List with Random Pointer Medium
8 171. Anagrams Medium
8 124. Longest Consecutive Sequence Medium 128. Longest Consecutive Sequence Medium
8 4. Ugly Number II Medium 264. Ugly Number II Medium
8 545. Top k Largest Number II (locked) Medium
8 104. Merge K Sorted Lists Medimu 23. Merge k Sorted Lists Hard
8 613. High Five (locked) Medium 1086. High Five (locked) Easy
8 612. K Closest Points (locked) Medium 973. K Closest Points to Origin Medium
8 486. Merge K Sorted Arrays (locked) Medium
8 Data Stream Median
8 544. Top K Largest Numbers (locked) Medium
8 401. Kth Smallest Number in Sorted Matrix Medium 378. Kth Smallest Number in Sorted Matrix Medium
8 Building Outline
8 471. Top K Frequent Words Medium 692. Top K Frequent Words Medium
9 109. Triangle Medium 120. Triangle Medium
9 136. Palindrome Partitioning Medium 131. Palindrome Partitioning Medium
9 124. Longest Consecutive Sequence Medium 128. Longest Consecutive Sequence Medium
9 110. Minimum Path Sum Medium 64. Minimum Path Sum Medium
9 114. Unique Paths Easy 62. Unique Paths Medium
9 111. Climbing Stairs Easy 70. Climbing Stairs Easy
9 116. Jump Game Medium 55. Jump Game Medium
9 117. Jump Game II Medium 45. Jump Game II Medium
9 76. Longest Increasing Subsequence Medium 300. Longest Increasing Subsequence Medium
9 513. Perfect Squares Medium 279. Perfect Squares Medium
9 603. Largest Divisible Subset Medium 368. Largest Divisible Subset Medium
9 602. Russian Doll Envelopes Hard 354. Russian Doll Envelopes Hard
9 622. Frog Jump Hard 403. Frog Jump Hard
  • 作業 (75 題)
Chapter Lintcode level Leetcode Level
1 13. Implement strStr() Naive 28. Implement strStr() Easy
1 15. Permutations Medium 46. Permutations Medium
1 16. Permutations II Medium 47. Permutations II Medium
2 459. Closest Number in Sorted Array (locked) Easy
2 458. Last Position of Target Easy 34. Find First and Last Position of Element in Sorted Array Medium
2 28. Search a 2D Matrix Easy 74. Search a 2D Matrix Medium
2 585. Maximum Number in Mountain Sequence Medium
2 447. Search in a Big Sorted Array Medium
2 159. Find Minimum in Rotated Sorted Array Medium 153. Find Minimum in Rotated Sorted Array Medium
2 75. Find Peak Element Medium 162. Find Peak Element Medium
2 74. First Bad Version Medium 278. First Bad Version Easy
2 62. Search in Rotated Sorted Array Medium 33. Search in Rotated Sorted Array Medium
2 600. Smallest Rectangle Enclosing Black Pixels Hard 302. Smallest Rectangle Enclosing Black Pixels (locked) Hard
2 462. Total Occurrence of Target Easy
2 254. Drop Eggs Easy
2 14. First Position of Target Easy 34. Find First and Last Position of Element in Sorted Array Medium
2 460. Find K Closest Elements Medium 658. Find K Closest Elements Medium
2 414. Divide Two Integers Medium 29. Divide Two Integers Medium
2 38. Search a 2D Matrix II Medium 240. Search a 2D Matrix II Medium
2 61. Search for a Range Medium
2 617. Maximum Average Subarray II Medium 644. Maximum Average Subarray II (locked) Hard
2 141. Sqrt(x) Easy 69. Sqrt(x) Easy
2 457. Classical Binary Search Easy 704. Binary Search Easy
2 586. Sqrt(x) II Medium
2 160. Find Minimum in Rotated Sorted Array II Medium 154. Find Minimum in Rotated Sorted Array II Hard
2 63. Search in Rotated Sorted Array II Medium 81. Search in Rotated Sorted Array II Medium
2 437. Copy Books Medium
2 183. Wood Cut Hard
3 597. Subtree with Maximum Average
3 596. Minimum Subtree
3 595. Binary Tree Longest Consecutive Sequence
3 376. Binary Tree Path Sum (locked)
3 480. Binary Tree Paths
3 453. Flatten Binary Tree to Linked List
3 97. Maximum Depth of Binary Tree
3 93. Balanced Binary Tree
3 578. Lowest Common Ancestor III
3 95. Validate Binary Search Tree
4 433. Number of Islands
4 69. Binary Tree Level Order Traversal
4 618. Search Graph Nodes
4 598. Zombie in Matrix
4 178. Graph Valid Tree
4 137. Clone Graph
4 7. Serialize and Deserialize Binary Tree
4 573. Build Post Office II
4 616. Course Schedule II
4 611. Knight Shortest Path
5 136. Palindrome Partitioning
5 18. Subsets II
5 16. Permutations II
5 15. Permutations
5 121. Word Ladder II
5 153. Combination Sum II
5 135. Combination Sum
6 599. Insert into a Cyclic Sorted List
6 165. Merge Two Sorted Lists
6 138. Subarray Sum
6 41. Maximum Subarray
6 139. Subarray Sum Closest (locked)
6 105. Copy List with Random Pointer
6 102. Linked List Cycle
6 98. Sort List
6 450. Reverse Nodes in k-Group
6 65. Median of two Sorted Arrays
7 607. Two Sum III - Data structure design
7 521. Remove Duplicate Numbers in Array (locked)
7 609. Two Sum - less than or equal to target (locked)
7 608. Two Sum II - input array is sorted (locked)
7 587. Two Sum - Unique pairs (locked)
7 533. Two Sum - Closest to target (locked)
7 148. Sort Colors
7 143. Sort Colors II
7 57. 3Sum
7 31. Partition Array
8 沒有資料
9 沒有資料

九章動態規劃

  • 範例 (47 題)
Chapter Lintcode Level Leetcode Level
1 669. Coin Change Medium 322. Coin Change Medium
1 114. Unique Paths Easy 62. Unique Paths Medium
1 116. Jump Game Medium 55. Jump Game Medium
1 191. Maximum Product Subarray Medium 152. Maximum Product Subarray Medium
2 115. Unique Paths II Easy 63. Unique Paths II Medium
2 515. Paint House Medium 256. Paint House (locked) Medium
2 512. Decode Ways Medium 91. Decode Ways Medium
2 397. Longest Continuous Increasing Subsequence Easy 674. Longest Continuous Increasing Subsequence Easy
2 110. Minimum Path Sum Easy 64. Minimum Path Sum Medium
2 553. Bomb Enemy Medium 361. Bomb Enemy (locked) Medium
2 664. Counting Bits (locked) Medium 338. Counting Bits Easy
3 516. Paint House II Hard 265. Paint House II (locked) Hard
3 392. House Robber Medium 198. House Robber Medium
3 534. House Robber II Medium 213. House Robber II Medium
3 149. Best Time to Buy and Sell Stock Medium 121. Best Time to Buy and Sell Stock Easy
3 150. Best Time to Buy and Sell Stock II Medium 122. Best Time to Buy and Sell Stock II Medium
3 151. Best Time to Buy and Sell Stock III Medium 123. Best Time to Buy and Sell Stock III Hard
3 393. Best Time to Buy and Sell Stock IV Medium 188. Best Time to Buy and Sell Stock IV Hard
3 76. Longest Increasing Subsequence Medium 300. Longest Increasing Subsequence Medium
3 602. Russian Doll Envelopes Hard 354. Russian Doll Envelopes Hard
4 513. Perfect Squares Medium 279. Perfect Squares Medium
4 108. Palindrome Partitioning II Medium 132. Palindrome Partitioning II Hard
4 437. Copy Books Medium
4 394. Coins in a Line Medium
4 92. Backpack Medium
4 563. Backpack V Medium
4 564. Backpack VI (找不到) Medium
5 125. Backpack II Medium
5 440. Backpack III Medium
5 667. Longest Palindromic Subsequence Medium 516. Longest Palindromic Subsequence Medium
5 396. Coins In A Line III (locked) Hard
5 430. Scramble String Hard 87. Scramble String Hard
5 168. Burst Balloons Hard 312. Burst Balloons Hard
6 77. Longest Common Subsequence Medium 1143. Longest Common Subsequence Medium
6 29. Interleaving String Hard 97. Interleaving String Medium
6 119. Edit Distance Medium 72. Edit Distance Hard
6 118. Distinct Subsequences Medium 115. Distinct Subsequences Hard
6 154. Regular Expression Matching Hard 10. Regular Expression Matching Hard
6 192. Wildcard Matching Hard 44. Wildcard Matching Hard
6 668. Ones and Zeroes Medium 474. Ones and Zeroes Medium
7 91. Minimum Adjustment Cost (locked) Medium
7 89. K-Sum Hard
7 76. Longest Increasing Subsequence Medium 300. Longest Increasing Subsequence Medium
7 623. K Edit Distance (locked) Hard
7 622. Frog Jump Hard 403. Frog Jump Hard
7 676. Decode Ways II (locked) Hard 639. Decode Ways II Hard
7 436. Maximal Square Medium 221. Maximal Square Medium