Subscribe to:
Post Comments (Atom)
Labels
- All-Pairs-Shortest-Path
- Arrays
- Bellman-Ford
- binary lifting
- CLRS
- codeforces
- Competitive Programming
- Compiler Design
- constant space
- constructive
- cs231n
- databases
- deep learning
- Dijkstra
- fenwick tree
- Graphs
- InterviewBit
- Kruskal
- Machine Learning
- math
- Persistence
- Prim
- Questions
- repetition
- rlac
- Segment Tree
- sharding
- SPOJ
- Statistics
Blog Archive
- September 2024 (1)
- August 2024 (1)
- July 2024 (1)
- January 2024 (1)
- September 2023 (1)
- August 2023 (3)
- July 2023 (1)
- December 2022 (1)
- November 2022 (2)
- March 2022 (1)
- July 2021 (1)
- February 2021 (1)
- September 2020 (1)
- July 2020 (1)
- March 2020 (2)
- November 2019 (1)
- October 2019 (6)
- March 2018 (1)
- February 2018 (1)
- January 2018 (1)
- November 2017 (10)
- September 2017 (4)
- August 2017 (1)
1498C - Planar reflections
1498C - Planar reflections Problem We have a set of $n$ 2D planes. A particle comes from the left, and goes through all the planes. Initiall...
-
23.1-2 Professor Sabatier conjectures the following converse of theorem 23.1. Let $G = (V,E)$ be a connected, undirected graph with a real...
-
4.2-6[clrs]: How quickly can you multiply a $kn \times n$ matrix by an $n \times kn$ matrix, using Strassen's algorithm as a subrouti...
-
Misha and Permutations Problem statement: The problem can be found here . The gist of the problem is: You're given two permutati...
No comments:
Post a Comment