| 1980 | Find Unique Binary String | ArrayHash TableString+1 | Medium |
| 1981 | Minimize the Difference Between Target and Chosen Elements | ArrayDynamic ProgrammingMatrix | Medium |
| 1982 | Find Array Given Subset Sums | ArrayDivide and Conquer | Hard |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | ArraySliding WindowSorting | Easy |
| 1985 | Find the Kth Largest Integer in the Array | ArrayStringDivide and Conquer+3 | Medium |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 1987 | Number of Unique Good Subsequences | StringDynamic Programming | Hard |
| 1991 | Find the Middle Index in Array | ArrayPrefix Sum | Easy |
| 1992 | Find All Groups of Farmland | ArrayDepth-First SearchBreadth-First Search+1 | Medium |
| 1993 | Operations on Tree | ArrayHash TableTree+3 | Medium |
| 1994 | The Number of Good Subsets | ArrayHash TableMath+5 | Hard |
| 1995 | Count Special Quadruplets | ArrayHash TableEnumeration | Easy |
| 1996 | The Number of Weak Characters in the Game | ArrayStackGreedy+2 | Medium |
| 1997 | First Day Where You Have Been in All the Rooms | ArrayDynamic Programming | Medium |
| 1998 | GCD Sort of an Array | ArrayMathUnion Find+2 | Hard |
| 2000 | Reverse Prefix of Word | Two PointersStringStack | Easy |
| 2001 | Number of Pairs of Interchangeable Rectangles | ArrayHash TableMath+2 | Medium |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | StringDynamic ProgrammingBacktracking+2 | Medium |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 2006 | Count Number of Pairs With Absolute Difference K | ArrayHash TableCounting | Easy |
| 2007 | Find Original Array From Doubled Array | ArrayHash TableGreedy+1 | Medium |
| 2008 | Maximum Earnings From Taxi | ArrayHash TableBinary Search+2 | Medium |
| 2009 | Minimum Number of Operations to Make Array Continuous | ArrayHash TableBinary Search+1 | Hard |
| 2011 | Final Value of Variable After Performing Operations | ArrayStringSimulation | Easy |
| 2012 | Sum of Beauty in the Array | Array | Medium |
| 2013 | Detect Squares | ArrayHash TableDesign+1 | Medium |
| 2014 | Longest Subsequence Repeated k Times | StringBacktrackingGreedy+2 | Hard |
| 2016 | Maximum Difference Between Increasing Elements | Array | Easy |
| 2017 | Grid Game | ArrayMatrixPrefix Sum | Medium |
| 2018 | Check if Word Can Be Placed In Crossword | ArrayMatrixEnumeration | Medium |
| 2019 | The Score of Students Solving Math Expression | ArrayMathString+3 | Hard |
| 2022 | Convert 1D Array Into 2D Array | ArrayMatrixSimulation | Easy |
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | ArrayHash TableString+1 | Medium |
| 2024 | Maximize the Confusion of an Exam | StringBinary SearchSliding Window+1 | Medium |
| 2025 | Maximum Number of Ways to Partition an Array | ArrayHash TableCounting+2 | Hard |
| 2027 | Minimum Moves to Convert String | StringGreedy | Easy |
| 2028 | Find Missing Observations | ArrayMathSimulation | Medium |
| 2029 | Stone Game IX | ArrayMathGreedy+2 | Medium |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | StringStackGreedy+1 | Hard |
| 2032 | Two Out of Three | ArrayHash TableBit Manipulation | Easy |
| 2033 | Minimum Operations to Make a Uni-Value Grid | ArrayMathSorting+1 | Medium |
| 2034 | Stock Price Fluctuation | Hash TableDesignHeap (Priority Queue)+2 | Medium |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | ArrayTwo PointersBinary Search+4 | Hard |
| 2037 | Minimum Number of Moves to Seat Everyone | ArrayGreedySorting+1 | Easy |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | MathStringGreedy+1 | Medium |
| 2039 | The Time When the Network Becomes Idle | ArrayBreadth-First SearchGraph | Medium |
| 2040 | Kth Smallest Product of Two Sorted Arrays | ArrayBinary Search | Hard |
| 2042 | Check if Numbers Are Ascending in a Sentence | String | Easy |
| 2043 | Simple Bank System | ArrayHash TableDesign+1 | Medium |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | ArrayBacktrackingBit Manipulation+1 | Medium |