| Product Sales Analysis V | Open ↗ |
| Product's Price for Each Store | Open ↗ |
| Products With Three or More Orders in Two Consecutive Years | Open ↗ |
| Profitable Schemes | Open ↗ |
| Project Employees I | Open ↗ |
| Project Employees II | Open ↗ |
| Project Employees III | Open ↗ |
| Projection Area of 3D Shapes | Open ↗ |
| Promise Pool | Open ↗ |
| Promise Time Limit | Open ↗ |
| Properties Graph | Open ↗ |
| Pseudo-Palindromic Paths in a Binary Tree | Open ↗ |
| Push Dominoes | Open ↗ |
| Put Boxes Into the Warehouse I | Open ↗ |
| Put Boxes Into the Warehouse II | Open ↗ |
| Put Marbles in Bags | Open ↗ |
| Pyramid Transition Matrix | Open ↗ |
| Pythagorean Distance Nodes in a Tree | Open ↗ |
| Queens That Can Attack the King | Open ↗ |
| Queries on a Permutation With Key | Open ↗ |
| Queries on Number of Points Inside a Circle | Open ↗ |
| Queries Quality and Percentage | Open ↗ |
| Query Kth Smallest Trimmed Number | Open ↗ |
| Queue Reconstruction by Height | Open ↗ |
| Rabbits in Forest | Open ↗ |
| Race Car | Open ↗ |
| Random Flip Matrix | Open ↗ |
| Random Pick Index | Open ↗ |
| Random Pick with Blacklist | Open ↗ |
| Random Pick with Weight | Open ↗ |
| Random Point in Non-overlapping Rectangles | Open ↗ |
| Range Addition | Open ↗ |
| Range Addition II | Open ↗ |
| Range Frequency Queries | Open ↗ |
| Range Module | Open ↗ |
| Range Product Queries of Powers | Open ↗ |
| Range Sum of BST | Open ↗ |
| Range Sum of Sorted Subarray Sums | Open ↗ |
| Range Sum Query 2D - Immutable | Open ↗ |
| Range Sum Query 2D - Mutable | Open ↗ |
| Range Sum Query - Immutable | Open ↗ |
| Range Sum Query - Mutable | Open ↗ |
| Rank Scores | Open ↗ |
| Rank Teams by Votes | Open ↗ |
| Rank Transform of a Matrix | Open ↗ |
| Rank Transform of an Array | Open ↗ |
| Ransom Note | Open ↗ |
| Reachable Nodes In Subdivided Graph | Open ↗ |
| Reachable Nodes With Restrictions | Open ↗ |
| Reach a Number | Open ↗ |
| Reach End of Array With Max Score | Open ↗ |
| Reaching Points | Open ↗ |
| Read N Characters Given Read4 | Open ↗ |
| Read N Characters Given read4 II - Call Multiple Times | Open ↗ |
| Rearrange Array Elements by Sign | Open ↗ |
| Rearrange Array to Maximize Prefix Score | Open ↗ |
| Rearrange Characters to Make Target String | Open ↗ |
| Rearrange Products Table | Open ↗ |
| Rearrange Spaces Between Words | Open ↗ |
| Rearrange String k Distance Apart | Open ↗ |
| Rearrange Words in a Sentence | Open ↗ |
| Rearranging Fruits | Open ↗ |
| Reconstruct a 2-Row Binary Matrix | Open ↗ |
| Reconstruct Itinerary | Open ↗ |
| Reconstruct Original Digits from English | Open ↗ |
| Recover a Tree From Preorder Traversal | Open ↗ |
| Recover Binary Search Tree | Open ↗ |
| Recover the Original Array | Open ↗ |
| Rectangle Area | Open ↗ |
| Rectangle Area II | Open ↗ |
| Rectangle Overlap | Open ↗ |
| Rectangles Area | Open ↗ |
| Recyclable and Low Fat Products | Open ↗ |
| Redistribute Characters to Make All Strings Equal | Open ↗ |
| Reduce Array Size to The Half | Open ↗ |
| Reducing Dishes | Open ↗ |
| Reduction Operations to Make the Array Elements Equal | Open ↗ |
| Redundant Connection | Open ↗ |
| Redundant Connection II | Open ↗ |
| Reformat Date | Open ↗ |
| Reformat Department Table | Open ↗ |
| Reformat Phone Number | Open ↗ |
| Reformat The String | Open ↗ |
| Regions Cut By Slashes | Open ↗ |
| Regular Expression Matching | Open ↗ |
| Relative Ranks | Open ↗ |
| Relative Sort Array | Open ↗ |
| Relocate Marbles | Open ↗ |
| Remove 9 | Open ↗ |
| Remove Adjacent Almost-Equal Characters | Open ↗ |
| Remove All Adjacent Duplicates In String | Open ↗ |
| Remove All Adjacent Duplicates in String II | Open ↗ |
| Remove All Occurrences of a Substring | Open ↗ |
| Remove All Ones With Row and Column Flips | Open ↗ |
| Remove All Ones With Row and Column Flips II | Open ↗ |
| Remove Boxes | Open ↗ |
| Remove Colored Pieces if Both Neighbors are the Same Color | Open ↗ |
| Remove Comments | Open ↗ |
| Remove Covered Intervals | Open ↗ |
| Remove Digit From Number to Maximize Result | Open ↗ |