Uncategorized


Topic Replies Activity
You have to given an array A of size N. Find all the elements which appear more than floor(N/3) times in the given array. There is a condition that you have to do your job in O(N) time complexity and O(1) space complexity. 1<=N<=10^7 0<=Ai<=10^9 3 June 14, 2020
Deepak and his journey 5 June 14, 2020
Print all nodes at a distance k from a given node 16 June 14, 2020
Deepak and his journey(greedy) 5 June 14, 2020
Range Xor Problem 3 June 14, 2020
Althogh giving correct output but not passing testcase 8 June 14, 2020
Can eclipse IDE be used for Java Swing? 2 June 14, 2020
Can you point out my faults 6 June 14, 2020
Anybase to Anybase 2 June 14, 2020
Reverse Stack Using 1 Extra Stack 5 June 14, 2020
Not understanding 2 June 14, 2020
Two test cases not passing 3 June 14, 2020
Solutiion related doubt 3 June 14, 2020
Counting Sort Question 5 June 14, 2020
Modular Exponentiation 2 June 14, 2020
Programming issue 2 June 14, 2020
Didn't understand the transition 3 June 14, 2020
Https://ide.codingblocks.com/s/257776 3 June 14, 2020
Replace sum with greater nodes 6 June 14, 2020
Please reply if it is 3 June 14, 2020
Modular Exponentiation 3 June 14, 2020
Where m i going wrong? 3 June 14, 2020
Output Mismatch 3 June 14, 2020
Code Not Working 3 June 14, 2020
Tree bottom view 3 June 14, 2020
Recurrence relation 10 June 14, 2020
Question 7 of quiz 5 June 14, 2020
Getting Incorrect Output 3 June 14, 2020
About backtracking 7 June 14, 2020
Is this the original way how to color in paint? 3 June 14, 2020