diff --git a/packages/mermaid-layout-elk/src/render.ts b/packages/mermaid-layout-elk/src/render.ts
index 59b97c557..dc9ccee8e 100644
--- a/packages/mermaid-layout-elk/src/render.ts
+++ b/packages/mermaid-layout-elk/src/render.ts
@@ -713,7 +713,7 @@ export const render = async (
       // check if point is inside the boundary rect
       if (!outsideNode(bounds, point) && !isInside) {
         // First point inside the rect found
-        // Calc the intersection coord between the point anf the last point outside the rect
+        // Calc the intersection coord between the point and the last point outside the rect
         let inter;
 
         if (isDiamond) {
diff --git a/packages/mermaid/src/dagre-wrapper/edges.js b/packages/mermaid/src/dagre-wrapper/edges.js
index 1a72328e8..e88457fcd 100644
--- a/packages/mermaid/src/dagre-wrapper/edges.js
+++ b/packages/mermaid/src/dagre-wrapper/edges.js
@@ -324,7 +324,7 @@ const cutPathAtIntersect = (_points, boundaryNode) => {
     // check if point is inside the boundary rect
     if (!outsideNode(boundaryNode, point) && !isInside) {
       // First point inside the rect found
-      // Calc the intersection coord between the point anf the last point outside the rect
+      // Calc the intersection coord between the point and the last point outside the rect
       const inter = intersection(boundaryNode, lastPointOutside, point);
 
       // // Check case where the intersection is the same as the last point
diff --git a/packages/mermaid/src/diagrams/flowchart/flowDb.ts b/packages/mermaid/src/diagrams/flowchart/flowDb.ts
index 03806222f..3eb1b13a7 100644
--- a/packages/mermaid/src/diagrams/flowchart/flowDb.ts
+++ b/packages/mermaid/src/diagrams/flowchart/flowDb.ts
@@ -319,7 +319,7 @@ You have to call mermaid.initialize.`
     // the rest of the edges should have auto generated ids
     for (const start of _start) {
       for (const end of _end) {
-        //use the id only for last node in _start and and first node in _end
+        //use the id only for last node in _start and first node in _end
         const isLastStart = start === _start[_start.length - 1];
         const isFirstEnd = end === _end[0];
         if (isLastStart && isFirstEnd) {