Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Determine if Two Strings Are Close
Bookmark
Brute Force
Frequency Sort
Input
Close (swap)
Diff length
Close (transform)
Diff chars
Custom
word1
=
abc
,
word2
=
bca
word1
a
b
c
word2
b
c
a
word1
a
b
c
word2
b
c
a
word1
a
b
c
word2
b
c
a
word1
a
b
c
word2
b
c
a
count1
1
a
1
b
1
c
count2
1
a
1
b
1
c
word1
a
b
c
word2
b
c
a
count1
1
a
1
b
1
c
count2
1
a
1
b
1
c
checking this arrangement against count2
word1
a
b
c
word2
b
c
a
count1
1
a
1
b
1
c
count2
1
a
1
b
1
c
word1
a
b
c
word2
b
c
a
count1
1
a
1
b
1
c
count2
1
a
1
b
1
c
close
algo
master
.
io
Step:
Start: can "abc" be turned into "bca"?
0 / 5
Input
Close (swap)
Diff length
Close (transform)
Diff chars
Custom
word1
=
abc
,
word2
=
bca
0 / 5
algo
master
.
io
Step:
Start: can "abc" be turned into "bca"?
