Uniform Binary Search
Uniform Binary Search is an optimization of Binary Search algorithm when many searches are made on same array or many arrays of same size. In… Read More »
Category Archives: Searching
Count common characters in two strings
Given two strings s1 and s2 consisting of lowercase English alphabets, the task is to count all the pairs of indices (i, j) from the… Read More »
Partition the array into three equal sum segments
Given an array of n integers, we have to partition the array into three segments such that all the segments have equal sum. Segment sum… Read More »
Find the smallest number X such that X! contains at least Y trailing zeros.
Given an integer Y, find the smallest number X such that X! contains at least Y trailing zeros. Prerequisites – Count trailing zeroes in factorial… Read More »
Find a distinct pair (x, y) in given range such that x divides y
Given a range of positive integers from l to r. Find such a pair of integers (x, y) that l <= x, y <= r,… Read More »
Check if the given array can be reduced to zeros with the given operation performed given number of times
Given an array arr[] of N integers and an integer K, the task is to find whether the given array elements can be made 0… Read More »
Find maximum N such that the sum of square of first N natural numbers is not more than X
Given an integer X, the task is to find the maximum value N such that the sum of first N natural numbers is not more… Read More »
Search an element in given N ranges
Given an array of N sorted ranges and a number K. The task is to find the index of the range in which K lies.… Read More »
Nagarro Interview Experience Off-campus
Round 1: Online Test The test was conducted on Mettle platform. It consisted of 2 sections, Technical MCQs which were based on complexities, data structures,… Read More »
Print all the sum pairs which occur maximum number of times
Given an array arr[] of N distinct integers. The task is to find the sum of two array integers a[i] + a[j] which occurs maximum… Read More »
Two equal sum segment range queries
Given an array arr[] consisting of N positive integers, and some queries consisting of a range [L, R], the task is to find whether the… Read More »
Search element in a Spirally sorted Matrix
Given a spirally sorted matrix with N * N elements and an integer X, the task is to find the position of this given integer… Read More »
Minimum index i such that all the elements from index i to given index are equal
Given an array arr[] of integers and an integer pos, the task is to find the minimum index i such that all the elements from… Read More »
Check if it is possible to reach a number by making jumps of two given length
Given a starting position ‘k’ and two jump sizes ‘d1’ and ‘d2’, our task is to find the minimum number of jumps needed to reach… Read More »
Count of strings that become equal to one of the two strings after one removal
Given two strings str1 and str2, the task is to count all the valid strings. An example of a valid string is given below: If… Read More »