Topic: Stack
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Implement Stack using Arrays</td><td>Easy</td></tr></tbody></table>

Implementing Stack using Arrays
<pre><code class="lang-java">class MyStack
{
 int top;
 int arr[] = new int[1000];

 MyStack()
 {
 top = -1;
 }

 //Function to push an integer into the stack.
 void push(int a)
 {
 if(top!=arr.length-1){
 arr[++top] = a;
 }
 } 

 //Function to remove an item from top of the stack.
 int pop()
 {
 if(top!=-1){
 return arr[top--];
 }
 return -1;
 }
}

/*OUTPUT
3 4
*/
</code></pre>
Thank you for reading :)

Topic: ***Stack***

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Implement Stack using Arrays</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

**Implementing Stack using Arrays**

```java
class MyStack
{
 int top;
	int arr[] = new int[1000];

 MyStack()
	{
		top = -1;
	}
	
	//Function to push an integer into the stack.
 void push(int a)
	{
	 if(top!=arr.length-1){
	 arr[++top] = a;
	 }
	} 
	
 //Function to remove an item from top of the stack.
	int pop()
	{
 if(top!=-1){
 return arr[top--];
 }
 return -1;
	}
}

/*OUTPUT
3 4
*/
```

Thank you for reading :)

DSA Day 45/100