Mastering competitive programming
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9788193754306
- 005.1 NAR-M
Contents:
1 Generic Programming & STL
2 Mathematics
3 Number Theory
4 Binary Search (Divide & Conquer)
5 Greedy Algorithms
6 Recursion & Backtracking Segment Tree (Divide & Conquer)
7 Binary Indexed Tree/Fenwick Tree
8 Binary Indexed Tree/Fenwick Tree
9 Dynamic Programming
10 MO's Algorithm
11 Graph Algorithms
12 Game Theory
13 Geometric Algorithms
14 Fast Fourier Transform
15 Heavy Light Decomposition (HLD)
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
![]() |
IIITD General Stacks | Computer Science and Engineering | 005.1 NAR-M (Browse shelf(Opens below)) | Checked out Not for loan | Gifted by Dr. Rahul Gupta | 08/07/2024 | G02443 |
Total holds: 0
Browsing IIITD shelves, Shelving location: General Stacks, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.1 MOT-R Randomized algorithms | 005.1 MOT-R Randomized algorithms | 005.1 NAP-B Beginning flutter : | 005.1 NAR-M Mastering competitive programming | 005.1 NEA-F Foundations of algorithms | 005.1 NEW-B Building microservices : designing fine-grained systems | 005.1 OGG-G Git : |
1 Generic Programming & STL
2 Mathematics
3 Number Theory
4 Binary Search (Divide & Conquer)
5 Greedy Algorithms
6 Recursion & Backtracking Segment Tree (Divide & Conquer)
7 Binary Indexed Tree/Fenwick Tree
8 Binary Indexed Tree/Fenwick Tree
9 Dynamic Programming
10 MO's Algorithm
11 Graph Algorithms
12 Game Theory
13 Geometric Algorithms
14 Fast Fourier Transform
15 Heavy Light Decomposition (HLD)
There are no comments on this title.