| 526 |
Russian Doll Envelopes |
Hard |
ArrayBinary SearchDynamic Programming |
| 527 |
Scramble String |
Hard |
StringDynamic Programming |
| 528 |
Select Cells in Grid With Maximum Score |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 529 |
Select K Disjoint Special Substrings |
Medium |
Hash TableStringDynamic Programming |
| 530 |
Selling Pieces of Wood |
Hard |
ArrayDynamic ProgrammingMemoization |
| 531 |
Sentence Screen Fitting |
Medium |
ArrayStringDynamic Programming |
| 532 |
Shopping Offers |
Medium |
ArrayDynamic ProgrammingBacktracking |
| 533 |
Shortest Common Supersequence |
Unknown |
StringDynamic Programming |
| 534 |
Shortest Common Supersequence |
Unknown |
StringDynamic Programming |
| 535 |
Shortest Distance to Target Color |
Medium |
ArrayBinary SearchDynamic Programming |
| 536 |
Shortest Path Visiting All Nodes |
Hard |
Dynamic ProgrammingBit ManipulationBreadth-First Search |
| 537 |
Sliding Puzzle |
Hard |
ArrayDynamic ProgrammingBacktracking |
| 538 |
Smallest Missing Genetic Value in Each Subtree |
Hard |
Dynamic ProgrammingTreeDepth-First Search |
| 539 |
Smallest Sufficient Team |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 540 |
Solving Questions With Brainpower |
Medium |
ArrayDynamic Programming |