Tutorials
Courses

Similar Topics

Web Technologies32.7K+ articles

DSA20.2K+ articles

Misc7.8K+ articles

Mathematical5.2K+ articles

Arrays4.2K+ articles

Strings2.1K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Hash840+ articles

Binary Search529+ articles

DSA / Algorithms / Searching

Searching

1.0K+ posts

Search in row wise sorted matrix

Last Updated: 19 December 2024

Given a row-wise sorted matrixmat[][]and an integerx, the task is to check ifxis present inmat[][]or not. Note that there is no ordering among column elements.Examples:Inp...read more

Divide and Conquer

Search in matrix where only individual columns are sorted

Last Updated: 15 April 2025

Given an n * m semi-sorted 2D matrix, mat[][] where each column is individually sorted in ascending order but the rows are not sorted, and a target element x. The task is ...read more

Divide and Conquer

Intersection of two Arrays

Last Updated: 30 June 2025

Given two arrays a[] and b[], find their intersection — the unique elements that appear in both. Ignore duplicates, and the result can be in any order.Input: a[] = [1, 2, ...read more

union-intersection

Intersection of Two Sorted Arrays

Last Updated: 11 October 2024

Given two sorted arrays a[] and b[], the task is to return intersection. Intersection of two arrays is said to be elements that are common in both arrays. The intersection...read more

article_image

union-intersection

Common Elements in Two Arrays

Last Updated: 17 October 2024

Given two arrays, the task is find common elements of the two arrays. The input arrays may contain duplicates and our job is to find all common elements We are allowed to ...read more

union-intersection

Common Elements in Two Sorted Arrays

Last Updated: 17 October 2024

Given two sorted arrays a[] and b[]. The task is to return the common elements of both arrays. If an element appears more than once in both array, we need to pick minimum ...read more

union-intersection

Union of Two Sorted Arrays

Last Updated: 04 October 2024

Given two sorted arrays a[] and b[], the task is to to returnunionof both the arrays insorted order. Union of two arrays is an array having alldistinctelements that are pr...read more

article_image

union-intersection

2 Sum - Find a pair with given sum

Last Updated: 01 October 2024

Given an array of integers arr[] and an integer target, print a pair of two numbers such that they add up to target. You cannot use the same element twice.Examples:Input: ...read more

4 Sum - Quadruplet Sum Closest to Target

Last Updated: 15 October 2024

Given an array arr[] of n integers and an integer target, the task is to find a quadruplet in arr[] whose sum is closest to target.Note: There may be multiple quadruplets ...read more

two-pointer-algorithm

4 Sum - Find any quadruplet having given sum

Last Updated: 07 October 2024

Given an array arr[] of n integers and an integer target, the task is to find any quadruplet in arr[] such that it's sum is equal to the target. Note: If there are multipl...read more

two-pointer-algorithm

Intersection of Two Sorted Arrays with Distinct Elements

Last Updated: 04 October 2024

Given two sorted arraysa[]andb[] with distinct elements of sizenandm respectively, the task is to find intersection (or common elements) of the two arrays. We need to retu...read more

union-intersection

Implement Lower Bound

Last Updated: 17 October 2024

Given a sorted array arr[] and a number target, the task is to find the lower bound of the target in this given array. The lower bound of a number is defined as the smalle...read more

Implement Upper Bound

Last Updated: 17 October 2024

Given a sorted array arr[] and a number target, the task is to find the upper bound of the target in this given array. The upper bound of a number is defined as the smalle...read more

Search in a Matrix or 2D Array

Last Updated: 30 October 2024

Given a matrix mat[n][m] and an element target. return true if the target is present in the matrix, else return false. Examples:Input : mat[][] = { {10, 51, 9}, ...read more

Commonly Asked Data Structure Interview Questions on Searching

Last Updated: 19 June 2025

Searching is a fundamental concept in computer science, involving the process of finding a specific element in a collection of data. Efficient searching techniques are cru...read more

...