Please use this thread to discuss the problems of CodeAgon 2019.
Q1 : Represent N as sum of minimum numbers ending with 9. eg 28 = 19 + 9, 27 = 9 + 9 + 9.
Q2: Make frequency of each digit even and minimize the last — first deleted numbers index difference.
Q3: Maximum diameter of tree where parent of x = (x — x&(x-1) ). ie last bit unset.
Q4: array of site n, multiply or divide(if possible) by k any number of times. return minimum (MAX — Min) element of modified array.
Q5: online queries of type 1) change value of index x to v. 2) sum of all values with index <= x Q <= 1e5 x <= 1e18
Q6: return max product of size of 2 non intersecting palindromic substring. required in O(n).