## Number of submatrices with all 1s

Given a N*N matrix containing only 0s and 1s, the task is to count the number of submatrices containing all 1s. Examples: Input : arr[][]… 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
- Maximum XOR value of maximum and second maximum element among all possible subarrays
- 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
- Largest row-wise and column-wise sorted sub-matrix
- 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 N*N matrix containing only 0s and 1s, the task is to count the number of submatrices containing all 1s. Examples: Input : arr[][]… Read More »

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 »

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 »

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 »