diff --git a/content/6_Plat/HLD.mdx b/content/6_Plat/HLD.mdx
index c735261..0cd6fb9 100644
--- a/content/6_Plat/HLD.mdx
+++ b/content/6_Plat/HLD.mdx
@@ -23,8 +23,8 @@ export const metadata = {
       new Problem("Plat", "Disrupt", "842", "Easy", false, ["HLD"], ""),
       new Problem("HR", "Subtrees & Paths", "https://www.hackerrank.com/challenges/subtrees-and-paths", "Intro|Easy", false, ["HLD", "RURQ"], "See adamant's blog."),
       new Problem("YS","Vertex Set Path Composite","vertex_set_path_composite", "Intro|Normal", false, ["HLD", "SegTree"], "Function order matters! Maintain two segment trees, one for going up and the other for going down the tree."),
-      new Problem("CF", "Tree Queries", "contest/1254/problem/D", "Hard", false, ["HLD"], "maybe hard to see why this applies here, gives $O(N\log N)$ while most people solved it with some factor of $\sqrt N$"),
-      new Problem("ojuz", "JOI - Synchronization", "JOI13_synchronization", "Hard", false, ["HLD"], "$O(N\log N)$ :D"),
+      new Problem("CF", "Tree Queries", "contest/1254/problem/D", "Hard", false, ["HLD"], "maybe hard to see why this applies here, gives $O(N\\log N)$ while most people solved it with some factor of $\\sqrt N$"),
+      new Problem("ojuz", "JOI - Synchronization", "JOI13_synchronization", "Hard", false, ["HLD"], "$O(N\\log N)$ :D"),
       new Problem("ojuz", "JOI - Cats or Dogs", "JOI18_catdog", "Very Hard", false, ["HLD"], ""),
     ],
   }