Category Archives: Searching

Queries for number of array elements in a range with Kth Bit Set

Given an array arr[] of n positive integers and q queries, in which each query have an integer k. For each query, the task is to output the minimum size of subarray whose binary representation of each elements if concatenated will have at least k number of set bits. If no such array exist, print -1. Examples: Input… Read More »

Linear Search

In this tutorial, you will learn about linear search. Linear search is a very simple and basic search algorithm. It is basically a sequential search algorithm. We have to write a C Program which finds the position of an element in an array using Linear Search Algorithm. Examples : Input : arr[] = {40, 60, 10, 20, 50,… Read More »