Topic: Searching-question / Level: Intermediate

• 201. Implement a binary search algorithm for a sorted array.
• 202. Write a function that finds the square root of a number using binary search.
• 203. Create a program to search for a target value in a rotated sorted array.
• 204. Implement an algorithm to find the peak element in an array using binary search.
• 205. Write a function to search for a range of indices for a given target in a sorted array.
• 206. Create a program that finds the first and last occurrence of a number in a sorted array.
• 207. Implement an algorithm to find the smallest missing positive integer in an array.
• 208. Write a function that checks if a number is a Fibonacci number using binary search.
• 209. Create a program that finds the closest element to a target in a sorted array.
• 210. Implement an algorithm to count the number of occurrences of a number in a sorted array.
• 211. Write a function to find the k-th largest element in an unsorted array.
• 212. Create a program that searches for a value in a 2D matrix.
• 213. Implement a function that finds the longest increasing subsequence in an array.
• 214. Write a program to find the first duplicate number in an unsorted array.
• 215. Create an algorithm to find the intersection of two arrays.
• 216. Implement a function to check if a string can be rearranged to form a palindrome.
• 217. Write a program that finds all anagrams of a string from a list of words.
• 218. Create a function that finds the longest substring without repeating characters.
• 219. Implement an algorithm to perform ternary search on a sorted array.
• 220. Write a function that checks if two strings are permutations of each other.
• 221. Create a program that finds the longest common prefix string among an array of strings.
• 222. Implement a function to determine if a word exists in a crossword puzzle.
• 223. Write a program to search for a pattern in a text using the Rabin-Karp algorithm.
• 224. Create a function that finds the maximum element in a bitonic array.
• 225. Implement an algorithm to find the first occurrence of a string in another string.
• 226. Write a function that checks if a number is prime using a searching method.
• 227. Create a program to search for the longest palindrome in a string.
• 228. Implement a function that finds the longest substring with at most k distinct characters.
• 229. Write a program to find the median of two sorted arrays.
• 230. Create an algorithm to search for an element in a nearly sorted array.

• More Levels

• Beginner
• Advanced