diff --git a/add-two-polynomials-represented-as-linked-lists/test.ts b/add-two-polynomials-represented-as-linked-lists/test.ts
index 426398fb..e1915927 100644
--- a/add-two-polynomials-represented-as-linked-lists/test.ts
+++ b/add-two-polynomials-represented-as-linked-lists/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import { ArrayToPolyNode } from "./ArrayToPolyNode.ts";
 import addPoly from "./index.ts";
diff --git a/basic-calculator-iv/test.ts b/basic-calculator-iv/test.ts
index e4994cf4..7928f733 100644
--- a/basic-calculator-iv/test.ts
+++ b/basic-calculator-iv/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import basicCalculatorIV from "./index.ts";
 import { Poly } from "./Poly.ts";
diff --git a/booking-concert-tickets-in-groups/test.ts b/booking-concert-tickets-in-groups/test.ts
index a649af5e..2cbf1981 100644
--- a/booking-concert-tickets-in-groups/test.ts
+++ b/booking-concert-tickets-in-groups/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 import { runScript } from "leetcode-class";
 
 import BookMyShow from "./index.ts";
diff --git a/brace-expansion-ii/test.ts b/brace-expansion-ii/test.ts
index 507ae24a..a127f5af 100644
--- a/brace-expansion-ii/test.ts
+++ b/brace-expansion-ii/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import braceExpansionII from "./index.ts";
 
diff --git a/brace-expansion/test.ts b/brace-expansion/test.ts
index 388b69f3..8e415706 100644
--- a/brace-expansion/test.ts
+++ b/brace-expansion/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import expand from "./index.ts";
 
diff --git a/construct-binary-search-tree-from-preorder-traversal/test.ts b/construct-binary-search-tree-from-preorder-traversal/test.ts
index 890906b4..12be35d0 100644
--- a/construct-binary-search-tree-from-preorder-traversal/test.ts
+++ b/construct-binary-search-tree-from-preorder-traversal/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import { TreeNodeLeetCodeToJSON } from "../utils/TreeNodeLeetCodeStringify.ts";
diff --git a/construct-binary-tree-from-string/test.ts b/construct-binary-tree-from-string/test.ts
index adad8e04..79a5fb18 100644
--- a/construct-binary-tree-from-string/test.ts
+++ b/construct-binary-tree-from-string/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import str2tree from "./index.ts";
 
diff --git a/count-of-smaller-numbers-after-self/test.ts b/count-of-smaller-numbers-after-self/test.ts
index 7a295b1e..2b3f61d1 100644
--- a/count-of-smaller-numbers-after-self/test.ts
+++ b/count-of-smaller-numbers-after-self/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import countSmaller from "./index.ts";
 
diff --git a/delete-tree-nodes/test.ts b/delete-tree-nodes/test.ts
index 975d8620..b0ab484d 100644
--- a/delete-tree-nodes/test.ts
+++ b/delete-tree-nodes/test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import deleteTreeNodes from "./index.ts";
 
diff --git a/deps.ts b/deps.ts
index 997d78e0..e5668769 100644
--- a/deps.ts
+++ b/deps.ts
@@ -5,15 +5,15 @@ export {
     assertFalse,
     assertStrictEquals,
     equal,
-} from "https://deno.land/std@0.177.0/testing/asserts.ts";
+} from "https://deno.land/std@0.178.0/testing/asserts.ts";
 
 import AsyncLimiterClass, {
     AsyncCurrentLimiter,
 } from "npm:@masx200/async-task-current-limiter@2.1.0";
 
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
 import { Deque } from "https://esm.sh/@datastructures-js/deque@1.0.4/";
-import { RedBlackNode } from "https://deno.land/std@0.177.0/collections/red_black_node.ts";
+import { RedBlackNode } from "https://deno.land/std@0.178.0/collections/red_black_node.ts";
 import memoize from "https://cdn.skypack.dev/lodash@4.17.21/memoize?dts";
 
 export { Deque };
@@ -27,8 +27,8 @@ export { default as sum } from "https://cdn.skypack.dev/lodash@4.17.21/sum?dts";
 export { default as intersection } from "https://cdn.skypack.dev/lodash@4.17.21/intersection?dts";
 
 export { BinaryHeap };
-export { walk } from "https://deno.land/std@0.177.0/fs/mod.ts";
-export { parse } from "https://deno.land/std@0.177.0/flags/mod.ts";
+export { walk } from "https://deno.land/std@0.178.0/fs/mod.ts";
+export { parse } from "https://deno.land/std@0.178.0/flags/mod.ts";
 export { combinations } from "https://deno.land/x/combinatorics@1.1.2/mod.ts";
 export { isIP } from "node:net";
 export { Heap } from "npm:@datastructures-js/heap@4.3.1";
@@ -44,7 +44,7 @@ export {
     TreeNode,
 } from "https://esm.sh/@masx200/leetcode-class@1.2.7/";
 
-export type { WalkEntry } from "https://deno.land/std@0.177.0/fs/_util.ts";
+export type { WalkEntry } from "https://deno.land/std@0.178.0/fs/_util.ts";
 
 export { AsyncLimiterClass };
 export type { AsyncCurrentLimiter };
diff --git a/design-a-file-sharing-system/index.ts b/design-a-file-sharing-system/index.ts
index 8436e198..05ed19dc 100644
--- a/design-a-file-sharing-system/index.ts
+++ b/design-a-file-sharing-system/index.ts
@@ -65,4 +65,4 @@ export default class FileSharing {
         return usersList;
     }
 }
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
diff --git a/dinner-plate-stacks/RedBlackTree.ts b/dinner-plate-stacks/RedBlackTree.ts
index de67273c..d7c2f9b7 100644
--- a/dinner-plate-stacks/RedBlackTree.ts
+++ b/dinner-plate-stacks/RedBlackTree.ts
@@ -1,8 +1,8 @@
 import {
     Direction,
     RedBlackNode,
-} from "https://deno.land/std@0.177.0/collections/red_black_node.ts";
-import { RedBlackTree } from "https://deno.land/std@0.177.0/collections/red_black_tree.ts";
+} from "https://deno.land/std@0.178.0/collections/red_black_node.ts";
+import { RedBlackTree } from "https://deno.land/std@0.178.0/collections/red_black_tree.ts";
 
 export default class RedBlackTreeExtended<T> extends RedBlackTree<T> {
     insertGetNode(value: T): RedBlackNode<T> | null {
diff --git a/dinner-plate-stacks/index.ts b/dinner-plate-stacks/index.ts
index 6c0d235e..62be26ac 100644
--- a/dinner-plate-stacks/index.ts
+++ b/dinner-plate-stacks/index.ts
@@ -1,4 +1,4 @@
-import { ascend } from "https://deno.land/std@0.177.0/collections/binary_search_tree.ts";
+import { ascend } from "https://deno.land/std@0.178.0/collections/binary_search_tree.ts";
 import RedBlackTree from "./RedBlackTree.ts";
 import { reverseInOrderIterator } from "./reverseInOrderIterator.ts";
 
diff --git a/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts b/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts
index c402f1da..4bba6074 100644
--- a/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts
+++ b/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts
@@ -1,4 +1,4 @@
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
 
 export default function findTheCity(
     n: number,
diff --git a/finding-mk-average/MultiRedBlackTree.ts b/finding-mk-average/MultiRedBlackTree.ts
index 221e7d90..4756b546 100644
--- a/finding-mk-average/MultiRedBlackTree.ts
+++ b/finding-mk-average/MultiRedBlackTree.ts
@@ -1,6 +1,6 @@
-import { ascend } from "https://deno.land/std@0.177.0/collections/_comparators.ts";
-import { Direction } from "https://deno.land/std@0.177.0/collections/binary_search_node.ts";
-import { RedBlackNode } from "https://deno.land/std@0.177.0/collections/red_black_node.ts";
+import { ascend } from "https://deno.land/std@0.178.0/collections/_comparators.ts";
+import { Direction } from "https://deno.land/std@0.178.0/collections/binary_search_node.ts";
+import { RedBlackNode } from "https://deno.land/std@0.178.0/collections/red_black_node.ts";
 import RedBlackTreeExtended from "../dinner-plate-stacks/RedBlackTree.ts";
 
 export class MultiRedBlackTree<T> extends RedBlackTreeExtended<T> {
diff --git a/finding-mk-average/simple.test.ts b/finding-mk-average/simple.test.ts
index 57ad4219..ff3a7ef9 100644
--- a/finding-mk-average/simple.test.ts
+++ b/finding-mk-average/simple.test.ts
@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 import { runScript } from "leetcode-class";
 import MKAverage from "./index.ts";
 
diff --git a/import_map.json b/import_map.json
index 0e92dbdb..a86d364e 100644
--- a/import_map.json
+++ b/import_map.json
@@ -1,6 +1,6 @@
 {
     "imports": {
-        "asserts": "https://deno.land/std@0.177.0/testing/asserts.ts",
+        "asserts": "https://deno.land/std@0.178.0/testing/asserts.ts",
         "leetcode-class": "https://esm.sh/@masx200/leetcode-class@1.2.7/",
         "assert": "https://esm.sh/assert@2.0.0"
     },
diff --git a/minimum-path-sum/test.ts b/minimum-path-sum/test.ts
index a471c13a..2791400d 100644
--- a/minimum-path-sum/test.ts
+++ b/minimum-path-sum/test.ts
@@ -1,4 +1,4 @@
-import { assertStrictEquals } from "https://deno.land/std@0.177.0/testing/asserts.ts";
+import { assertStrictEquals } from "https://deno.land/std@0.178.0/testing/asserts.ts";
 import minPathSum from "./index.ts";
 
 Deno.test("minimum-path-sum", () => {
diff --git a/path-with-minimum-effort/minimumEffortPath.ts b/path-with-minimum-effort/minimumEffortPath.ts
index 44397fae..c20e483b 100644
--- a/path-with-minimum-effort/minimumEffortPath.ts
+++ b/path-with-minimum-effort/minimumEffortPath.ts
@@ -1,4 +1,4 @@
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
 
 function minimumEffortPath(heights: number[][]): number {
     const dirs = [
diff --git a/reachable-nodes-in-subdivided-graph/index.ts b/reachable-nodes-in-subdivided-graph/index.ts
index c6857a37..63bac952 100644
--- a/reachable-nodes-in-subdivided-graph/index.ts
+++ b/reachable-nodes-in-subdivided-graph/index.ts
@@ -44,4 +44,4 @@ export default function reachableNodes(
     }
     return reachableNodes;
 }
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
diff --git a/total-cost-to-hire-k-workers/index.ts b/total-cost-to-hire-k-workers/index.ts
index 10782133..a77a0cd9 100644
--- a/total-cost-to-hire-k-workers/index.ts
+++ b/total-cost-to-hire-k-workers/index.ts
@@ -30,4 +30,4 @@ export default function totalCost(
     costs.sort(compare);
     return ans + costs.slice(0, k).reduce((p, c) => p + c, 0);
 }
-import { BinaryHeap } from "https://deno.land/std@0.177.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.178.0/collections/binary_heap.ts";
diff --git a/utils/split_by_count.ts b/utils/split_by_count.ts
index 515f025f..9f47aeae 100644
--- a/utils/split_by_count.ts
+++ b/utils/split_by_count.ts
@@ -1,4 +1,4 @@
-import { chunk } from "https://deno.land/std@0.177.0/collections/chunk.ts";
+import { chunk } from "https://deno.land/std@0.178.0/collections/chunk.ts";
 
 export function split_by_count<T>(files: T[], limit: number): T[][] {
     return chunk(files, limit) as T[][];