## Number of submatrices with OR value 1

Given a N*N binary matrix, task is to find the count of rectangular sub-matrices with OR value 1. Examples: Input : arr[][] = {{0, 0,… Read More »

- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Print the last k nodes of the linked list in reverse order | Recursive approach
- Program to reverse a linked list using Stack
- Difference between Stack and Queue Data Structures
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Print Stack Elements from Bottom to Top
- Iterative Postorder traversal | Set 3
- Find maximum in stack in O(1) without using additional stack
- Sum of maximum elements of all possible sub-arrays of an array
- Sum of bitwise AND of all submatrices
- Sum of minimum elements of all possible sub-arrays of an array
- Sum of Bitwise-OR of all Submatrices
- Check if the two given stacks are same
- Number of submatrices with OR value 1
- Number of submatrices with all 1s
- Print leaf nodes in binary tree from left to right using one stack
- Delete all even elements from a stack
- Reverse the Sentence using Stack
- Design a stack which can give maximum frequency element
- Analyzing BufferOverflow with GDB
- Implementing Forward Iterator in BST
- Nodes from given two BSTs with sum equal to X
- Triplet with a given sum in BST | Set 2

Given a N*N binary matrix, task is to find the count of rectangular sub-matrices with OR value 1. Examples: Input : arr[][] = {{0, 0,… Read More »

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 https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/ https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/ Second Round: Problem solving/Project… 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 »

Given an integer X and a binary tree, the task is to count the number of triplet triplets of nodes such that their sum 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 »