Easy Problems on Searching
- Find the largest three elements in an array
- Find the Missing Number
- Find the first repeating element in an array of integers
- Find the missing and repeating number
- Search, insert and delete in a sorted array
- Count 1’s in a sorted binary array
- Two elements whose sum is closest to zero
- Find a pair with the given difference
- k largest(or smallest) elements in an array
- Kth smallest element in a row-wise and column-wise sorted 2D array
- Find common elements in three sorted arrays
- Ceiling in a sorted array
- Floor in a Sorted Array
- Find the maximum element in an array which is first increasing and then decreasing
- Given an array of of size n and a number k, find all elements that appear more than n/k times
Searching Algorithms
Searching algorithms are essential tools in computer science used to locate specific items within a collection of data. These algorithms are designed to efficiently navigate through data structures to find the desired information, making them fundamental in various applications such as databases, web search engines, and more.
Table of Content
- What is Searching?
- Searching terminologies
- Importance of Searching in DSA
- Applications of Searching
- Basics of Searching Algorithms
- Searching Algorithms
- Comparisons Between Different Searching Algorithms
- Library Implementations of Searching Algorithms
- Easy Problems on Searching
- Medium Problems on Searching
- Hard Problems on Searching
Contact Us