- count the number of fair pairs - — 9/13/24 -
-+ count the number of fair pairs + — 9/13/24 +
problem statement
@@ -238,16 +236,14 @@
Space Complexity: \(\Theta(1)\) for both.
- most beautiful item for each query - — 9/12/24 -
-+ most beautiful item for each query + — 9/12/24 +
problem statement
@@ -373,16 +369,14 @@ \(m\)/\(n\) respectively.
- shortest subarray with or at least k ii - — 9/11/24 -
-+ shortest subarray with or at least k ii + — 9/11/24 +
problem statement
@@ -555,16 +549,14 @@ OR.
- minimum array end - — 9/10/24 -
-+ minimum array end + — 9/10/24 +
problem statement
diff --git a/posts/algorithms/two-pointers.html b/posts/algorithms/two-pointers.html
index 056b48a..e9f5bd1 100644
--- a/posts/algorithms/two-pointers.html
+++ b/posts/algorithms/two-pointers.html
@@ -42,7 +42,7 @@
Visualizing the model, namely output as a function of capital,
@@ -225,9 +223,7 @@
\bar{A}^\frac{1}{1-\alpha}(\frac{\bar{s}}{\bar{d}})^\frac{\alpha}{1-\alpha})\]
Using both mathematical intuition and manipulating the
@@ -280,9 +276,9 @@
How, then, can we address these shortcomings?
@@ -454,7 +450,7 @@
To find the output in terms of exogenous parameters, first note
@@ -474,7 +470,7 @@
L_{yt}=A_0(1+\bar{z}\bar{l}\bar{L})^t(1-\bar{l})\bar{L}\]
We see the Romer model exhibits long-run growth because ideas
@@ -550,9 +546,9 @@
technique overview
-
- solving the model
- solving the model
analysis
- analysis
romer
romer
introduction
introduction
solving the model
solving the model
analysis
analysis
romer-solow
romer-solow
introduction
introduction
While the Romer Model provides an avenue for long-run economic @@ -601,7 +597,7 @@