Find if there is a subarray with 0 sum

The problem “Find if there is a subarray with 0 sum” states that you are given an integer array containing negative integers as well. The problem statement asks to determine if any sub-array of size at-least 1. This sub-array should have a sum equal to 1. Example arr[] = {2,1,-3,4,5} …

Read moreFind if there is a subarray with 0 sum

Count Substrings with equal number of 0s, 1s and 2s

The problem “Count Substrings with equal number of 0s, 1s and 2s” states that you are given a string that has 0, 1, and 2 only. The problem statement asks to find out the number of substrings that contain equal no of 0, 1, and 2 only. Example str= “01200” …

Read moreCount Substrings with equal number of 0s, 1s and 2s

Print modified array after executing the commands of addition and subtraction

You are given an array of size n, initially all the values in the array will be 0, and the queries. Each query contains the four values, type of the query T, left point of the range, the right point of a range and a number k, you have to …

Read morePrint modified array after executing the commands of addition and subtraction

Find whether a subarray is in form of a mountain or not

Problem Statement The problem “Find whether a subarray is in form of a mountain or not” states that you are given an integer array and a range. The problem statement asks to find out whether the sub-array formed between the given range is in form of a mountain form or …

Read moreFind whether a subarray is in form of a mountain or not

Rearrange a binary string as alternate x and y occurrences

Problem Statement Suppose you are given a binary string, and two numbers x and y. The string consists of 0s and 1s only. The problem “Rearrange a binary string as alternate x and y occurrences” asks to rearrange the string such that the 0 comes x times ⇒ 1 comes …

Read moreRearrange a binary string as alternate x and y occurrences

Check if the given array can represent Level Order Traversal of Binary Search Tree

Problem Statement The problem “Check if the given array can represent Level Order Traversal of Binary Search Tree” states that you are given a level order traversal of the binary search tree. And using the level order traversal of the tree. We need to efficiently find if the level order …

Read moreCheck if the given array can represent Level Order Traversal of Binary Search Tree

Move all negative elements to end in order with extra space allowed

Problem Statement “Move all negative elements to end in order with extra space allowed” states that you are given an array containing positive and negative numbers both. The problem statement asks to move all the negative elements in the last of the array. Example arr[] = { 1,2,-3,-5,2,7,-9,-11 } 1, …

Read moreMove all negative elements to end in order with extra space allowed