| Parallel Courses III | Open ↗ |
| Parse Lisp Expression | Open ↗ |
| Parsing A Boolean Expression | Open ↗ |
| Partition Array According to Given Pivot | Open ↗ |
| Partition Array for Maximum Sum | Open ↗ |
| Partition Array for Maximum XOR and AND | Open ↗ |
| Partition Array into Disjoint Intervals | Open ↗ |
| Partition Array Into K-Distinct Groups | Open ↗ |
| Partition Array Into Three Parts With Equal Sum | Open ↗ |
| Partition Array Into Two Arrays to Minimize Sum Difference | Open ↗ |
| Partition Array into Two Equal Product Subsets | Open ↗ |
| Partition Array Such That Maximum Difference Is K | Open ↗ |
| Partition Array to Minimize XOR | Open ↗ |
| Partition Equal Subset Sum | Open ↗ |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Open ↗ |
| Partition Labels | Open ↗ |
| Partition List | Open ↗ |
| Partition String | Open ↗ |
| Partition to K Equal Sum Subsets | Open ↗ |
| Pascal's Triangle | Open ↗ |
| Pascal's Triangle II | Open ↗ |
| Pass the Pillow | Open ↗ |
| Patching Array | Open ↗ |
| Path Crossing | Open ↗ |
| Path Existence Queries in a Graph I | Open ↗ |
| Path Existence Queries in a Graph II | Open ↗ |
| Path In Zigzag Labelled Binary Tree | Open ↗ |
| Paths in Matrix Whose Sum Is Divisible by K | Open ↗ |
| Paths in Maze That Lead to Same Room | Open ↗ |
| Path Sum | Open ↗ |
| Path Sum II | Open ↗ |
| Path Sum III | Open ↗ |
| Path Sum IV | Open ↗ |
| Path with Maximum Gold | Open ↗ |
| Path With Maximum Minimum Value | Open ↗ |
| Path with Maximum Probability | Open ↗ |
| Path With Minimum Effort | Open ↗ |
| Patients With a Condition | Open ↗ |
| Peak Index in a Mountain Array | Open ↗ |
| Peaks in Array | Open ↗ |
| Peeking Iterator | Open ↗ |
| People Whose List of Favorite Companies Is Not a Subset of Another List | Open ↗ |
| Percentage of Letter in String | Open ↗ |
| Percentage of Users Attended a Contest | Open ↗ |
| Perfect Number | Open ↗ |
| Perfect Rectangle | Open ↗ |
| Perfect Squares | Open ↗ |
| Perform String Shifts | Open ↗ |
| Permutation Difference between Two Strings | Open ↗ |
| Permutation in String | Open ↗ |
| Permutations | Open ↗ |
| Permutation Sequence | Open ↗ |
| Permutations II | Open ↗ |
| Permutations III | Open ↗ |
| Pizza Toppings Cost Analysis | Open ↗ |
| Pizza With 3n Slices | Open ↗ |
| Plates Between Candles | Open ↗ |
| Plus One | Open ↗ |
| Plus One Linked List | Open ↗ |
| Points That Intersect With Cars | Open ↗ |
| Poor Pigs | Open ↗ |
| Populating Next Right Pointers in Each Node | Open ↗ |
| Populating Next Right Pointers in Each Node II | Open ↗ |
| Positions of Large Groups | Open ↗ |
| Possible Bipartition | Open ↗ |
| Pour Water | Open ↗ |
| Pour Water Between Buckets to Make Water Levels Equal | Open ↗ |
| Power Grid Maintenance | Open ↗ |
| Power of Four | Open ↗ |
| Power of Three | Open ↗ |
| Power of Two | Open ↗ |
| Power Update After K-th Largest Insertion I | Open ↗ |
| Pow(x, n) | Open ↗ |
| Predict the Winner | Open ↗ |
| Prefix and Suffix Search | Open ↗ |
| Preimage Size of Factorial Zeroes Function | Open ↗ |
| Previous Permutation With One Swap | Open ↗ |
| Primary Department for Each Employee | Open ↗ |
| Prime Arrangements | Open ↗ |
| Prime In Diagonal | Open ↗ |
| Prime Number of Set Bits in Binary Representation | Open ↗ |
| Prime Palindrome | Open ↗ |
| Prime Subtraction Operation | Open ↗ |
| Print Binary Tree | Open ↗ |
| Print in Order | Open ↗ |
| Print Words Vertically | Open ↗ |
| Print Zero Even Odd | Open ↗ |
| Prison Cells After N Days | Open ↗ |
| Process Restricted Friend Requests | Open ↗ |
| Process String with Special Operations I | Open ↗ |
| Process String with Special Operations II | Open ↗ |
| Process Tasks Using Servers | Open ↗ |
| Product of Array Except Self | Open ↗ |
| Product of the Last K Numbers | Open ↗ |
| Product of Two Run-Length Encoded Arrays | Open ↗ |
| Product Price at a Given Date | Open ↗ |
| Product Sales Analysis I | Open ↗ |
| Product Sales Analysis II | Open ↗ |
| Product Sales Analysis III | Open ↗ |
| Product Sales Analysis IV | Open ↗ |