Reverse Equivalent Pairs - Google Top Interview Questions
Problem Statement :
Consider a function rev(num) which reverses the digits of num. For example, rev(123) = 321 and rev(100) = 1. Given a list of positive integers nums, return the number of pairs (i, j) where i ≤ j and nums[i] + rev(nums[j]) = nums[j] + rev(nums[i]). Mod the result by 10 ** 9 + 7. Constraints n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 20, 2, 11] Output 7 Explanation We can have the following pairs: 1 and 1 1 and 2 1 and 11 20 and 20 2 and 2 2 and 11 11 and 11 Example 2 Input nums = [2, 2] Output 3 Explanation We can have the following pairs: 2 and 2 (nums[0] and nums[0]) 2 and 2 (nums[0] and nums[1]) 2 and 2 (nums[1] and nums[1]) Example 3 Input nums = [4, 10, 10] Output 4
Solution :
Solution in C++ :
int rev_num(int n) {
int res = 0;
while (n > 0) {
res = res * 10 + n % 10;
n /= 10;
}
return res;
}
int solve(vector<int>& nums) {
unordered_map<int, int> mp;
int cnt = 0;
for (int& i : nums) cnt = (cnt + ++mp[i - rev_num(i)]) % (int)(1e9 + 7);
return cnt;
}
Solution in Java :
import java.util.*;
class Solution {
private static final int MOD = (int) 1e9 + 7;
public int solve(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
int res = 0;
for (int i : nums) {
int my = i - getReverse(i);
int prev = map.getOrDefault(my, 0);
res = (res + prev) % MOD;
map.put(my, (prev + 1) % MOD);
}
return res + nums.length;
}
private StringBuilder sb = new StringBuilder();
private int getReverse(int num) {
sb.setLength(0);
return Integer.parseInt(sb.append(num).reverse().toString());
}
}
Solution in Python :
class Solution:
def solve(self, nums):
freq = defaultdict(int)
ans = 0
for val in nums:
signature = val - int(str(val)[::-1])
freq[signature] += 1
ans += freq[signature]
return ans % (10 ** 9 + 7)
View More Similar Problems
Find Merge Point of Two Lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share
View Solution →Inserting a Node Into a Sorted Doubly Linked List
Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function
View Solution →Reverse a doubly linked list
This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.
View Solution →Tree: Preorder Traversal
Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's
View Solution →Tree: Postorder Traversal
Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the
View Solution →Tree: Inorder Traversal
In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func
View Solution →