Given an array of integers nums. A pair (i,j) is called good if nums == nums and i < j. Return the number of good pairs. Example 1: Input: nums…

Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create. Examples:…

Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after each character of searchWord…

Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa (in other words s2…

Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character. Return the power of the string. Example…

Given a list of dominoes, dominoes = is equivalent to dominoes = if and only if either (a==c and b==d), or (a==d and b==c) – that is, one domino can…

Tic-tac-toe is played by two players A and B on a 3 x 3 grid. Here are the rules of Tic-Tac-Toe: Given an array moves where each element is another…

A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance is the…