## Delete consecutive same words in a sequence

Given a sequence of n strings, the task is to check if any two similar words come together then they destroy each other then print… Read More »

- Introduction to Data Structures | 10 most commonly used Data Structures
- 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
- Implementing Forward Iterator in BST
- Reverse the Sentence using Stack
- Analyzing BufferOverflow with GDB
- Python | Stack using Doubly Linked List
- Find all unique pairs of maximum and second maximum elements over all sub-arrays in O(NlogN)
- 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
- Stack in Python
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets

Given a sequence of n strings, the task is to check if any two similar words come together then they destroy each other then print… Read More »

How to Implement stack using a priority queue(using min heap)?. Asked In: Microsoft, Adobe. Recommended: Please try your approach on {IDE} first, before moving on… Read More »

Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out)… Read More »

Given an array, find maximum sum of smallest and second smallest elements chosen from all possible subarrays. More formally, if we write all (nC2) subarrays… Read More »

There are some natural number whose all permutation is greater than or equal to that number eg. 123, whose all the permutation (123, 231, 321)… Read More »

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 »