| Rotting Oranges | Open ↗ |
| Row With Maximum Ones | Open ↗ |
| Running Sum of 1d Array | Open ↗ |
| Russian Doll Envelopes | Open ↗ |
| Sales Analysis I | Open ↗ |
| Sales Analysis II | Open ↗ |
| Sales Analysis III | Open ↗ |
| Sales by Day of the Week | Open ↗ |
| Sales Person | Open ↗ |
| Same Tree | Open ↗ |
| Satisfiability of Equality Equations | Open ↗ |
| Score After Flipping Matrix | Open ↗ |
| Score of a String | Open ↗ |
| Score of Parentheses | Open ↗ |
| Scramble String | Open ↗ |
| Search a 2D Matrix | Open ↗ |
| Search a 2D Matrix II | Open ↗ |
| Search in a Binary Search Tree | Open ↗ |
| Search in a Sorted Array of Unknown Size | Open ↗ |
| Search in Rotated Sorted Array | Open ↗ |
| Search in Rotated Sorted Array II | Open ↗ |
| Search Insert Position | Open ↗ |
| Search Suggestions System | Open ↗ |
| Seat Reservation Manager | Open ↗ |
| Second Highest Salary | Open ↗ |
| Second Largest Digit in a String | Open ↗ |
| Second Minimum Node In a Binary Tree | Open ↗ |
| Second Minimum Time to Reach Destination | Open ↗ |
| Select Data | Open ↗ |
| Select K Disjoint Special Substrings | Open ↗ |
| Self Crossing | Open ↗ |
| Self Dividing Numbers | Open ↗ |
| Sell Diminishing-Valued Colored Balls | Open ↗ |
| Sender With Largest Word Count | Open ↗ |
| Sentence Screen Fitting | Open ↗ |
| Sentence Similarity | Open ↗ |
| Sentence Similarity II | Open ↗ |
| Sentence Similarity III | Open ↗ |
| Separate Black and White Balls | Open ↗ |
| Separate Squares I | Open ↗ |
| Separate Squares II | Open ↗ |
| Separate the Digits in an Array | Open ↗ |
| Sequence Reconstruction | Open ↗ |
| Sequential Digits | Open ↗ |
| Sequentially Ordinal Rank Tracker | Open ↗ |
| Serialize and Deserialize Binary Tree | Open ↗ |
| Serialize and Deserialize BST | Open ↗ |
| Serialize and Deserialize N-ary Tree | Open ↗ |
| Set Intersection Size At Least Two | Open ↗ |
| Set Matrix Zeroes | Open ↗ |
| Set Mismatch | Open ↗ |
| Shift 2D Grid | Open ↗ |
| Shift Distance Between Two Strings | Open ↗ |
| Shifting Letters | Open ↗ |
| Shifting Letters II | Open ↗ |
| Shopping Offers | Open ↗ |
| Short Encoding of Words | Open ↗ |
| Shortest and Lexicographically Smallest Beautiful String | Open ↗ |
| Shortest Bridge | Open ↗ |
| Shortest Common Supersequence | Open ↗ |
| Shortest Completing Word | Open ↗ |
| Shortest Cycle in a Graph | Open ↗ |
| Shortest Distance After Road Addition Queries I | Open ↗ |
| Shortest Distance from All Buildings | Open ↗ |
| Shortest Distance in a Plane | Open ↗ |
| Shortest Distance to a Character | Open ↗ |
| Shortest Distance to Target Color | Open ↗ |
| Shortest Distance to Target String in a Circular Array | Open ↗ |
| Shortest Impossible Sequence of Rolls | Open ↗ |
| Shortest Matching Substring | Open ↗ |
| Shortest Palindrome | Open ↗ |
| Shortest Path in a Grid with Obstacles Elimination | Open ↗ |
| Shortest Path in a Hidden Grid | Open ↗ |
| Shortest Path in a Weighted Tree | Open ↗ |
| Shortest Path in Binary Matrix | Open ↗ |
| Shortest Path to Get All Keys | Open ↗ |
| Shortest Path to Get Food | Open ↗ |
| Shortest Path Visiting All Nodes | Open ↗ |
| Shortest Path with Alternating Colors | Open ↗ |
| Shortest String That Contains Three Strings | Open ↗ |
| Shortest Subarray to be Removed to Make Array Sorted | Open ↗ |
| Shortest Subarray With OR at Least K I | Open ↗ |
| Shortest Subarray With OR at Least K II | Open ↗ |
| Shortest Subarray with Sum at Least K | Open ↗ |
| Shortest Uncommon Substring in an Array | Open ↗ |
| Shortest Unsorted Continuous Subarray | Open ↗ |
| Shortest Way to Form String | Open ↗ |
| Shortest Word Distance | Open ↗ |
| Shortest Word Distance II | Open ↗ |
| Shortest Word Distance III | Open ↗ |
| Shuffle an Array | Open ↗ |
| Shuffle String | Open ↗ |
| Shuffle the Array | Open ↗ |
| Sign of the Product of an Array | Open ↗ |
| Similar RGB Color | Open ↗ |
| Similar String Groups | Open ↗ |
| Simple Bank System | Open ↗ |
| Simplified Fractions | Open ↗ |
| Simplify Path | Open ↗ |
| Single Element in a Sorted Array | Open ↗ |