Topic: Searching-question / Level: Intermediate

• 231. Implement a function that finds the majority element in an array.
• 232. Write a program to find the count of distinct elements in a sliding window.
• 233. Create a function that finds all unique triplets in an array that sum up to zero.
• 234. Implement an algorithm to find the two numbers that sum to a specific target.
• 235. Write a program that searches for a path in a maze using backtracking.
• 236. Create a function that finds the longest substring with exactly k distinct characters.
• 237. Implement an algorithm to check if a number exists in a sorted rotated array.
• 238. Write a program that finds the missing number from an array of n-1 integers.
• 239. Create a function that checks if a sequence of numbers can form an arithmetic progression.
• 240. Implement a program to search for a value in a linked list.
• 241. Write a function that finds the kth smallest element in a binary search tree.
• 242. Create an algorithm to find the first non-repeating character in a string.
• 243. Implement a function to find the longest repeating character replacement.
• 244. Write a program that searches for a specific item in a warehouse inventory system.
• 245. Create a function to find the maximum sum of non-adjacent elements in an array.
• 246. Implement an algorithm to search for a string in a case-insensitive manner.
• 247. Write a program to find the smallest element in a sorted and rotated array.
• 248. Create a function to find the longest substring that is a palindrome.
• 249. Implement an algorithm to search for a number in a circularly sorted array.
• 250. Write a program that finds the number of pairs with a given sum in an array.
• 251. Create a function that counts the frequency of each element in an array.
• 252. Implement a program to search for the longest common subsequence in two strings.
• 253. Write a function that finds all the unique elements in an array.
• 254. Create an algorithm to find the shortest path in a weighted graph using binary search.
• 255. Implement a function to search for a value in a binary search tree (BST).
• 256. Write a program to find the smallest and largest element in a binary search tree.
• 257. Create a function that finds the longest subsequence with a specific difference.
• 258. Implement an algorithm to search for an element in a doubly linked list.
• 259. Write a program to find the longest increasing path in a matrix.
• 260. Create a function that checks if a list of numbers contains a valid sequence.

• More Levels

• Beginner
• Advanced