## Maximum Subarray Sum Excluding Certain Elements

Given an array of A of n integers and an array B of m integers find the Maximum Contiguous Subarray Sum of array A such… Read More »

- Binary Search a String
- Meta Binary Search | One-Sided Binary Search
- Number of subarrays have bitwise OR >= K
- Distribute N candies among K people
- Search element in a Spirally sorted Matrix
- Minimum in an array which is first decreasing then increasing
- Finding Floor and Ceil of a Sorted Array using C++ STL
- Program to find Nth term divisible by a or b
- Minimum K such that every substring of length atleast K contains a character c
- Search in a sorted 2D matrix (Stored in row major order)
- Find if array has an element whose value is half of array sum
- Find the maximum possible value of the minimum value of modified array
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Count numbers < = N whose difference with the count of primes upto them is > = K
- Number of anomalies in an array
- Count numbers in a range having GCD of powers of prime factors equal to 1
- Floor of every element in same array
- Find element position in given monotonic sequence
- Find minimum speed to finish all Jobs
- Count of Numbers such that difference between the number and sum of its digits not less than L
- Ceiling of every element in same array
- Count elements such that there are exactly X elements with values greater than or equal to X
- Lower Insertion Point

Given an array of A of n integers and an array B of m integers find the Maximum Contiguous Subarray Sum of array A such… Read More »

Binary Search is a searching technique used to search an element in a sorted array. In this article, we will learn about how to implement… Read More »

Given a number n, check it is the Stella Octangula number or not. A number of the form where n is a whole number(0, 1,… Read More »

Given a singly linked list and a key, find key using binary search approach. To perform a Binary search based on Divide and Conquer Algorithm,… Read More »

Given a positive number n and precision p, find the square root of number upto p decimal places using binary search. Note : Prerequisite :… Read More »

Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string. Examples: Input… Read More »

Given two sorted matrices mat1 and mat2 of size n x n of distinct elements. Given a value x. The problem is to count all… Read More »

Given an array of n integers sorted in ascending order, write a function that returns a Fixed Point in the array, if there is any… Read More »

Given a n x n strictly sorted matrix and a value x. The problem is to count the elements smaller than or equal to x… Read More »

Given two lists list1 and list2 containing m and n items respectively. Each item is associated with two fields: name and price. The problem is… Read More »

Given an array arr[] and an integer k, we need to print k maximum elements of given array. The elements should printed in the order… Read More »

Binary search is a popular method of searching in a sorted array or list. It simply divides the list into two halves and discard the… Read More »

Given two integers, n and k. Initially we have a sequence consisting of a single number 1. We need to consider series formed after n… Read More »

Given an integer n, we need to find the number of positive integers whose factorial ends with n zeros. Examples: Input : n = 1… Read More »

We have to paint n boards of length {A1, A2, .. An}. There are k painters available and each takes 1 unit time to paint… Read More »