_1790.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1790 {
publicstaticclassSolution1 {
publicbooleanareAlmostEqual(Strings1, Strings2) {
if (s1.equals(s2)) {
returntrue;
 }
for (inti = 0; i < s1.length(); i++) {
for (intj = 0; j < i; j++) {
StringnewS1 = swap(s1, i, j);
if (newS1.equals(s2)) {
returntrue;
 }
 }
 }
returnfalse;
 }

privateStringswap(Stringstr, inti, intj) {
charc = str.charAt(i);
StringBuildersb = newStringBuilder(str);
sb.replace(i, i + 1, str.charAt(j) + "");
sb.replace(j, j + 1, "" + c);
returnsb.toString();
 }
 }
}