Problems are shown in problem set order:
2. Add Two Numbers: IDEA Project
9. Palindrome Number: IDEA Project
11. Container With Most Water: IDEA Project
14. Longest Common Prefix: IDEA Project
17. Letter Combinations of a Phone Number: IDEA Project
20. Valid Parentheses: IDEA Project
26. Remove Duplicates from Sorted Array: IDEA Project
33. Search in Rotated Sorted Array: IDEA Project
35. Search Insert Position: IDEA Project
36. Valid Sudoku: IDEA Project
46. Permutations: IDEA Project
49. Group Anagrams: IDEA Project
58. Length of Last Word: IDEA Project
62. Unique Paths: IDEA Project
63. Unique Paths II: IDEA Project
70. Climbing Stairs: IDEA Project
73. Set Matrix Zeroes: IDEA Project
74. Search a 2D Matrix: IDEA Project
76. Minimum Window Substring: IDEA Project
77. Combinations: IDEA Project
81. Search in Rotated Sorted Array II: IDEA Project
84. Largest Rectangle in Histogram: IDEA Project
86. Partition List: IDEA Project
88. Merge Sorted Array: IDEA Project
92. Reverse Linked List II: IDEA Project
97. Interleaving String: IDEA Project
111. Minimum Depth of Binary Tree: IDEA Project
118. Pascal's Triangle: IDEA Project
129. Sum Root to Leaf Numbers: IDEA Project
137. Single Number II: IDEA Project
138. Copy List with Random Pointer: IDEA Project
141. Linked List Cycle: IDEA Project
150. Evaluate Reverse Polish Notation: IDEA Project
168. Excel Sheet Column Title: IDEA Project
169. Majority Element: IDEA Project
189. Rotate Array: IDEA Project
198. House Robber: IDEA Project
205. Isomorphic Strings: IDEA Project
207. Course Schedule: IDEA Project
209. Minimum Size Subarray Sum: IDEA Project
215. Kth Largest Element in an Array: IDEA Project
225. Implement Stack using Queues: IDEA Project
228. Summary Ranges: IDEA Project
229. Majority Element II: IDEA Project
239. Sliding Window Maximum: IDEA Project
242. Valid Anagram: IDEA Project
268. Missing Number: IDEA Project
287. Find the Duplicate Number: IDEA Project
303. Range Sum Query - Immutable: IDEA Project
316. Remove Duplicate Letters: IDEA Project
338. Counting Bits: IDEA Project
349. Intersection of Two Arrays: IDEA Project
373. Find K Pairs with Smallest Sums: IDEA Project
380. Insert Delete GetRandom O(1): IDEA Project
387. First Unique Character in a String: IDEA Project
389. Find the Difference: IDEA Project
392. Is Subsequence: IDEA Project
420. Strong Password Checker: IDEA Project
435. Non-overlapping Intervals: IDEA Project
445. Add Two Numbers II: IDEA Project
451. Sort Characters By Frequency: IDEA Project
455. Assign Cookies: IDEA Project
459. Repeated Substring Pattern: IDEA Project
486. Predict the Winner: IDEA Project
518. Coin Change II: IDEA Project
530. Minimum Absolute Difference in BST: IDEA Project
547. Number of Provinces: IDEA Project
576. Out of Boundary Paths: IDEA Project
645. Set Mismatch: IDEA Project
646. Maximum Length of Pair Chain: IDEA Project
673. Number of Longest Increasing Subsequence: IDEA Project
688. Knight Probability in Chessboard: IDEA Project
712. Minimum ASCII Delete Sum for Two Strings: IDEA Project
714. Best Time to Buy and Sell Stock with Transaction Fee: IDEA Project
720. Longest Word in Dictionary: IDEA Project
725. Split Linked List in Parts: IDEA Project
731. My Calendar II: IDEA Project
735. Asteroid Collision: IDEA Project
744. Find Smallest Letter Greater Than Target: IDEA Project
791. Custom Sort String: IDEA Project
802. Find Eventual Safe States: IDEA Project
844. Backspace String Compare: IDEA Project
852. Peak Index in a Mountain Array: IDEA Project
859. Buddy Strings: IDEA Project
863. All Nodes Distance K in Binary Tree: IDEA Project
867. Transpose Matrix: IDEA Project
872. Leaf-Similar Trees: IDEA Project
880. Decoded String at Index: IDEA Project
896. Monotonic Array: IDEA Project
912. Sort an Array: IDEA Project
935. Knight Dialer: IDEA Project
956. Tallest Billboard: IDEA Project
977. Squares of a Sorted Array: IDEA Project
997. Find the Town Judge: IDEA Project
1027. Longest Arithmetic Subsequence: IDEA Project
1061. Maximum Level Sum of a Binary Tree: IDEA Project
1091. Shortest Path in Binary Matrix: IDEA Project
1125. Smallest Sufficient Team: IDEA Project
1140. Stone Game II: IDEA Project
1143. Longest Common Subsequence: IDEA Project
1146. Snapshot Array: IDEA Project
1155. Number of Dice Rolls With Target Sum: IDEA Project
1160. Find Words That Can Be Formed by Characters: IDEA Project
1187. Make Array Strictly Increasing: IDEA Project
1207. Unique Number of Occurrences: IDEA Project
1218. Longest Arithmetic Subsequence of Given Difference: IDEA Project
1232. Check If It Is a Straight Line: IDEA Project
1266. Minimum Time Visiting All Points: IDEA Project
1282. Group the People Given the Group Size They Belong To: IDEA Project
1291. Sequential Digits: IDEA Project
1318. Minimum Flips to Make a OR b Equal to c: IDEA Project
1337. The K Weakest Rows in a Matrix: IDEA Project
1339. Maximum Product of Splitted Binary Tree: IDEA Project
1347. Minimum Number of Steps to Make Two Strings Anagram: IDEA Project
1351. Count Negative Numbers in a Sorted Matrix: IDEA Project
1359. Count All Valid Pickup and Delivery Options: IDEA Project
1376. Time Needed to Inform All Employees: IDEA Project
1396. Design Underground System: IDEA Project
1481. Least Number of Unique Integers after K Removals: IDEA Project
1492. The kth Factor of n: IDEA Project
1493. Longest Subarray of 1's After Deleting One Element: IDEA Project
1502. Can Make Arithmetic Progression From Sequence: IDEA Project
1512. Number of Good Pairs: IDEA Project
1531. String Compression II: IDEA Project
1535. Find the Winner of an Array Game: IDEA Project
1547. Minimum Cost to Cut a Stick: IDEA Project
1561. Maximum Number of Coins You Can Get: IDEA Project
1569. Number of Ways to Reorder Array to Get Same BST: IDEA Project
1575. Count All Possible Routes: IDEA Project
1578. Minimum Time to Make Rope Colorful: IDEA Project
1599. Maximum Profit of Operating a Centennial Wheel: IDEA Project
1603. Design Parking System: IDEA Project
1615. Maximal Network Rank: IDEA Project
1637. Widest Vertical Area Between Two Points Containing No Points: IDEA Project
1647. Minimum Deletions to Make Character Frequencies Unique: IDEA Project
1653. Minimum Deletions to Make String Balanced: IDEA Project
1657. Determine if Two Strings Are Close: IDEA Project
1704. Determine if String Halves Are Alike: IDEA Project
1732. Find the Highest Altitude: IDEA Project
1749. Maximum Absolute Sum of Any Subarray: IDEA Project
1759. Count Number of Homogenous Substrings: IDEA Project
1802. Maximum Value at a Given Index in a Bounded Array: IDEA Project
1814. Count Nice Pairs in an Array: IDEA Project
1846. Maximum Element After Decreasing and Rearranging: IDEA Project
1870. Minimum Speed to Arrive on Time: IDEA Project
1877. Minimize Maximum Pair Sum in Array: IDEA Project
1887. Reduction Operations to Make the Array Elements Equal: IDEA Project
1897. Redistribute Characters to Make All Strings Equal: IDEA Project
1921. Eliminate Maximum Number of Monsters: IDEA Project
1970. Last Day Where You Can Still Cross: IDEA Project
1980. Find Unique Binary String: IDEA Project
2024. Maximize the Confusion of an Exam: IDEA Project
2038. Remove Colored Pieces if Both Neighbors are the Same Color: IDEA Project
2090. K Radius Subarray Averages: IDEA Project
2101. Detonate the Maximum Bombs: IDEA Project
2105. Watering Plants II: IDEA Project
2108. Find First Palindromic String in the Array: IDEA Project
2225. Find Players With Zero or One Losses: IDEA Project
2257. Count Unguarded Cells in the Grid: IDEA Project
2305. Fair Distribution of Cookies: IDEA Project
2328. Number of Increasing Paths in a Grid: IDEA Project
2352. Equal Row and Column Pairs: IDEA Project
2360. Longest Cycle in a Graph: IDEA Project
2369. Check if There is a Valid Partition For The Array: IDEA Project
2391. Minimum Amount of Time to Collect Garbage: IDEA Project
2405. Optimal Partition of String: IDEA Project
2433. Find The Original Array of Prefix Xor: IDEA Project
2448. Minimum Cost to Make Array Equal: IDEA Project
2462. Total Cost to Hire K Workers: IDEA Project
2483. Minimum Penalty for a Shop: IDEA Project
2551. Put Marbles in Bags: IDEA Project
2558. Take Gifts From the Richest Pile: IDEA Project
2610. Convert an Array Into a 2D Array With Conditions: IDEA Project
2616. Minimize the Maximum Difference of Pairs: IDEA Project
2673. Make Costs of Paths Equal in a Binary Tree: IDEA Project
2678. Number of Senior Citizens: IDEA Project
2707. Extra Characters in a String: IDEA Project
2849. Determine if a Cell Is Reachable at a Given Time: IDEA Project
2966. Divide Array Into Arrays With Max Difference: IDEA Project