| Problem | Submit Count | Reading & Thinking(mins) | Coding(mins) | Debugging(mins) | Tags |
|---|---|---|---|---|---|
| CF 602/B Approximating a Constant Range | 2 | 6 | 13 | 2 | two pointers |
| CF 584/B Kolya and Tanya | 1 | 23 | 2 | 0 | combinatorics |
| CF 236/B Easy Number Challenge | 3 | 13 | 20 | 26 | number theory |
| CF 617/B Chocolate | 2 | 10 | 7 | 0 | brute force |
| CF 550/B Preparing Olympiad | 1 | 10 | 9 | 0 | bitmasks |
| CSES 1143 Hotels | 1 | 230 | 15 | 0 | segment tree |
| CF 505/B Mr. Kitayuta's Colorful Graph | 1 | 12 | 14 | 0 | dfs, bfs |
| CF 550/C Divisibility by Eight | 1 | 200 | 16 | 0 | dp, math |
| CF 277/A Learning Languages | 3 | 12 | 15 | 3 | dfs |
| CSES 1158 Book Shop | 1 | 20 | 8 | 2 | dp |
| CSES 1073 Towers | 1 | 7 | 8 | 0 | binary search tree |
| CSES 1084 Apartments | 1 | 70 | 6 | 0 | sort, two pointers |
| codejam 2017 R1C/A Ample Syrup | 1 | 18 | 15 | 0 | sort |
| CF 474/D Flowers | 1 | 12 | 9 | 0 | dp |
| CF 2/A Winner | 8 | 8 | 8 | 42 | brute force |
| CSES 1092 Two Sets | 1 | 25 | 4 | 0 | math |
| CF 414/B Mashmokh and ACM | 1 | 86 | 3 | 15 | dp |
| CF 431/C k-Tree | 1 | 65 | 12 | 0 | dp |
| UVA 850 Crypt Kicker II | 2 | 30 | 20 | 2 | string |
| CF 580/B Kefa and Company | 2 | 17 | 8 | 1 | two pointers |
| AT abc117/C Streamline | 1 | 36 | 7 | 0 | sorting |
| UVA 10252 Common Permutation | 2 | 2 | 8 | 7 | string |
| CF 580/C Kefa and Park | 1 | 11 | 11 | 0 | dfs |
| CF 466/C Number of Ways | 5 | 10 | 30 | 70 | math |
| CF 550/A Two Substrings | 4 | 12 | 5 | 10 | brute force |
| CF 4/C Registration system | 1 | 5 | 3 | 0 | brute force |
| CF 158/B Taxi | 2 | 13 | 13 | 3 | greedy |
| CF 1/B Spreadsheets | 3 | 18 | 30 | 19 | math |
| LC 647 Palindromic Substrings | 1 | 9 | 16 | 0 | dp & string |
| CF 455A Boredom | 3 | 13 | 7 | 3 | dp |
| LC 406 Queue Reconstruction by Height | 1 | 13 | 10 | 0 | greedy |
| CF 415/B Mashmokh and Tokens | 1 | 13 | 4 | 0 | greedy |
| CF 376/B I.O.U. | 1 | 10 | 7 | 0 | brute force |