diff --git a/.DS_Store b/.DS_Store
deleted file mode 100644
index e3ea3d908..000000000
Binary files a/.DS_Store and /dev/null differ
diff --git a/Dynamic Programming/.DS_Store b/Dynamic Programming/.DS_Store
deleted file mode 100644
index 0ff1e333a..000000000
Binary files a/Dynamic Programming/.DS_Store and /dev/null differ
diff --git a/Dynamic Programming/Armstrong Number.txt b/Dynamic Programming/Armstrong Number.txt
deleted file mode 100644
index 811af3cb6..000000000
--- a/Dynamic Programming/Armstrong Number.txt	
+++ /dev/null
@@ -1,17 +0,0 @@
-Armstrong number
-
-An armstrong number is a number whose sum of cube of digits is equal to the original number.
-
-Example: 153
-
-Here,
-  Sum of cube of digits= cube(1)+cube(5)+cube(3)
-                       = 1+125+27
-                       = 153
-  This is equal to the entered number. Hence, 153 is an armstrong number.
-
-Code:
-
-> In our code, we have extracted each digit of the number, found its cube and stored the sum of all such cubes in a variable. This sum has been compared in the end with the original number.
-
-> We have used a function 'pow' to find the cube of each digit. For its implementation, a header file 'Math.h' has been used.