|
|
1181d6aa96
|
sum of three values
|
2024-07-22 18:11:31 +02:00 |
|
|
|
08c87b425b
|
josephus I done but II is not that easy
|
2024-06-20 20:55:11 +02:00 |
|
|
|
0846a55574
|
2D segment tree
|
2024-06-19 17:29:38 +02:00 |
|
|
|
a4335fde22
|
update range queries with seg tree
|
2024-06-18 18:01:36 +02:00 |
|
|
|
252ca707b3
|
51 problems solved
|
2024-06-15 20:56:45 +02:00 |
|
|
|
93ad8c5841
|
range queries and one graph
|
2024-06-15 11:50:15 +02:00 |
|
|
|
b67bf7bbea
|
some dp problems
|
2024-06-14 19:49:10 +02:00 |
|
|
|
3bd1aab755
|
unordered_map sometimes better than map:
got TLE with map on Collecting_Numbers_II.cpp but AC with unordered_map
-unordered is good for a lot of requests and a lot of data
|
2024-06-04 16:41:13 +02:00 |
|
|
|
7fd24571df
|
another 4 sorting and searching problems
|
2024-06-04 11:04:33 +02:00 |
|
|
|
4e39870547
|
multisets can be useful
|
2024-06-04 01:05:42 +02:00 |
|
|
|
c817cf7f3c
|
done 3 sorting problems
|
2024-06-03 16:57:59 +02:00 |
|
|
|
cf617f6dfa
|
all done but copied solution for grid paths: dfs with prune. very tedious
|
2024-06-02 14:22:00 +02:00 |
|
|
|
5f6b389ee3
|
7 more
|
2024-06-01 23:50:25 +02:00 |
|
|
|
ca126c7a0a
|
first 7 Introductory problems
|
2024-06-01 13:03:48 +02:00 |
|
