Given a string, we can shift each of its letter to its successive letter, for example: abc gt bcd . We can keep shifting which forms the sequence: Given a list of strings which contains only lowercas ...
2016-02-21 12:51 2 10766 推荐指数：
You are given an array `A` of strings. Two strings S and T are special-equivalent if after any number of moves, S == T. A move consists ...
Given two non-negative integers num1 and num2represented as strings, return the product of num1 and num2, also represented as a string. Example ...
Given two strings `A` and `B` of lowercase letters, return `true` if and only if we can swap two letters in `A` so that the result equals `B ...
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. ...
Given a list of strings, you could concatenate these strings together into a loop, where for each string you could choose to reverse it or not. ...
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and nu ...
You are given two strings s1 and s2 of equal length consisting of letters "x" and "y" only. Your task is to make these two strings equal to each ...
Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original ...
