1275. Find Winner on a Tic Tac Toe Game
1275. Find Winner on a Tic Tac Toe Game
Description
Tic-tac-toe is played by two players A and B on a 3 x 3 grid. The rules of Tic-Tac-Toe are:
2657. Find the Prefix Common Array of Two Arrays
2657. Find the Prefix Common Array of Two Arrays
Description
You are given two 0-indexed ** integer ** permutations A and B of length n.
2348. Number of Zero-Filled Subarrays
2348. Number of Zero-Filled Subarrays
Description
Given an integer array nums, return the number of subarrays filled with 0.
1092. Shortest Common Supersequence
1092. Shortest Common Supersequence
Description
Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences . If there are multiple valid strings, return any of them.
2116. Check if a Parentheses String Can Be Valid
2116. Check if a Parentheses String Can Be Valid
Description
A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true :
2352. Equal Row and Column Pairs
2352. Equal Row and Column Pairs
Description
Given a 0-indexed n x n integer matrix grid, return the number of pairs (r<sub>i</sub>, c<sub>j</sub>) such that row r<sub>i</sub> and column c<sub>j</sub> are equal.
2558. Take Gifts From the Richest Pile
2558. Take Gifts From the Richest Pile
Description
You are given an integer array gifts denoting the number of gifts in various piles. Every second, you do the following:
2981. Find Longest Special Substring That Occurs Thrice I
2981. Find Longest Special Substring That Occurs Thrice I
Description
You are given a string s that consists of lowercase English letters.
247. Strobogrammatic Number II
247. Strobogrammatic Number II
Description
Given an integer n, return all the strobogrammatic numbers that are of length n. You may return the answer in any order .
80. Remove Duplicates from Sorted Array II
80. Remove Duplicates from Sorted Array II
Description
Given an integer array nums sorted in non-decreasing order , remove some duplicates in-place such that each unique element appears at most twice . The relative order of the elements should be kept the same .