## Design a stack which can give maximum frequency element

Given N elements and the task is to implement a stack which removes and returns the maximum frequency element on every pop operation. If there’s… Read More »

- MakeMyTrip Interview Experience 2019
- Print the last k nodes of the linked list in reverse order | Recursive approach
- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Program to reverse a linked list using Stack
- Difference between Stack and Queue Data Structures
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Print Stack Elements from Bottom to Top
- Find maximum in stack in O(1) without using additional stack
- Sum of minimum elements of all possible sub-arrays of an array
- Sum of maximum elements of all possible sub-arrays of an array
- Sum of bitwise AND of all submatrices
- Sum of Bitwise-OR of all Submatrices
- Iterative Postorder traversal | Set 3
- Number of submatrices with OR value 1
- Number of submatrices with all 1s
- Print leaf nodes in binary tree from left to right using one stack
- Check if the two given stacks are same
- Check if moves in a stack or queue are possible or not
- Delete all even elements from a stack
- Analyzing BufferOverflow with GDB
- Design a stack which can give maximum frequency element
- Reverse the Sentence using Stack

Given N elements and the task is to implement a stack which removes and returns the maximum frequency element on every pop operation. If there’s… Read More »

Given a string str consisting of a sentence, the task is to reverse the entire sentence word by word. Examples: Input: str = “geeks for… Read More »

Pre-requisite: GDB (Step by Step Introduction) A BufferOverflow often occurs when the content inside the defined variable is copied to another variable without doing Bound… Read More »

Given two Stacks, the task is to check if the given stacks are same or not. Two stacks are said to be same if they… Read More »

Given a stack with n elements, the task is to remove all the elements of the stack without affecting the order of elements. Examples: Input… Read More »

We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »

Give an array arr[] of N integers and another integer k ≤ N. The task is to find the maximum element of every sub-array of… Read More »

The task is to design a stack which can get the maximum value in the stack in O(1) time without using an additional stack. Examples:… Read More »

Given a binary tree, the task is to print all leaf nodes of the given binary tree from left to right. That is, the nodes… Read More »

Given a linked list containing N nodes and a positive integer K where K should be less than or equal to N. The task is… Read More »

Given a NxN matrix, the task is to find the sum of bit-wise OR of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »

Given a NxN matrix, the task is to find the sum of bit-wise AND of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »

Given a N*N binary matrix, task is to find the count of rectangular sub-matrices with OR value 1. Examples: Input : arr[][] = {{0, 0,… Read More »

Given a N*N matrix containing only 0s and 1s, the task is to count the number of submatrices containing all 1s. Examples: Input : arr[][]… Read More »

Given a stack s, the task is to print the elements of the stack from bottom to top, such that the elements are still present… Read More »