Remove unnecessary comments

structure/stack/array.go

@@ -1,10 +1,3 @@
-// Stack implementation using Array
-// Stack is a linear data structure in which the push and pop operations occur only at one end of the structure, referred to as the top of the stack.
-// The order in which an element added to or removed from a stack is described as last in, first out (LIFO).
-// Details:
-// 	Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/
-// 	Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
-
 package stack
 
 import "errors"

structure/stack/doubly_linked_list_test.go

@@ -1,12 +1,3 @@
-// Stack Test
-// description: based on `geeksforgeeks` description Stack is a linear data structure which follows a particular order in which the operations are performed.
-//	The order may be LIFO(Last In First Out) or FILO(First In Last Out).
-// details:
-// 	Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/
-// 	Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
-// author [Milad](https://github.com/miraddo)
-// see stackarray.go, stacklinkedlist.go, stacklinkedlistwithlist.go
-
 package stack
 
 import (

structure/stack/stack.go

@@ -1,3 +1,8 @@
+// Stack is a linear data structure in which the push and pop operations occur only at one end of the structure, referred to as the top of the stack.
+// The order in which an element added to or removed from a stack is described as last in, first out (LIFO).
+//
+//	Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/
+//	Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
 package stack
 
 // Interface defines the specifications for a stack implementation.