Breaking News: Grepper is joining You.com. Read the official announcement!

Robinhood coding question 1, Given an array of integers a, the task was to count the no of pairs i, j , such that a[i] and a[j] are digit anagrams. In the given time frame, this is what i wrote. Kindly excuse me for the brute force technique. Thank you.

Wrong Weasel answered on July 19, 2022 Popularity 1/10 Helpfulness 1/10

answer Robinhood coding question 1, Given an array of integers a, the task was to count the no of pairs i, j , such that a[i] and a[j] are digit anagrams. In the given time frame, this is what i wrote. Kindly excuse me for the brute force technique. Thank you.

Robinhood coding question 1, Given an array of integers a, the task was to count the no of pairs i, j , such that a[i] and a[j] are digit anagrams. In the given time frame, this is what i wrote. Kindly excuse me for the brute force technique. Thank you.

Comment

long solution(int[] a) {
    long ans = 0;
    Map<List<Integer>,Integer> map = new HashMap<>();
    for(int n : a){
        List<Integer> tp = new ArrayList<>();
        while(n>0){
            int t = n%10;
            n/=10;
            tp.add(t);
        }
        Collections.sort(tp);
        if(map.containsKey(tp)){
            ans+=map.get(tp);
            map.put(tp,map.get(tp)+1);
        }
        else map.put(tp,1);
    }
    return ans;
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: brute-force count digit j task this time was whatever

Link to this answer
Share Copy Link

Contributed on Jul 19 2022

Wrong Weasel

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Robinhood coding question 1, Given an array of integers a, the task was to count the no of pairs i, j , such that a[i] and a[j] are digit anagrams. In the given time frame, this is what i wrote. Kindly excuse me for the brute force technique. Thank you.

Contents

More Related Answers

Robinhood coding question 1, Given an array of integers a, the task was to count the no of pairs i, j , such that a[i] and a[j] are digit anagrams. In the given time frame, this is what i wrote. Kindly excuse me for the brute force technique. Thank you.

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.