| 15 | 3 Sum | Medium | two pointers |
| 16 | 3 Sum Closest | Medium | two pointers |
| 18 | 4 Sum | Medium | two pointers |
| 19 | Remove Nth Node From End of List | Medium | two pointers |
| 26 | Remove Duplicates from Sorted Array | Easy | array |
| 80 | Remove Duplicates from Sorted Array II | Medium | array |
| 86 | Partition List | Medium | two pointers |
| 141 | Linked List Cycle | Easy | two pointers |
| 142 | Linked List Cycle II | Medium | two pointers |
| 143 | Reorder List | Medium | two pointers |
| 167 | Two Sum II - Input array is sorted | Medium | two pointers |
| 259 | 3Sum Smaller | Medium | two pointers |
| 283 | Move Zeroes | Easy | two pointers |
| 287 | Find the Duplicate Number | Hard | two pointers |
| 344 | Reverse String | Easy | two pointers |
| 345 | Reverse Vowels of a String | Easy | two pointers |
| 356 | Line Reflection | Medium | hash table |
| 360 | Sort Transformed Array | Medium | two pointers |
| 369 | Plus One Linked List | Medium | linked list |
| 457 | Circular Array Loop | Medium | two pointers |
| 567 | Permutation in String | Medium | two pointers |
| 611 | Valid Triangle Number | Medium | two pointers |
| 653 | Two Sum IV - Input is a BST | Easy | tree |
| 777 | Swap Adjacent in LR String | Medium | two pointers |
| 826 | Most Profit Assigning Work | Medium | two pointers |
| 828 | Count Unique Characters of All Substrings of a Given String | Hard | two pointers |
| 844 | Backspace String Compare | Easy | two pointers |
| 876 | Middle of the Linked List | Easy | two pointers |
| 948 | Bag of Tokens | Medium | greedy |
| 977 | Squares of a Sorted Array | Easy | two pointers |
| 992 | Subarrays with K Different Integers | Hard | two pointers |
| 1033 | Moving Stones Until Consecutive | Easy | two pointers |
| 1040 | Moving Stones Until Consecutive II | Medium | two pointers |
| 1213 | Intersection of Three Sorted Arrays | Easy | two pointers |
| 1234 | Replace the Substring for Balanced String | Medium | two pointers |
| 1248 | Count Number of Nice Subarrays | Medium | two pointers |
| 1385 | Find the Distance Value Between Two Arrays | Easy | binary search |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | two pointers |
| 1508 | Range Sum of Sorted Subarray Sums | Medium | two pointers |
| 1521 | Find a Value of a Mysterious Function Closest to Target | Hard | two pointers |
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | two pointers |
| 1610 | Maximum Number of Visible Points | Hard | geometry |
| 1616 | Split Two Strings to Make Palindrome | Medium | greedy |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | two pointers |
| 1687 | Delivering Boxes from Storage to Ports | Hard | two pointers |
| 1695 | Maximum Erasure Value | Medium | two pointers |
| 1712 | Ways to Split Array Into Three Subarrays | Medium | two pointers |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium | two pointers |
| 1782 | Count Pairs Of Nodes | Hard | graph |
| 1838 | Frequency of the Most Frequent Element | Medium | two pointers |
| 1852 | Distinct Numbers in Each Subarray | Medium | two pointers |
| 1855 | Maximum Distance Between a Pair of Values | Medium | two pointers |
| 1868 | Product of Two Run-Length Encoded Arrays | Medium | two pointers |
| 1885 | Count Pairs in Two Arrays | Medium | two pointers |
| 1888 | Minimum Number of Flips to Make the Binary String Alternatings | Medium | two pointers |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | two pointers |
| 1989 | Maximum Number of People That Can Be Caught in Tag | Medium | two pointers |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | two pointers |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | two pointers |
| 2095 | Delete the Middle Node of a Linked List | Medium | linked list |
| 2105 | Watering Plants II | Medium | two pointers |
| 2130 | Maximum Twin Sum of a Linked List | Medium | linked list |
| 2149 | Rearrange Array Elements by Sign | Medium | two pointers |
| 2161 | Partition Array According to Given Pivot | Medium | two pointers |
| 2181 | Merge Nodes in Between Zeros | Medium | linked list |
| 2200 | Find All K-Distant Indices in an Array | Easy | two pointers |
| 2234 | Maximum Total Beauty of the Gardens | Hard | two pointers |
| 2302 | Count Subarrays With Score Less Than K | Hard | two pointers |
| 2330 | Valid Palindrome IV | Medium | two pointers |
| 2332 | The Latest Time to Catch a Bus | Medium | two pointers |
| 2337 | Move Pieces to Obtain a String | Medium | two pointers |
| 2348 | Number of Zero-Filled Subarrays | Medium | two pointers |
| 2354 | Number of Excellent Pairs | Hard | hash table |
| 2393 | Count Strictly Increasing Subarrays | Medium | two pointers |
| 2398 | Maximum Number of Robots Within Budget | Hard | queue |
| 2401 | Longest Nice Subarray | Medium | two pointers |
| 2422 | Merge Operations to Turn Array Into a Palindrome | Medium | greedy |
| 2426 | Number of Pairs Satisfying Inequality | Hard | binary search tree |
| 2444 | Count Subarrays With Fixed Bounds | Hard | two pointers |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | two pointers |
| 2462 | Total Cost to Hire K Workers | Medium | binary heap |
| 2465 | Number of Distinct Averages | Easy | two pointers |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | greedy |
| 2486 | Append Characters to String to Make Subsequence | Medium | greedy |
| 2511 | Maximum Enemy Forts That Can Be Captured | Easy | two pointers |
| 2516 | Take K of Each Character From Left and Right | Medium | two pointers |
| 2524 | Maximum Frequency Score of a Subarray | Hard | two pointers |
| 2537 | Count the Number of Good Subarrays | Medium | two pointers |
| 2540 | Minimum Common Value | Easy | two pointers |
| 2555 | Maximize Win From Two Segments | Medium | two pointers |
| 2563 | Count the Number of Fair Pairs | Medium | two pointers |
| 2565 | Subsequence With the Minimum Score | Hard | dynamic programming |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | two pointers |
| 2576 | Find the Maximum Number of Marked Indices | Medium | greedy |
| 2592 | Maximize Greatness of an Array | Medium | hash table |
| 2609 | Find the Longest Balanced Substring of a Binary String | Easy | two pointers |
| 2653 | Sliding Subarray Beauty | Medium | two pointers |
| 2674 | Split a Circular Linked List | Medium | linked list |
| 2722 | Join Two Arrays by ID | Medium | design |
| 2730 | Find the Longest Semi-Repetitive Substring | Medium | two pointers |
| 2743 | Count Substrings Without Repeating Character | Medium | two pointers |
| 2747 | Count Zero Request Servers | Hard | two pointers |
| 2762 | Continuous Subarrays | Medium | two pointers |
| 2763 | Sum of Imbalance Numbers of All Subarrays | Hard | two pointers |
| 2779 | Maximum Beauty of an Array After Applying Operation | Medium | two pointers |
| 2781 | Length of the Longest Valid Substring | Hard | two pointers |
| 2799 | Count Complete Subarrays in an Array | Medium | two pointers |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy | two pointers |
| 2825 | Make String a Subsequence Using Cyclic Increments | Medium | greedy |
| 2831 | Find the Longest Equal Subarray | Medium | two pointers |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard | graph |
| 2838 | Maximum Coins Heroes Can Collect | Medium | two pointers |
| 2841 | Maximum Sum of Almost Unique Subarray | Medium | two pointers |
| 2875 | Minimum Size Subarray in Infinite Array | Medium | two pointers |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | Medium | two pointers |
| 2932 | Maximum Strong Pair XOR I | Easy | bit manipulation |
| 2933 | High-Access Employees | Medium | two pointers |
| 2935 | Maximum Strong Pair XOR II | Hard | bit manipulation |
| 2938 | Separate Black and White Balls | Medium | two pointers |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | dynamic programming |
| 2953 | Count Complete Substrings | Medium | two pointers |
| 2958 | Length of Longest Subarray With at Most K Frequency | Medium | two pointers |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | two pointers |
| 2968 | Apply Operations to Maximize Frequency Score | Hard | two pointers |
| 2970 | Count the Number of Incremovable Subarrays I | Easy | two pointers |
| 2972 | Count the Number of Incremovable Subarrays II | Hard | two pointers |
| 3006 | Find Beautiful Indices in the Given Array I | Medium | two pointers |
| 3008 | Find Beautiful Indices in the Given Array II | Hard | two pointers |
| 3085 | Minimum Deletions to Make String K-Special | Medium | two pointers |
| 3088 | Make String Anti-palindrome | Hard | greedy |
| 3090 | Maximum Length Substring With Two Occurrences | Easy | two pointers |
| 3095 | Shortest Subarray With OR at Least K I | Easy | two pointers |
| 3097 | Shortest Subarray With OR at Least K II | Medium | two pointers |
| 3098 | Find the Sum of Subsequence Powers | Hard | dynamic programming |
| 3104 | Find Longest Self-Contained Substring | Hard | binary search |
| 3117 | Minimum Sum of Values by Dividing Array | Hard | dynamic programming |
| 3134 | Find the Median of the Uniqueness Array | Hard | binary search |
| 3171 | Find Subarray With Bitwise OR Closest to K | Hard | two pointers |
| 3174 | Clear Digits | Easy | stack |
| 3186 | Maximum Total Damage With Spell Casting | Medium | dynamic programming |
| 3193 | Count the Number of Inversions | Hard | dynamic programming |
| 3206 | Alternating Groups I | Easy | two pointers |
| 3208 | Alternating Groups II | Medium | two pointers |
| 3234 | Count the Number of Substrings With Dominant Ones | Medium | two pointers |
| 3254 | Find the Power of K-Size Subarrays I | Medium | two pointers |
| 3255 | Find the Power of K-Size Subarrays II | Medium | two pointers |
| 3258 | Count Substrings That Satisfy K-Constraint I | Easy | two pointers |
| 3261 | Count Substrings That Satisfy K-Constraint II | Hard | two pointers |
| 3264 | Final Array State After K Multiplication Operations I | Easy | two pointers |
| 3266 | Final Array State After K Multiplication Operations II | Hard | two pointers |
| 3291 | Minimum Number of Valid Strings to Form Target I | Medium | dynamic programming |
| 3292 | Minimum Number of Valid Strings to Form Target II | Hard | dynamic programming |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | Medium | two pointers |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | Hard | two pointers |
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | Medium | two pointers |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium | two pointers |
| 3318 | Find X-Sum of All K-Long Subarrays I | Easy | two pointers |
| 3321 | Find X-Sum of All K-Long Subarrays II | Hard | two pointers |
| 3323 | Minimize Connected Groups by Inserting Interval | Medium | two pointers |
| 3325 | Count Substrings With K-Frequency Characters I | Medium | two pointers |
| 3329 | Count Substrings With K-Frequency Characters II | Hard | two pointers |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium | two pointers |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Hard | two pointers |
| 3364 | Minimum Positive Sum Subarray | Easy | two pointers |
| 3413 | Maximum Coins From K Consecutive Bags | Medium | two pointers |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard | two pointers |
| 3422 | Minimum Operations to Make Subarray Elements Equal | Medium | two pointers |
| 3425 | Longest Special Path | Hard | two pointers |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium | math |
| 3430 | Maximum and Minimum Sums of at Most Size K Subarrays | Hard | two pointers |
| 3439 | Reschedule Meetings for Maximum Free Time I | Medium | two pointers |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard | two pointers |
| 3455 | Shortest Matching Substring | Hard | string |
| 3460 | Longest Common Prefix After at Most One Removal | Medium | two pointers |
| 3464 | Maximize the Distance Between Points on a Square | Hard | binary search |
| 3474 | Lexicographically Smallest Generated String | Hard | greedy |
| 3478 | Choose K Elements With Maximum Sum | Medium | greedy |
| 3486 | Longest Special Path II | Hard | two pointers |
| 3555 | Smallest Subarray to Sort in Every Sliding Window | Medium | two pointers |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Medium | two pointers |
| 3578 | Count Partitions With Max-Min Difference at Most K | Medium | dynamic programming |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | Medium | two pointers |
| 3589 | Count Prime-Gap Balanced Subarrays | Medium | two pointers |
| 3634 | Minimum Removals to Balance Array | Medium | two pointers |
| 3640 | Trionic Array II | Easy | two pointers |
| 3641 | Longest Semi-Repeating Subarray | Medium | two pointers |
| 3649 | Number of Perfect Pairs | Medium | two pointers |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Medium | two pointers |
| 3656 | Determine if a Simple Graph Exists | Medium | graph |
| 3661 | Maximum Walls Destroyed by Robots | Hard | dynamic programming |
| 3672 | Sum of Weighted Modes in Subarrays | Medium | two pointers |
| 3679 | Minimum Discards to Balance Inventory | Medium | two pointers |
| 3691 | Maximum Total Subarray Value II | Hard | binary heap |
| 3698 | Split Array With Minimum Difference | Medium | two pointers |
| 3740 | Minimum Distance Between Three Equal Elements I | Easy | two pointers |
| 3741 | Minimum Distance Between Three Equal Elements II | Medium | two pointers |
| 3752 | Lexicographically Smallest Negated Permutation that Sums to Target | Medium | greedy |
| 3766 | Minimum Operations to Make Binary Palindrome | Medium | bit manipulation |
| 3768 | Minimum Inversion Count in Subarrays of Fixed Length | Hard | two pointers |
| 3795 | Minimum Subarray Length With Distinct Sum At Least K | Medium | two pointers |
| 3797 | Count Routes to Climb a Rectangular Grid | Hard | greedy |
| 3802 | Number of Ways to Paint Sheets | Hard | two pointers |
| 3835 | Count Subarrays With Cost Less Than or Equal to K | Medium | two pointers |
| 3844 | Longest Almost-Palindromic Substring | Medium | two pointers |
| 3845 | Maximum Subarray XOR with Bounded Range | Hard | two pointers |
| 3851 | Maximum Requests Without Violating the Limit | Medium | two pointers |
| 3853 | Merge Close Characters | Medium | simulation |
| 3859 | Count Subarrays With K Distinct Integers | Hard | two pointers |
| 3867 | Sum of GCD of Formed Pairs | Medium | simulation |
| 3872 | Longest Arithmetic Sequence After Changing At Most One Element | Medium | two pointers |
| 3874 | Valid Subarrays With Exactly One Peak | Medium | two pointers |
| 3937 | Minimum Operations to Make Array Modulo Alternating I | Medium | two pointers |
| 3944 | Minimum Operations to Make Array Modulo Alternating II | Hard | two pointers |
| 3969 | Valid Subarrays With Matching Sum Digits I | Medium | two pointers |
| 3972 | Valid Subarrays With Matching Sum Digits II | Hard | two pointers |