LeetCode Question · Aug 2020

Robinhood coding question 1

SWE

1 upvote 11,123 views 15 replies

Question Details

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,...

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Arrays Strings