Problem: Count substrings starting with a vowel in a given string, modulo 10003. Solution: public class Solution { public int solve(String A) { int count = 0; char vowels[] = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'}; ...
Question: Given two strings A and B, check if they can be rearranged to match (i.e., check if they are permutations of each other). Solution: import java.util.Arrays; public class Solution { public int permuteStrings(String A, String B) { ...
