## Print Stack Elements from Bottom to Top

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 »

## Program to reverse a linked list using Stack

Given a linked list. The task is to reverse the order of the elements of the Linked List using an auxiliary Stack. Examples: Input :… Read More »

## Sum of minimum elements of all possible sub-arrays of an array

Given an array arr[], the task is to find the sum of the minimum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

## Sum of maximum elements of all possible sub-arrays of an array

Given an array arr[], the task is to find the sum of the maximum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

## Difference between Stack and Queue Data Structures

Stack A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the… Read More »

## Print the last k nodes of the linked list in reverse order

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

## MakeMyTrip Interview Experience 2019

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/ https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/ Second Round: Problem solving/Project… Read More »

## Check if moves in a stack or queue are possible or not

Given a binary array, where 1 denotes push operation and 0 denotes a pop operation in a stack or queue. The task is to check… Read More »

## Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X

Given an integer X and a binary tree, the task is to count the number of triplet triplets of nodes such that their sum is… Read More »

## Remove all continuous occurrences of ‘a’ and all occurrences of ‘b’

Given a string str, the task is to remove all the continuous occurrences of a and all occurrences of b and print the resultant string.… Read More »

## Subroutine, Subroutine nesting and Stack memory

1. Subroutine – A set of Instructions which are used repeatedly in a program can be referred to as Subroutine. Only one copy of this… Read More »

## Solve the Logical Expression given by string

Given a string str representing a logical expression which consists of the operators | (OR) , & (AND) , ! (NOT) , 0 , 1… Read More »

## Check if the given push and pop sequences of Stack is valid or not

Given push[] and pop[] sequences with distinct values. The task is to check if this could have been the result of a sequence of push… Read More »

## Infix to Postfix using different Precedence Values for In-Stack and Out-Stack

Conversion of infix to postfix expression can be done elegantly using two precedence function. Each operator is assigned a value (larger value means higher precedence)… Read More »

## Sum of minimum elements of all subarrays

Given an array A of n integers. The task is to find the sum of minimum of all possible (contiguous) subarray of A. Examples: Input:… Read More »