## Zig Zag Traversal Of Binary Tree

Problem Statement: Given the root of a binary tree, return the zigzag level order traversal of Binary Tree. (i.e., from

## Aggressive Cows : Detailed Solution

Problem Statement: You are given an array ‘arr’ of size ‘n’ which denotes the position of stalls.You are also given

## Next Greater Element Using Stack

Problem Statement: Given a circular integer array A, return the next greater element for every element in A. The next

## Implement Min Stack : O(2N) and O(N) Space Complexity

Problem Statement: Implement Min Stack | O(2N) and O(N) Space Complexity. Design a stack that supports push, pop, top, and

## Rotten Oranges : Min time to rot all oranges : BFS

Problem Statement: You will be given an m x n grid, where each cell has the following values :  2

## Allocate Minimum Number of Pages

Problem Statement: Given an array ‘arr of integer numbers, ‘ar[i]’ represents the number of pages in the ‘i-th’ book. There

## 3 Sum : Find triplets that add up to a zero

Problem Statement: Given an array of N integers, your task is to find unique triplets that add up to give a

## Implement Stack using single Queue

Problem Statement: Implement a Stack using a single Queue. Note: Stack is a data structure that follows the Last In