Hi guys!

Problem Link : 1923C - Find B Submission : 248005674

My approach :

I have tried to calculate the minimum possible sum of subarray for every query range and compared it with actual sum of the subarray using prefix sum , My code passes sample test case but I'm unable to figure out why it is showing wrong answer for hidden testcases . Can anyone help me with this ?

problem link : https://leetcode.com/problems/number-of-visible-people-in-a-queue/ approach for the above mentioned question when duplicates are allowed

eg test case : 11 6 7 5 11 11 o/p : 3 2 2 1 1 0

1472B - Fair Division :|

What are some good problems involving xor techniques and concepts, on codeforces or any other site. difficulty range <=2300.

Thanks.