|
Wrong answer for point of intersection
|
3
|
January 29, 2022
|
|
This compiler is giving wrong answer
|
6
|
January 28, 2022
|
|
First negative integer in every window of size k
|
3
|
January 28, 2022
|
|
Explain what is sub-Activity
|
1
|
January 28, 2022
|
|
View.onClickListener
|
1
|
January 28, 2022
|
|
Please provide a hint
|
3
|
January 28, 2022
|
|
Coversion Any to Any
|
3
|
January 28, 2022
|
|
Chewbacca Problem
|
3
|
January 28, 2022
|
|
Replace Number them all
|
7
|
January 28, 2022
|
|
Kartik bhaiya and celebrity problem
|
3
|
January 28, 2022
|
|
Aggtresive cows doubt
|
3
|
January 28, 2022
|
|
Piyush and magic block problem
|
10
|
January 28, 2022
|
|
Doubt in bool compare
|
4
|
January 28, 2022
|
|
Structurally identical
|
6
|
January 28, 2022
|
|
Maximum bitonic array problem
|
6
|
January 28, 2022
|
|
Why is my approach leading to a segmentation fault
|
4
|
January 28, 2022
|
|
My code seems correct but still is showing error for two cases
|
4
|
January 28, 2022
|
|
Why the program is failing all the test cases?
|
3
|
January 28, 2022
|
|
Code feels completely perfect but still one case is showing error
|
6
|
January 28, 2022
|
|
I am not able to print 1 path and can you tell how to pass 2d array call by reference
|
10
|
January 28, 2022
|
|
Doubt in updating the loop:
|
3
|
January 28, 2022
|
|
My code is getting stuck in one case. Please help me in rectifying my code. Kindly suggest the logic which I should implement and add or change in my code
|
4
|
January 28, 2022
|
|
This code is giving segmentation fault
|
4
|
January 28, 2022
|
|
Output shows "not prime" regardless of the input given
|
7
|
January 28, 2022
|
|
Tricky permutation doubt
|
5
|
January 28, 2022
|
|
Strings- odd even characters
|
2
|
January 28, 2022
|
|
TLE in test case 1
|
6
|
January 28, 2022
|
|
Failing test cases 1 and 2
|
3
|
January 28, 2022
|
|
Recursion sorted array doubt
|
6
|
January 28, 2022
|
|
I have cracked the code nd got 114 as output i m missing the number 8... exactly which logic i am missing code- while(i<s1 && j<s2){ sum1+=x[i]; sum2+=y[j]; if(x[i]==y[j]){ fsum+=max(sum2,sum1); sum1=0; sum2=0; } i++; j++; } fsum+=max(sum2,sum1);
|
4
|
January 28, 2022
|
