Thu. May 30th, 2024

# Category: Coding

#### LeetCode – BackTracking – Letter Case Permutation

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:…

#### LeetCode – Strings – Search Suggestions System

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…

#### LeetCode – Strings – Check If a String Can Break Another String

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…

#### LeetCode – Strings – Consecutive Characters

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…

#### LeetCode – Arrays – Number of Equivalent Domino Pairs

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…

#### LeetCode – Arrays – Winner in Tic Tac Toe

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…

#### LeetCode – Arrays – Distance between Bus Stops

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…

#### LeetCode – Strings – Destination City

You are given the array paths, where paths = means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any…

#### LeetCode – Strings – String Matching in an Array

Given an array of string words. Return all strings in words which is substring of another word in any order. String words is substring of words, if can be obtained…

#### LeetCode – Strings – Maximum Score After Splitting a String

Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring). The score after splitting…