


188 Questions
0
votes
0
answers
34
views
getting tle in "Enjoy Sum with Operations" SPOJ
2 days ago
671●11●47
0
votes
1
answer
103
views
How to solve road repair problem from SPOJ?
11 Apr, 23:20
671●11●47
0
votes
2
answers
196
views
Why I am getting wrong ans in this simple problem of segment tree.
24 Mar, 12:58
671●11●47
0
votes
0
answers
47
views
How to solve "New reform" problem form codeforces?
24 Mar, 12:56
671●11●47
0
votes
1
answer
76
views
How does segment tree work for array size that is not power of 2?
23 Mar, 11:08
12.6k●1●4●25
0
votes
2
answers
153
views
Can anyone please this doubt about segment tree?
19 Mar, 07:44
41●4
0
votes
0
answers
70
views
Can anyone help, getting wrong in SPOJ's road network problem?
18 Mar, 08:57
671●11●47
0
votes
1
answer
88
views
Getting NZEC in SPATH SPOJ.
15 Mar, 10:00
671●11●47
0
votes
0
answers
82
views
What could be the more efficient way of solving the 'sequence land' problem?
11 Mar, 10:04
671●11●47
0
votes
0
answers
93
views
Getting WA in Wealth Disparity?
09 Mar, 08:44
671●11●47
0
votes
1
answer
101
views
Problem in solving " LAZYPROG  The lazy programmer " from spoj.
03 Mar, 16:44
256●7
0
votes
0
answers
174
views
0
votes
5
answers
947
views
Problem in understanding tourist editorial
27 Feb, 19:26
671●11●47
0
votes
2
answers
195
views
Difficulty in understanding the problem Matched Brackets
27 Feb, 11:45
56●3
0
votes
1
answer
174
views
Getting NZEC in solving LVADER problem from spoj
27 Feb, 06:50
671●11●47
31 Answers
43 Votes
33  10 
50 Tags
algorithm
× 241 datastructure × 85 array × 82 graph × 65 dynamicprogramming × 60 optimization × 54 editorial × 51 dps × 50 codechef × 43 modulo × 41 
numbertheory
× 38 java × 35 xor × 30 shortestpath × 21 combinatorics × 19 admin × 18 heap × 17 sieve × 17 hashing × 17 string × 16 
easy
× 16 dijkstra × 16 sorting × 15 query × 15 greedy × 14 adhoc × 14 nzec × 13 hackerearth × 13 c++ × 13 tle × 13 
ratings
× 12 stack × 12 combinations × 12 parentheses × 12 admins × 11 segmenttree × 11 maximumproduct × 11 subarray × 11 strings × 11 minimum × 11 
snckql17
× 10 binarysearch × 10 bit × 10 ide × 9 search × 9 bfs × 9 decembercookoff × 9 complexity × 9 stl × 9 factors × 9 