## Calculate weight of parenthesis based on the given conditions

Given a valid parenthesis string S, the task is to find the weight of parenthesis based on the following conditions: Weight of “( )” is… Read More »

- Stack of Pair in C++ STL with Examples
- C/C++ program for calling main() in main()
- Real-time application of Data Structures
- Maximize sum of topmost elements of S stacks by popping at most N elements
- Range Sum and Update in Array : Segment Tree using Stack
- Append the elements of queue in mirror-inverse order
- Minimum steps required to make an array decreasing
- Static and Dynamic data structures in Java with Examples
- Generate Complete Binary Tree in such a way that sum of non-leaf nodes is minimum
- Program to convert Infix notation to Expression Tree
- Sort array such that absolute difference of adjacent elements is in increasing order
- Difference between Stack and Array
- Print all K-sum levels in a Binary Tree
- Parsing String of symbols to Expression
- Maximum of XOR of first and second maximum of all subarrays
- Output of Java Programs | Set 55 (Java Collections Framework)
- Reverse the elements only at odd positions in the given Array
- Find number of subarrays ending with arr[i] where arr[i] is the minimum element of that subarray
- Find the number of unique pairs satisfying given conditions
- Minimum operation required to make a balanced sequence
- Minimum integer that can be obtained by swapping adjacent digits of different parity
- Stack machine in Computer Organisation
- Sum of decomposition values of all suffixes of an Array
- Maximize removal of adjacent array elements based on their absolute value

Given a valid parenthesis string S, the task is to find the weight of parenthesis based on the following conditions: Weight of “( )” is… Read More »

Given string str, the task is to check if characters at the odd indexes of str form a palindrome string or not. If not then… Read More »

Given a binary tree of N nodes, the task is to print level order traversal in a spiral form. In spiral form, nodes at the… Read More »

Given a string htmlCode which is HTML code of a webpage, the task is to find the missing end tag in the HTML code. Examples:… Read More »

Given an array arr[] of N integers and two numbers K and S, the task is to print all the subsquence of length K with… Read More »

Given a string str, the task is to check if it is possible to split the given string into even length palindromic substrings. Examples: Input:… Read More »

Given an array arr[] of positive and negative integers, the task is to print the array after the removal of adjacent array elements starting from… Read More »

Given an array arr[], the task is to find the sum of decomposition value of the suffixes subarray. Decomposition Value: Decomposition value of a subarray… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

Given S stacks of length M, the task is to maximize the sum of elements at the top of each stack by popping at most… Read More »

Given an array arr[] containing N integers, the task is to rearrange the array such that the odd indexed elements are in reverse order. Examples:… Read More »

Given a string representing infix notation. The task is to convert it to an expression tree. Expression Tree is a binary tree where the operands… Read More »

Given a queue Q containing N strings, the task is to restructure the queue to double its size such that the second half represents the… Read More »

A balanced sequence is defined as a string in which for every opening bracket there are 2 continuous closing brackets. Thus {}}, {{}}}}, {{}}{}}}} are… Read More »

Given a number N, the task is to write C/C++ program to print the number from N to 1 by calling the main() function using… Read More »