## 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 »

- 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 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 »

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 »

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 »

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 »

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving Level order traversal in spiral form Rotate… Read More »

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 »

Recommended: Please try your approach on {IDE} first, before moving on to the solution. Given an integer X and a binary tree, the task is… Read More »

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 »

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 »

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

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 »

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 »

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 »

Given a source stack, copy the contents of the source stack to destination stack maintaining the same order without using extra space. Examples: Input :… Read More »

Implement a stack using single linked list concept. all the single linked list operations perform based on Stack operations LIFO(last in first out) and with… Read More »