Can you solve this real interview question? Count Good Numbers - A digit string is good if the digits (0-indexed) at even indices are even and the digits at odd indices are prime (2, 3, 5, or 7). * For example, "2582" is good because the digits (2 and
0-indexedinteger arraynumsof lengthnand an integerk, returnthenumber of pairs(i, j)such that: 0 <= i < j <= n - 1and nums[i] * nums[j]is divisible byk. Example 1: Input:nums = [1,2,3,4,5], k = 2Output:7Explanation:The 7 pairs of indices whose corresponding products are...
A set of practice note, solution, complexity analysis and test bench to leetcode problem set - leetcode/CountSubArrayFixBound.drawio at b58bcceb0ea27d0756ad72fb6a64b3b547fae221 · brianchiang-tw/leetcode
classSolution {///Fenwick Tree//vector<int>ft;voidupdate(inti,intx) {if((i +1) > ft.size())return;for(; i < ft.size(); i += (i & -i)) ft[i]+=x; }intquery(inti) { i= min(i,int(ft.size() -1));ints =0;for(; i >0; i -= (i & -i)) s+=ft[i];returns...