## Find maximum sum possible equal sum of three stacks

Given three stack of the positive numbers, the task is to find the possible equal maximum sum of the stacks with removal of top elements… Read More »

- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Introduction to Data Structures | 10 most commonly used Data Structures
- Iterative Postorder traversal | Set 3
- Find maximum in stack in O(1) without using additional stack
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- Check if the two given stacks are same
- Design a stack which can give maximum frequency element
- Reverse the Sentence using Stack
- Delete all even elements from a stack
- Implementing Forward Iterator in BST
- Analyzing BufferOverflow with GDB
- Find all unique pairs of maximum and second maximum elements over all sub-arrays in O(NlogN)
- Python | Stack using Doubly Linked List
- Triplet with a given sum in BST | Set 2
- Nodes from given two BSTs with sum equal to X
- Convert ternary expression to Binary Tree using Stack
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets

Given three stack of the positive numbers, the task is to find the possible equal maximum sum of the stacks with removal of top elements… Read More »

Given array of integer, find the next smaller of next greater element of every element in array. Note : Elements for which no greater element… Read More »

It was a walk-in for experienced candidates actually. Round 1: Machine Coding Round (60 min) Q1. Infix to Postfix conversion e.g. A+(B-C)*D becomes ABC-D*+ Q2.… Read More »

Given an array of integers, the task is to find the maximum absolute difference between the nearest left and the right smaller element of every… Read More »

Hi, I recently appeared for the 1st round of Directi’s recruitment process. Students were divided into 2 slots. The questions for the slots were as… Read More »

Round 1: Online Multiple Choice Questions It comprised of two sections. First section consisted around 15-20 questions related to logical reasoning (Quantitative – Easy-medium-level) and… Read More »

VMWare visited an extension centre of our campus for hiring IT App Developer. Round 1 The first round a written one, conducted on HirePro platform.… Read More »

Accolite visited our campus for recruiting Full time employees as well as interns. The process started with pre-placement talks and then we had to undergo… Read More »

Round 1: ONLINE OBJECTIVE ROUND on HIREPRO platform This round comprised of 30 objective difficult and lengthy paragraph based aptitude questions to be solved in… Read More »

Given a balanced expression, find if it contains duplicate parenthesis or not. A set of parenthesis are duplicate if the same subexpression is surrounded by… Read More »

Intuit was the first company to visit our campus. They selected 6 students. Online Round ———————— Only people with CGPA of 9+ were allowed to… Read More »

I recently go interviewed for MakeMyTrip Developer position. I had 5 rounds: Round 1: 1) Reverse a Linked List – You should be able to… Read More »

We are given queue data structure, the task is to implement stack using only given queue data structure. We have discussed a solution that uses… Read More »

Question: Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return… Read More »

Given two Binary Trees, write a function that returns true if two trees are mirror of each other, else false. For example, the function should… Read More »