Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If string A and string B contain the same characters, they are called “brother string”.
for example: “abc” and “cab”, “aabb” and “baab”.
The question is how to check if two strings are brother string(fast)?
Sort them then compare, or keep a count of each character in a map of some sort then compare counts at the end.