| 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 ↗ |
| Pattern 1 | Open ↗ |
| Pattern 10 | Open ↗ |
| Pattern 11 | Open ↗ |
| Pattern 12 | Open ↗ |
| Pattern 13 | Open ↗ |
| Pattern 14 | Open ↗ |
| Pattern 15 | Open ↗ |
| Pattern 16 | Open ↗ |
| Pattern 17 | Open ↗ |
| Pattern 18 | Open ↗ |
| Pattern 19 | Open ↗ |
| Pattern 2 | Open ↗ |
| Pattern 20 | Open ↗ |
| Pattern 21 | Open ↗ |
| Pattern 22 | Open ↗ |
| Pattern 3 | Open ↗ |
| Pattern 4 | Open ↗ |
| Pattern 5 | Open ↗ |
| Pattern 6 | Open ↗ |
| Pattern 7 | Open ↗ |
| Pattern 8 | Open ↗ |
| Pattern 9 | Open ↗ |
| Peak element | 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 Binary Tree | Open ↗ |
| Perfect Number | Open ↗ |
| Perfect Rectangle | Open ↗ |
| Perfect Squares | Open ↗ |
| Perfect Sum Problem | Open ↗ |
| Perform String Shifts | Open ↗ |
| Permutation CoefficientProblem | Open ↗ |
| Permutation Difference between Two Strings | Open ↗ |
| Permutation in String | Open ↗ |
| Permutations | Open ↗ |
| Permutations | Open ↗ |
| Permutation Sequence | Open ↗ |
| Permutations II | Open ↗ |
| Permutations III | Open ↗ |
| Permutations of a given string | Open ↗ |
| Permutation with Spaces | Open ↗ |
| Permute Two Arrays such that Sum of Every Pair is Greater or Equal to K | Open ↗ |
| Phone directory | Open ↗ |
| Piar with given difference | Open ↗ |
| Picking Up Chicks | Open ↗ |
| Pizza Toppings Cost Analysis | Open ↗ |
| Pizza With 3n Slices | Open ↗ |
| Plates Between Candles | Open ↗ |
| Player with max score | Open ↗ |
| Plus One | Open ↗ |
| Plus One Linked List | Open ↗ |
| Points on the Straight Line | Open ↗ |
| Points That Intersect With Cars | Open ↗ |
| Point to next higher value node in a linked list with an Arbitrary Pointer | Open ↗ |
| Police and Thieves | Open ↗ |
| Poor Pigs | Open ↗ |
| Populate Inorder successor of all nodes | Open ↗ |
| Populate Next Right Pointers Tree | 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 ↗ |
| Possible paths between 2 vertices | Open ↗ |
| Postorder Traversal | Open ↗ |
| Postorder Traversal (Iterative) | Open ↗ |
| Postorder Traversal of a tree both using recursion and Iteration | Open ↗ |
| Pour Water | Open ↗ |
| Pour Water Between Buckets to Make Water Levels Equal | Open ↗ |
| Power Grid Maintenance | Open ↗ |
| Power of 2 | Open ↗ |
| Power of Four | Open ↗ |
| Power of Three | Open ↗ |
| Power of Two | Open ↗ |
| Power Set | Open ↗ |
| Power Set | Open ↗ |
| Power Update After K-th Largest Insertion I | Open ↗ |
| Pow(x, n) | Open ↗ |
| Predict the Winner | Open ↗ |
| Prefix and Suffix Search | Open ↗ |
| Prefix match with other strings | Open ↗ |
| Preimage Size of Factorial Zeroes Function | Open ↗ |
| Preorder to Postorder | Open ↗ |
| Preorder Traversal | Open ↗ |
| Preorder Traversal and BST | Open ↗ |
| Preorder Traversal of a tree both using recursion and Iteration | Open ↗ |
| Pre, Post, Inorder in one traversal | Open ↗ |
| Prerequisite Tasks | Open ↗ |
| Previous Permutation With One Swap | Open ↗ |
| Primary Department for Each Employee | Open ↗ |
| Prime Arrangements | Open ↗ |
| Prime factorisation of a Number | Open ↗ |