## 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 »

- Check if it is possible to reach a number by making jumps of two given length
- Binary Search (bisect) in Python
- Ternary Search
- Smallest Pair Sum in an array
- Number of elements that can be seen from right side
- Binary Search In JavaScript
- Meta Binary Search | One-Sided Binary Search
- Check if array can be sorted with one swap
- Remove exactly one element from the array such that max - min is minimum
- Number of subarrays have bitwise OR >= K
- Find array elements with frequencies in range [l , r]
- Find length of longest Fibonacci like subsequence
- Longest subarray with elements having equal modulo K
- Minimum in an array which is first decreasing then increasing
- Find a distinct pair (x, y) in given range such that x divides y
- Replace all occurrences of pi with 3.14 in a given string
- Search element in a Spirally sorted Matrix
- Minimize the maximum minimum difference after one removal from array
- Program to find Nth term divisible by a or b
- Queries to check whether a given digit is present in the given Range
- Check if a string contains a palindromic sub-string of even length
- kth smallest/largest in a small range unsorted array
- Check if a pair with given product exists in Linked list
- Nagarro Interview Experience Off-campus
- Length of largest sub-array having primes strictly greater than non-primes
- Largest element in the array that is repeated exactly k times
- Count of strings that become equal to one of the two strings after one removal
- Search in a sorted 2D matrix (Stored in row major order)
- Occurrences of a pattern in binary representation of a number
- Sum and Product of minimum and maximum element of an Array

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »