


25 Questions
0
votes
1
answer
159
views
Codeforces Beta Round Dynamic Programming Problem
04 Dec '18, 23:25
69●6
0
votes
2
answers
503
views
Action against contest organizer
21 Oct '18, 14:44
69●6
0
votes
0
answers
58
views
same code giving runtime error and then wrong answer.
19 Oct '18, 12:31
69●6
0
votes
2
answers
121
views
need help in FLIPCOIN segment tree problem on CODECHEF
05 Oct '18, 01:00
69●6
0
votes
1
answer
228
views
need some problems to practice on segment trees
01 Oct '18, 14:20
69●6
0
votes
1
answer
208
views
help needed in hackerearth segment tree problem
30 Sep '18, 20:08
69●6
0
votes
0
answers
292
views
Codeforces Round 512 DIV2 ProblemC help
24 Sep '18, 14:42
69●6
0
votes
2
answers
129
views
Need help/advice for programming
16 Jun '18, 21:40
59●4
0
votes
3
answers
256
views
krillin is dead help
16 Jun '18, 09:56
201●3
0
votes
1
answer
125
views
help needed in optimisation for a problem
05 Jun '18, 19:28
946●1●15
0
votes
2
answers
121
views
help needed in TRIPLETS
01 Jun '18, 22:47
153●6
0
votes
1
answer
109
views
fibonaaci sequence fast exponentiation doubt
30 May '18, 21:50
69●6
0
votes
1
answer
77
views
help needed in leetcode problem
30 May '18, 19:11
307●7
0
votes
1
answer
118
views
help required in spoj problem KGSS
20 May '18, 19:46
69●6
0
votes
1
answer
123
views
need help in spoj problem on segment tree GSS1
19 May '18, 20:21
69●6
17 Answers
33 Votes
33  0 
50 Tags
segmenttree
× 19 help × 11 contest × 9 sorting × 8 simple × 7 spoj × 7 lazypropagation × 6 array × 6 strings × 5 math × 4 
hackerearth
× 4 leetcode × 4 heap × 4 action × 4 punishment × 4 anagram × 3 editorial × 3 triplets × 3 easy × 3 codeforces × 3 
april18
× 3 yvnum × 2 cook101b × 2 modulus × 2 cookoff × 2 gss1 × 2 fastexpo × 2 suggestion × 2 dynamicprogramming × 2 beginner × 2 
advice
× 2 medium × 2 feb18 × 2 cook101 × 2 modular × 2 queries × 1 convexpolygon × 1 poinpoly × 1 epsilon × 1 optimization × 1 
string
× 1 simpleeasy × 1 euler × 1 linkedlist × 1 triangle × 1 constructive × 1 broclk × 1 avgpr × 1 permutation × 1 median × 1 