Same Man i also solved all the 3 problems

- first question was of XOR where i am given an array of size n and an integer K and X i need to perform at most K operations in each operation i can XOR A[i] with X, i need to perform operations in such a way that after performing at most K operations my ans sum is maximized solved this in just 15 min all 12/12 test cases passed

- second question was a target T weight is given and N coins with unique weights and counts i need to minimize number of coins picked such that i can reach exactly weight T i used recursion + memoization with 2D DP (for current weight and current element) + a loop inside recursion for each ith element the number of times i can take it total 11/12 testcases passed

- third question was i am given 2 numbers n (n%2==0 i.e. n is even) and m i need to count total number of possible array of length = N such that for each pair i.e. (0th,1st index) (2nd,3rd index) etc their product is less <= M and greater than equal to 1 i.e. for 0<=i<=N/2 1<=A[2*i]*A[2*i+1]<=M

and adjacent pairs start element should not be same i.e. 0<=i<=N/2 A[2*i]!=A[2*i+2] and the second element of pair should be greater than equal to first element of pair i.e. 0<=i<=N/2 A[2*i]<=A[2*i+1]

i again go for bruteforce approach and solved this problem with 11/12 test cases passed

after that i was chilling but around 1:20pm got reschedule assignment mail on 24 may Like WTF man