diff --git a/README.md b/README.md
index b888d36f..48050800 100644
--- a/README.md
+++ b/README.md
@@ -11,7 +11,7 @@ The directory tree has the following convention of `category/language/problem`,
 
 A unit `problem` must conform to the following specifications:
 - The name should be in lowercase. (**Eg.** `palindrome/`, `binary-search.cpp` etc.).
-- Each word must be seperated by a **dash** or a **hyphen** (`-`).
+- Each word must be separated by a **dash** or a **hyphen** (`-`).
 
 **If you have a problem that belongs to a new *topic* or *category* than one which are present:**
 1. Create a new folder and an index for it inside (a readme, `README.md` file).
diff --git a/graphs/c-or-cpp/bellman-ford.cpp b/graphs/c-or-cpp/bellman-ford.cpp
index 12890e35..da06d1e4 100644
--- a/graphs/c-or-cpp/bellman-ford.cpp
+++ b/graphs/c-or-cpp/bellman-ford.cpp
@@ -77,7 +77,7 @@ int main()
 	vector<int>dist;
 	bool neg = bellman_ford(graph,V,s,dist);
 
-	//if no negative weigth cycle is found...
+	//if no negative weigt cycle is found...
 	if(neg)
 	{
 		cout<<"vertex		Dist from Source\n";
@@ -89,4 +89,4 @@ int main()
 
 
 	return 0;
-}
\ No newline at end of file
+}
diff --git a/linked-lists/c-or-cpp/Insert_and_delete_beginning.c b/linked-lists/c-or-cpp/Insert-and-delete-beginning.c
similarity index 93%
rename from linked-lists/c-or-cpp/Insert_and_delete_beginning.c
rename to linked-lists/c-or-cpp/Insert-and-delete-beginning.c
index 0a8fb7a0..22d0d163 100644
--- a/linked-lists/c-or-cpp/Insert_and_delete_beginning.c
+++ b/linked-lists/c-or-cpp/Insert-and-delete-beginning.c
@@ -15,7 +15,7 @@ struct node *current = NULL ;
 //Function to Print the Linked List
 void printList(){
     printf("\nItem in the Linked List are :  ");
-    // Intialize the ptr(pointer) with head location .
+    // Initialize the ptr(pointer) with head location .
     struct node *ptr = head ;
     // While Loop until we encounter a Node which is NULL .
     // NULL ,  signifies we are the end of the list .
@@ -34,7 +34,7 @@ void insertBeg(int data){
  link->data = data ;
  //Point the link's pointer to the current head
  link->next = head ;
- //Update the Head to the node we want to insert at the beggining
+ //Update the Head to the node we want to insert at the begining
  head = link ;
 }
 
diff --git a/searching/c-or-cpp/linear-search.cpp b/searching/c-or-cpp/linear-search.cpp
index f35d7236..5340e643 100644
--- a/searching/c-or-cpp/linear-search.cpp
+++ b/searching/c-or-cpp/linear-search.cpp
@@ -19,9 +19,9 @@ int main()
     
      cout<<array[i]<<" ";
      cout<<"\n";
-    cout<<"please enter the number which you want to find in the inputed array \n";
+    cout<<"please enter the number which you want to find in the inputted array \n";
     cin>>key;
-    cout<<"the inputed no is at position \n";
+    cout<<"the inputted no is at position \n";
     for(i=0;i<n;++i)
     {
       
diff --git a/sorting/c-or-cpp/bubble-sort.cpp b/sorting/c-or-cpp/bubble-sort.cpp
index fb80422f..8997f336 100644
--- a/sorting/c-or-cpp/bubble-sort.cpp
+++ b/sorting/c-or-cpp/bubble-sort.cpp
@@ -18,7 +18,7 @@ int main()
 		for (int j= 0; j< n-1; j++)
 		{    //comparing adjecent elements of array
 			if (arr[j]>arr[j+1])
-			{   // swaping array elements
+			{   // swapping array elements
 				temp = arr[j];
 				arr[j] = arr[j+1];
 				arr[j+1] = temp;
@@ -30,4 +30,4 @@ int main()
 		cout<<arr[i]<<" ";
 	}
 	return 0;
-}
\ No newline at end of file
+}
diff --git a/sorting/java/counting-sort.java b/sorting/java/counting-sort.java
index e4eacea2..36894d57 100644
--- a/sorting/java/counting-sort.java
+++ b/sorting/java/counting-sort.java
@@ -1,7 +1,7 @@
 public class CountingSort {
 
     /**
-     * Public method to use the counting sort algortithm
+     * Public method to use the counting sort algorithm
      * @param arr - the array in input
      */
     public void sort(int[] arr){
diff --git a/sorting/java/merge-sort.java b/sorting/java/merge-sort.java
index 4c6a34eb..3b8f6645 100644
--- a/sorting/java/merge-sort.java
+++ b/sorting/java/merge-sort.java
@@ -9,7 +9,7 @@ class MergeSortApp
 		arr = new int[]{12,54,222,54622,10,169,30}; //Array to sort
 	}
 
-    //Funtion to display/Print Array
+    //Function to display/Print Array
 	public void printArray()
 	{
 	for (int i=0;i<arr.length;i++)
@@ -76,4 +76,4 @@ class MergeSort
 				ob.mergesort();
 				ob.printArray();
 		}
-}
\ No newline at end of file
+}
diff --git a/sorting/java/quick-sort.java b/sorting/java/quick-sort.java
index e61ac08b..98190a21 100644
--- a/sorting/java/quick-sort.java
+++ b/sorting/java/quick-sort.java
@@ -1,5 +1,5 @@
 // Java program for implement Quick Sort
-//Note: Rightmost element in the array is choosen as pivot
+//Note: Rightmost element in the array is chosen as pivot
 class QuickSortBack
 {
 	private int[] arr;
@@ -78,4 +78,4 @@ class QuickSort
 		ob.quickSort();							   //call quickSort
 		ob.displayArray();
 	}
-}
\ No newline at end of file
+}
diff --git a/stacks/README.md b/stacks/README.md
index 5f4c154f..34cd53b8 100644
--- a/stacks/README.md
+++ b/stacks/README.md
@@ -2,4 +2,4 @@
 
 ### C or C++
 
-1. [Balanced Paranthesis](c-or-cpp/balanced-paranthesis.cpp)
+1. [Balanced Parenthesis](c-or-cpp/balanced-parenthesis.cpp)
diff --git a/stacks/c-or-cpp/balanced-paranthesis.cpp b/stacks/c-or-cpp/balanced-parenthesis.cpp
similarity index 99%
rename from stacks/c-or-cpp/balanced-paranthesis.cpp
rename to stacks/c-or-cpp/balanced-parenthesis.cpp
index dc845594..6a3e2f89 100644
--- a/stacks/c-or-cpp/balanced-paranthesis.cpp
+++ b/stacks/c-or-cpp/balanced-parenthesis.cpp
@@ -40,4 +40,4 @@ int main() {
 	else
 		cout << "Not Balanced";
 	return 0;
-}
\ No newline at end of file
+}
diff --git a/strings/c-or-cpp/string-tokeniser.cpp b/strings/c-or-cpp/string-tokeniser.cpp
index a82039ac..a92182fa 100644
--- a/strings/c-or-cpp/string-tokeniser.cpp
+++ b/strings/c-or-cpp/string-tokeniser.cpp
@@ -24,7 +24,7 @@ char* mystrtok(char* s, char d)
     // Start extracting string and
     // store it in array
     for (; input[i] != '\0'; i++) {
-        // If delimeter is not reached
+        // If delimiter is not reached
         // then add the current character
         // to result[i]
         if (input[i] != d)
diff --git a/strings/js/palindrome.js b/strings/js/palindrome.js
index 37516755..b61abe42 100644
--- a/strings/js/palindrome.js
+++ b/strings/js/palindrome.js
@@ -1,7 +1,7 @@
 // JavaScript Palindrome Checker: Checks whether a word is the same in reverse. Ignores punctuation, capitalization & spaces.
 
 function isPalindrome(str) {
-    // First convert the string into proper alpha-numeric word
+    // First convert the string into proper alphanumeric word
     let properStr = str
         .replace(/[_\W]/g, "")
         .toLowerCase();
@@ -19,4 +19,4 @@ function isPalindrome(str) {
 // Output to the console
 console.log(isPalindrome("eye"));
 console.log(isPalindrome("Mr. Owl ate my metal worm"));
-console.log(isPalindrome("RAce C*_aR"));
\ No newline at end of file
+console.log(isPalindrome("RAce C*_aR"));