diff --git a/Arrays/1D Array/solution.c b/Arrays/1D Array/solution.c
new file mode 100644
index 0000000..a41dff9
--- /dev/null
+++ b/Arrays/1D Array/solution.c	
@@ -0,0 +1,11 @@
+#include<stdio.h>
+
+int main() {
+	int arr[1000], n;
+	scanf("%d", &n);
+	for(int i=0; i<n; i++) 
+		scanf("%d", &arr[i]);
+	for(int i=n-1; i >= 0; i--) 
+		printf("%d\n", arr[i]);
+	return 0;
+}
diff --git a/Arrays/Multi-D Array/solution.c b/Arrays/Multi-D Array/solution.c
new file mode 100644
index 0000000..c55f957
--- /dev/null
+++ b/Arrays/Multi-D Array/solution.c	
@@ -0,0 +1,20 @@
+#include<stdio.h>
+
+int main() {
+	int mat[1000][1000], m, n, i, j;
+	scanf("%d %d", &n, &m);
+	for(i=0; i<n; i++) 
+        for(j=0;j<m;j++)
+		scanf("%d", &mat[i][j]);
+	for( i=0 ; i<m ; i++)
+    for(j=0;j<n;j++)
+    {
+        if(j+1<n){
+                printf("%d ", mat[j][i]);
+        }    
+        else {
+            printf("%d\n", mat[j][i]);
+        }
+    }
+	return 0;
+}
\ No newline at end of file
diff --git a/Hash Tables/Hash Tables/solution.c b/Hash Tables/Hash Tables/solution.c
new file mode 100644
index 0000000..232c703
--- /dev/null
+++ b/Hash Tables/Hash Tables/solution.c	
@@ -0,0 +1,16 @@
+#include<stdio.h>
+#define MAX 100000
+int main() {
+    int n,i,j, ind, sno, index[MAX];
+    scanf("%d", &n);
+    char hash[MAX][25];
+    for(i=0;i<n;i++){
+        scanf("%d %s", &index[i], hash[i]);
+    }
+    scanf("%d", &sno);
+    for(i=0;i<sno;i++){
+        scanf("%d", &ind);
+        for(j=0; j < MAX; j++) if(ind == index[j]) break;
+        printf("%s\n", hash[j]);
+    }
+}
\ No newline at end of file
diff --git a/Queues/Queues/solution.c b/Queues/Queues/solution.c
new file mode 100644
index 0000000..35c0048
--- /dev/null
+++ b/Queues/Queues/solution.c
@@ -0,0 +1,24 @@
+#include<stdio.h>
+
+int main() {
+    int n, i, item, queue[10000], size=-1, j;
+    char ch;
+    scanf("%d", &n);
+    for(i=0; i<n ;i++){
+        scanf(" %c", &ch);
+        switch(ch) {
+            case 'E':   scanf("%d", &item);
+                        queue[++size] = item;
+                        printf("%d\n", size+1);
+                        break;
+            case 'D':   if(size >= 0) {
+                            item = queue[0];
+                            size--;
+                            for(j=0;j<=size; j++) queue[j] = queue[j+1];
+                        }
+                        else item = 1;
+                        printf("%d %d\n", item, size+1);
+                        break;
+        }
+    }
+}
\ No newline at end of file
diff --git a/Stacks/Stacks/solution.c b/Stacks/Stacks/solution.c
new file mode 100644
index 0000000..7fa29e9
--- /dev/null
+++ b/Stacks/Stacks/solution.c
@@ -0,0 +1,19 @@
+#include<stdio.h>
+
+int main() {
+    int n, i, item, stack[10000], size=-1, j, ch;
+    scanf("%d", &n);
+    for(i=0; i<n ;i++){
+        scanf("%d", &ch);
+        switch(ch) {
+            case 2:     scanf("%d", &item);
+                        stack[++size] = item;
+                        break;
+            case 1:     if(size >= 0) item = stack[size--];
+                        else item = -1;
+                        if(item > 0) printf("%d\n", item);
+                        else printf("No Food\n");
+                        break;
+        }
+    }
+}
\ No newline at end of file