diff --git a/Backtracking/AllCombinationsOfSizeK.js b/Backtracking/AllCombinationsOfSizeK.js
index c02288d1b..77ddd54f8 100644
--- a/Backtracking/AllCombinationsOfSizeK.js
+++ b/Backtracking/AllCombinationsOfSizeK.js
@@ -2,7 +2,7 @@
   Problem: Given two numbers, n and k, make all unique combinations of k numbers from 1 to n and in sorted order
 
   What is combinations?
-  - Combinations is selecting items from a collections without considering order of selection
+  - Combinations is selecting items from a collections without considering the order of selection
 
   Example:
   - We have an apple, a banana, and a jackfruit
diff --git a/Data-Structures/Array/LocalMaximomPoint.js b/Data-Structures/Array/LocalMaximomPoint.js
index de136c21f..b51e809ce 100644
--- a/Data-Structures/Array/LocalMaximomPoint.js
+++ b/Data-Structures/Array/LocalMaximomPoint.js
@@ -3,7 +3,7 @@
  *
  * Notes:
  * - works by using divide and conquer
- * - the function gets the array A with n Real numbers and returns the local max point index (if more than one exists return the first one)
+ * - the function gets the array A with n Real numbers and returns the index of local max point (if more than one exists return the first one)
  *
  * @complexity: O(log(n)) (on average )
  * @complexity: O(log(n)) (worst case)
diff --git a/Data-Structures/Graph/Graph2.js b/Data-Structures/Graph/Graph2.js
index 9defc1438..3c360f7a1 100644
--- a/Data-Structures/Graph/Graph2.js
+++ b/Data-Structures/Graph/Graph2.js
@@ -42,7 +42,7 @@ class Graph {
 
     // iterate over the vertices
     for (const i of getKeys) {
-      // great the corresponding adjacency list
+      // get the corresponding adjacency list
       // for the vertex
       const getValues = this.AdjList.get(i)
       let conc = ''