From 70a66fc130d4031fb4275f471be4b9bb3b95c11b Mon Sep 17 00:00:00 2001 From: 33Arsenic75 <122697564+33Arsenic75@users.noreply.github.com> Date: Wed, 26 Jun 2024 21:27:38 +0530 Subject: [PATCH] . --- problem-of-the-day/day26/{dsa (9).md => dsa.md} | 0 problem-of-the-day/day27/dsa.md | 15 +++++++++++++++ 2 files changed, 15 insertions(+) rename problem-of-the-day/day26/{dsa (9).md => dsa.md} (100%) create mode 100644 problem-of-the-day/day27/dsa.md diff --git a/problem-of-the-day/day26/dsa (9).md b/problem-of-the-day/day26/dsa.md similarity index 100% rename from problem-of-the-day/day26/dsa (9).md rename to problem-of-the-day/day26/dsa.md diff --git a/problem-of-the-day/day27/dsa.md b/problem-of-the-day/day27/dsa.md new file mode 100644 index 0000000..2427a06 --- /dev/null +++ b/problem-of-the-day/day27/dsa.md @@ -0,0 +1,15 @@ + +# DSA Problem of the Day (26/06/2024) + +## Matrix Exponentiation and Misclenous Problems +Today we learn about Matrix Exponentiation and solve some problems related to it. + +## Resources +1. [Matrix Exponentiation](https://usaco.guide/plat/matrix-expo?lang=cpp) + +## Problems +1.[Minimum Maximum Distance](https://codeforces.com/problemset/problem/1881/F) :- Try comparing this to finding the diamater of a tree, and also try to solve it using tree-re rooting +2. [Graph Paths I](https://cses.fi/problemset/task/1723) +3. [Xor-sequences](https://codeforces.com/contest/691/problem/E) + +*Note:* Solutions to [day26](../day26) are uploaded.