Longest Subarray Having Count of 1s One More than Count of 0s

We have given an array of integers. An array contains 1’s and 0’s only. The problem statement asks to find out the length of the longest Sub-Array which having the quantity of 1’s digit is just one more than the count of 0’s in a sub-array. Example Input: arr[] = …

Read moreLongest Subarray Having Count of 1s One More than Count of 0s

Best Time to Buy and Sell Stock  II Leetcode Solution

Problem statement In the problem “Best Time to Buy and Sell Stock  II,” we are given an array where each element in the array contains the price of the given stock on that day. The definition of the transaction is buying one share of stock and selling that one share …

Read moreBest Time to Buy and Sell Stock  II Leetcode Solution

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

Write a function to get the intersection point of two Linked Lists

Problem Statement The problem “Write a function to get the intersection point of two Linked Lists” states that you are given two linked lists. But they are not independent linked lists. They are connected at some point. Now you need to find this point of intersection of these two lists. …

Read moreWrite a function to get the intersection point of two Linked Lists

Longest Bitonic Subsequence

Suppose you have an array of integers, the problem statement asks to find out the longest bitonic subsequence. The bitonic sequence of an array is considered as the sequence which first increases and then decreases. Example arr[] = {1,4,2,76,43,78,54,32,1,56,23} 7 Explanation 1 ⇒ 4 ⇒ 76 ⇒ 78 ⇒ 54 …

Read moreLongest Bitonic Subsequence

Array Queries for multiply replacements and product

The problem “Array Queries for multiply, replacements and product” states that you are given an array of integer and there will be three types of queries, where you have to solve the following type of queries: Type 1: There will be three values left, right and a number X.In this …

Read moreArray Queries for multiply replacements and product

Queries for counts of array elements with values in given range

Problem Statement The problem “Queries for counts of array elements with values in given range” states that you have an integer array and two number x and y. The problem statement asks to find out the count of numbers present in array that lies between the given x and y. …

Read moreQueries for counts of array elements with values in given range