Topic Replies Activity
Is there any other optimize solution for the question 2 June 1, 2020
Where do we submit the assingment? 2 June 1, 2020
Piyush and magical brick 1 June 1, 2020
Piyush and magical brick 2 June 1, 2020
Wrong Answer for k>=n 2 June 1, 2020
Does my logic for this question is corrct? 5 June 1, 2020
Code not working fine 1 June 1, 2020
Not passing even a single test case 2 June 1, 2020
645 div2 problem c (codeforces) 4 June 1, 2020
Please check my code 5 June 1, 2020
644 div3 problem D (buying shovel) codeforces 3 June 1, 2020
Lower bound and upper bound 3 June 1, 2020
Deepak and Primes 8 June 1, 2020
DIJKSTRA'S ALGORITHM 4 June 1, 2020
Count is showing 1, mistake in program 3 June 1, 2020
Https://ide.codingblocks.com/s/234073 4 June 1, 2020
Testcases not passing 2 June 1, 2020
Why is there a segmentation fault in the code? 5 June 1, 2020
1 test case is wrong 3 June 1, 2020
Regarding n queen 3 June 1, 2020
Hey is question me return type boolean kia aur phir return true ya false kr rhe hain 5 June 1, 2020
Funky chessboard 3 June 1, 2020
Why isnt this working 3 June 1, 2020
What is the question trying to explain? 2 June 1, 2020
Book Allocation 2 June 1, 2020
Generate Subsets using Bit masking 5 June 1, 2020
Q3. Vector STL#3 Predict the time complexity of the following recursive function, given the vector is of size N and the initial call is calSum(v, 0). int sum = 0; void calcSum(vector v, int i) { if(i == v.size()) return; sum += v[i]; calcSum(v, i+1); } 1 June 1, 2020
Test Case Not Passing 1 June 1, 2020
Linked List Kth Node from Last 8 June 1, 2020
Pascal triangle pattern 2 June 1, 2020