Given a string s, return the number of unique non-empty substrings of s that are present in the infinite wraparound string ‘abcdefghijklmnopqrstuvwxyz’.
Given an array of binary strings strs and two integers m and n, return the size of the largest subset of strs such that there are at most m zeros and n ones in the subset.
A magical string consists of only ‘1’ and ‘2’ and follows a special rule: the number of consecutive occurrences of characters ‘1’ and ‘2’ generates the string itself. Given an integer n, return the number of ‘1’s in the first n characters of the magical string.
Given a string s, return the length of the longest palindromic subsequence in s. A subsequence is a sequence derived by deleting some or no elements without changing the order of the remaining elements.
We define the correct usage of capital letters in a word as either all letters being capitalized, all letters being lowercase, or only the first letter being capitalized while the rest are lowercase. Given a string word, return true if the word follows one of these patterns, and false otherwise.
Given an array of strings strs, determine the length of the longest uncommon subsequence between them. An uncommon subsequence is a string that is a subsequence of one string but not the others. If no such subsequence exists, return -1.
