2337. Move Pieces to Obtain a String
2337. Move Pieces to Obtain a String
Description
You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:
2203. Minimum Weighted Subgraph With the Required Paths
2203. Minimum Weighted Subgraph With the Required Paths
Description
You are given an integer n denoting the number of nodes of a weighted directed graph. The nodes are numbered from 0 to n - 1.
2563. Count the Number of Fair Pairs
2563. Count the Number of Fair Pairs
Description
Given a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs.
3529. Count Cells in Overlapping Horizontal and Vertical Substrings
3529. Count Cells in Overlapping Horizontal and Vertical Substrings
Description
You are given an m x n matrix grid consisting of characters and a string pattern.
1101. The Earliest Moment When Everyone Become Friends
1101. The Earliest Moment When Everyone Become Friends
Description
There are n people in a social group labeled from 0 to n - 1. You are given an array logs where logs[i] = [timestampi, xi, yi] indicates that xi and yi will be friends at the time timestampi.
6. Zigzag Conversion
354. Russian Doll Envelopes
326. Power of Three
2561. Rearranging Fruits
Description
You are given a replacements mapping and a text string that may contain placeholders formatted as %var%, where each var corresponds to a key in the replacements mapping. Each replacement value may itself contain one or more such placeholders . Each placeholder is replaced by the value associated with its corresponding replacement key.