1664. Ways to Make a Fair Array
1664. Ways to Make a Fair Array
Description
You are given an integer arraynums. You can choose exactly one index (0-indexed ) and remove the element. Notice that the index of the elements may change after the removal.
1790. Check if One String Swap Can Make Strings Equal
1790. Check if One String Swap Can Make Strings Equal
Description
You are given two strings s1 and s2 of equal length. A string swap is an operation where you choose two indices in a string (not necessarily different) and swap the characters at these indices.
859. Buddy Strings
1268. Search Suggestions System
1268. Search Suggestions System
Description
You are given an array of strings products and a string searchWord.
1347. Minimum Number of Steps to Make Two Strings Anagram
1347. Minimum Number of Steps to Make Two Strings Anagram
Description
You are given two strings of the same length s and t. In one step you can choose any character of t and replace it with another character .
792. Number of Matching Subsequences
792. Number of Matching Subsequences
Description
Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.
1838. Frequency of the Most Frequent Element
1838. Frequency of the Most Frequent Element
Description
The frequency of an element is the number of times it occurs in an array.