issues
search
pllk
/
cphb
Competitive Programmer's Handbook
2.9k
stars
345
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Feature/ tradução do capítulo 23
#104
natanlimaz
closed
1 month ago
0
updating chapter 4 and rebuilding book.pdf
#103
eng-abdelrahman-sharaf
opened
4 months ago
0
correcting efficiency comparison section (algorithm 2 is the fastest ✅)
#102
eng-abdelrahman-sharaf
closed
4 months ago
0
editing algorithm measurements ( O(n) is faster than O(nlogn) )
#101
eng-abdelrahman-sharaf
closed
4 months ago
0
Fix error in chapter 27
#100
abdirakhman
closed
8 months ago
1
20230731 revise
#99
recuraki
closed
9 months ago
0
Bubble sort code fix
#98
zyluo
opened
1 year ago
0
Bubble sort code typo
#97
zyluo
opened
1 year ago
0
Since this book is paired with cses.fi, more string algorithms should be mentioned (Aho Corasick, suffix automaton, KMP)
#96
mhayter
opened
1 year ago
0
[Suggestion] Add a 5th number of the arithmetic sum example
#95
dhern023
opened
1 year ago
0
Recurakiedit
#94
recuraki
closed
2 years ago
1
Fix typo
#93
diffuse
opened
2 years ago
0
Recurakiedit
#92
recuraki
closed
2 years ago
1
21.3 Logic needs an explanation
#91
Zeks
opened
2 years ago
0
Minor typo - Fix node number for bellman ford example
#90
prashant11235
opened
2 years ago
0
Errors in Chapter 13
#89
pllk
opened
2 years ago
1
Correct threshold in the scaling method
#88
matklad
opened
2 years ago
0
Bellman-Ford example has a typo
#87
vlahovivan
opened
2 years ago
1
Fix Minor Typo
#86
christopher-besch
opened
3 years ago
0
Chapter 13: Constant Time Lookup of Next Node
#85
christopher-besch
opened
3 years ago
2
Fix macro in chapter 1
#84
hltk
opened
3 years ago
0
Can't compile with `latexmk`
#83
ajilk
closed
3 years ago
0
Improve the performance of the "find" function from the Union-Find Data Structure
#82
ZhongxuanWang
opened
3 years ago
1
Update definition of "Maximum subarray problem"
#81
funnydman
opened
3 years ago
0
Chapter 15: Minor Typo in Footnote
#80
Ishan-Dubey
opened
3 years ago
1
Suggestion for Section - 5.4 Pruning the Search
#79
technusm1
opened
4 years ago
2
Search Code on Page 47 is unnecessarily confusing
#78
wiggles35
opened
4 years ago
0
Time complexity to generate table for logK lookup of K succesor of node n
#77
dpasiukevich
closed
4 years ago
1
Update PDF link on https://cses.fi/book/index.php
#76
odv
opened
4 years ago
0
Is this book available in print?
#75
olavfosse
closed
4 years ago
2
Fix for max subarray sum
#74
nzhiltsov
closed
4 years ago
1
Chapter 13: Bellman-Ford negative cycle example
#73
hieudoan7
opened
4 years ago
0
Citation of this book
#72
EAR-Development
closed
5 years ago
1
Updated pdf
#71
wilfreddesert
closed
5 years ago
2
Convert (x - c) >= 0 to x >= c
#70
hungptit
opened
5 years ago
0
sheduling
#69
dcrystalj
opened
5 years ago
1
Properly sized brackets in Chapter 7 formula
#68
ollpu
opened
5 years ago
0
Chapter 03: Typo at lines 90-91
#67
arambekverdyan
closed
5 years ago
1
Fix minor typo
#66
yeenow123
opened
5 years ago
0
Create README.md
#65
Salil03
opened
5 years ago
0
A few humble suggestions
#64
Salil03
opened
5 years ago
0
Increasing Subsequence limit
#63
darbula
closed
5 years ago
1
Floyd's algorithm (chapter 16.4)
#62
checktor
opened
5 years ago
0
Elevator example in 10.5
#61
traxex2
closed
6 years ago
0
Bellman-Ford example
#60
pllk
closed
6 years ago
3
Typo on chapter06
#59
alessandro-bugatti
closed
6 years ago
1
Maximum subarray sum wrong initialization
#58
alessandro-bugatti
closed
6 years ago
2
Time complexity in the 'meet in the middle' example
#57
alessandro-bugatti
closed
6 years ago
1
Unisigned and 2^n-1
#56
darbula
closed
6 years ago
0
Overflow modpow
#55
darbula
closed
6 years ago
0
Next