package leetcode;

/**
 * https://leetcode.com/problems/groups-of-special-equivalent-strings/
 */
public class Problem893 {
    public int numSpecialEquivGroups(String[] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {

    }
}

@@ -254,16 +254,471 @@
 args) %7B%0A
+        Problem893 prob = new Problem893();%0A        System.out.println(prob.numSpecialEquivGroups(new String%5B%5D%7B%22a%22,%22b%22,%22c%22,%22a%22,%22c%22,%22c%22%7D)); // 3%0A        System.out.println(prob.numSpecialEquivGroups(new String%5B%5D%7B%22aa%22,%22bb%22,%22ab%22,%22ba%22%7D)); // 4%0A        System.out.println(prob.numSpecialEquivGroups(new String%5B%5D%7B%22abc%22,%22acb%22,%22bac%22,%22bca%22,%22cab%22,%22cba%22%7D)); // 3%0A        System.out.println(prob.numSpecialEquivGroups(new String%5B%5D%7B%22abcd%22,%22cdab%22,%22adcb%22,%22cbad%22%7D)); // 1
 %0A    %7D%0A%7D

Update problem 893