lettcodeQ

Question 1

249. Group Shifted Strings
     We can shift a string by shifting each of its letters to its successive letter.

For example, “abc” can be shifted to be “bcd”.
We can keep shifting the string to form a sequence.

For example, we can keep shifting “abc” to form the sequence: “abc” -> “bcd” -> … -> “xyz”.
Given an array of strings strings, group all strings[i] that belong to the same shifting sequence. You may return the answer in any order.

Example 1:

Input: strings = [“abc”,”bcd”,”acef”,”xyz”,”az”,”ba”,”a”,”z”]
Output: [[“acef”],[“a”,”z”],[“abc”,”bcd”,”xyz”],[“az”,”ba”]]

Answer 1

std::stringstream ss;

ss<

Question 2

438. Find All Anagrams in a String
     Given two strings s and p, return an array of all the start indices of p’s anagrams in s. You may return the answer in any order.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

Input: s = “cbaebabacd”, p = “abc”
Output: [0,6]

Answer 2

vector hashs(26,0), hashp(26,0)