| 890 | Find and Replace Pattern | ArrayHash TableString | Medium |
| 893 | Groups of Special-Equivalent Strings | ArrayHash TableString+1 | Medium |
| 894 | All Possible Full Binary Trees | Dynamic ProgrammingTreeRecursion+2 | Medium |
| 898 | Bitwise ORs of Subarrays | ArrayDynamic ProgrammingBit Manipulation | Medium |
| 900 | RLE Iterator | ArrayDesignCounting+1 | Medium |
| 901 | Online Stock Span | StackDesignMonotonic Stack+1 | Medium |
| 904 | Fruit Into Baskets | ArrayHash TableSliding Window | Medium |
| 907 | Sum of Subarray Minimums | ArrayDynamic ProgrammingStack+1 | Medium |
| 909 | Snakes and Ladders | ArrayBreadth-First SearchMatrix | Medium |
| 910 | Smallest Range II | ArrayMathGreedy+1 | Medium |
| 911 | Online Election | ArrayHash TableBinary Search+1 | Medium |
| 912 | Sort an Array | ArrayDivide and ConquerSorting+5 | Medium |
| 915 | Partition Array into Disjoint Intervals | Array | Medium |
| 916 | Word Subsets | ArrayHash TableString | Medium |
| 918 | Maximum Sum Circular Subarray | ArrayDivide and ConquerDynamic Programming+2 | Medium |
| 919 | Complete Binary Tree Inserter | TreeBreadth-First SearchDesign+1 | Medium |
| 921 | Minimum Add to Make Parentheses Valid | StringStackGreedy | Medium |
| 923 | 3Sum With Multiplicity | ArrayHash TableTwo Pointers+2 | Medium |
| 926 | Flip String to Monotone Increasing | StringDynamic Programming | Medium |
| 930 | Binary Subarrays With Sum | ArrayHash TableSliding Window+1 | Medium |
| 931 | Minimum Falling Path Sum | ArrayDynamic ProgrammingMatrix | Medium |
| 932 | Beautiful Array | ArrayMathDivide and Conquer | Medium |
| 934 | Shortest Bridge | ArrayDepth-First SearchBreadth-First Search+1 | Medium |
| 935 | Knight Dialer | Dynamic Programming | Medium |
| 937 | Reorder Data in Log Files | ArrayStringSorting | Medium |
| 939 | Minimum Area Rectangle | ArrayHash TableMath+2 | Medium |
| 945 | Minimum Increment to Make Array Unique | ArrayGreedySorting+1 | Medium |
| 946 | Validate Stack Sequences | ArrayStackSimulation | Medium |
| 947 | Most Stones Removed with Same Row or Column | Hash TableDepth-First SearchUnion Find+1 | Medium |
| 948 | Bag of Tokens | ArrayTwo PointersGreedy+1 | Medium |
| 949 | Largest Time for Given Digits | ArrayStringBacktracking+1 | Medium |
| 950 | Reveal Cards In Increasing Order | ArrayQueueSorting+1 | Medium |
| 951 | Flip Equivalent Binary Trees | TreeDepth-First SearchBinary Tree | Medium |
| 954 | Array of Doubled Pairs | ArrayHash TableGreedy+1 | Medium |
| 955 | Delete Columns to Make Sorted II | ArrayStringGreedy | Medium |
| 957 | Prison Cells After N Days | ArrayHash TableMath+1 | Medium |
| 958 | Check Completeness of a Binary Tree | TreeBreadth-First SearchBinary Tree | Medium |
| 959 | Regions Cut By Slashes | ArrayHash TableDepth-First Search+3 | Medium |
| 962 | Maximum Width Ramp | ArrayTwo PointersStack+1 | Medium |
| 963 | Minimum Area Rectangle II | ArrayHash TableMath+1 | Medium |
| 966 | Vowel Spellchecker | ArrayHash TableString | Medium |
| 967 | Numbers With Same Consecutive Differences | BacktrackingBreadth-First Search | Medium |
| 969 | Pancake Sorting | ArrayTwo PointersGreedy+1 | Medium |
| 970 | Powerful Integers | Hash TableMathEnumeration | Medium |
| 971 | Flip Binary Tree To Match Preorder Traversal | TreeDepth-First SearchBinary Tree | Medium |
| 973 | K Closest Points to Origin | ArrayMathDivide and Conquer+4 | Medium |
| 974 | Subarray Sums Divisible by K | ArrayHash TablePrefix Sum | Medium |
| 978 | Longest Turbulent Subarray | ArrayDynamic ProgrammingSliding Window | Medium |
| 979 | Distribute Coins in Binary Tree | TreeDepth-First SearchBinary Tree | Medium |
| 981 | Time Based Key-Value Store | Hash TableStringBinary Search+1 | Medium |