diff --git a/posts/algorithms/leetcode-daily.html b/posts/algorithms/leetcode-daily.html
index 6a4ff80..09e5a7d 100644
--- a/posts/algorithms/leetcode-daily.html
+++ b/posts/algorithms/leetcode-daily.html
@@ -162,8 +162,7 @@
               O(nlg(n)+mlg(m))\). An argument can be made that because
               <code>queries[i],items[i][{0,1}]</code>\(\leq10^9\), radix sort
               can be leveraged to achieve a time complexity of \(O(d \cdot (n +
-              k + m + k))\in O(9\cdot (n + m))\in O(9n+9m)\in
-              O(n+m)\).
+              k + m + k))\in O(9\cdot (n + m))\in O(9n+9m)\in O(n+m)\).
             </p>
             <p>
               <u>Space Complexity</u>: \(\Theta(1)\), considering that \(O(m)\)