CodePythonJava

JAVA class Solution { public int[] queryResults(int limit, int[][] queries) { Map<Integer, Integer> g = new HashMap<>(); Map<Integer, Integer> cnt = new HashMap<>(); int m = queries.length; int[] ans = new int[m]; for (int i = 0; i < m; ++i) { int x = queries[i][0], y = queries[i][1]; cnt.merge(y, 1, Integer::sum); if (g.containsKey(x) && cnt.merge(g.get(x), -1, Integer::sum) == 0) { cnt.remove(g.get(x)); } g.put(x, y); ans[i] = cnt.size(); } return ans; } } C++ class Solution { public: vector<int> queryResults(int limit, vector<vector<int>>& queries) { unordered_map<int, int> g; unordered_map<int, int> cnt; vector<int> ans; for (auto& q : queries) { int x = q[0], y = q[1]; cnt[y]++; if (...

Given an array  nums  of  distinct  positive integers, return  the number of tuples  (a, b, c, d)  such that  a * b = c * d  where  a ,  b ,  c , and  d  are elements of  nums , and  a != b != c != d . Example 1: Input: nums = [2,3,4,6] Output: 8 Explanation: There are 8 valid tuples: (2,6,3,4) , (2,6,4,3) , (6,2,3,4) , (6,2,4,3) (3,4,2,6) , (3,4,2,6) , (3,4,6,2) , (4,3,6,2) Example 2: Input: nums = [1,2,4,5,10] Output: 16 Explanation: There are 16 valids tuples: (1,10,2,5) , (1,10,5,2) , (10,1,2,5) , (10,1,5,2) (2,5,1,10) , (2,5,10,1) , (5,2,1,10) , (5,2,10,1) (2,10,4,5) , (2,10,5,4) , (10,2,4,5) , (10,2,4,5) (4,5,2,10) , (4,5,10,2) , (5,4,2,10) , (5,4,10,2) Example 3: Input: nums = [2,3,4,6,8,12] Output: 40 Example 4: Input: nums = [2,3,5,7] Output: 0 Constraints: 1 <= nums.length <= 1000 1 <= nums[i] <= 10^4 All elements in  nums  are  distinct . Solution Loop over all pairs of ...

You are given two strings  s1  and  s2  of equal length. A  string swap  is an operation where you choose two indices in a string (not necessarily different) and swap the characters at these indices. Return  true   if it is possible to make both strings equal by performing  at most one string swap  on  exactly one  of the strings . Otherwise, return  false . Example 1: Input:  s1 = “bank”, s2 = “kanb” Output:  true Explanation:  For example, swap the first character with the last character of s2 to make “bank”. Example 2: Input:  s1 = “attack”, s2 = “defend” Output:  false Explanation:  It is impossible to make them equal with one string swap. Example 3: Input:  s1 = “kelb”, s2 = “kelb” Output:  true Explanation:  The two strings are already equal, so no string swap operation is required. Example 4: Input:  s1 = “abcd”, s2 = “dcba” Output:  false Constraints: 1 <= s...