Topic: Searching-question / Level: Intermediate

• 261. Implement a program to search for the first occurrence of a character in a string.
• 262. Write a function that counts how many times a target appears in a sorted array.
• 263. Create an algorithm to find the longest chain of pairs in an array.
• 264. Implement a function to check if two strings are anagrams of each other using sorting.
• 265. Write a program that finds the intersection of two linked lists.
• 266. Create a function that searches for the longest valid parentheses substring.
• 267. Implement an algorithm to find the maximum number in a sliding window.
• 268. Write a program that checks if a sequence can be partitioned into subsets with equal sums.
• 269. Create a function that finds the longest substring of digits in a string.
• 270. Implement a program to search for the first occurrence of a pattern in a string.
• 271. Write a function that checks if a number is a power of two using binary search.
• 272. Create an algorithm to find the longest contiguous subarray with a sum equal to k.
• 273. Implement a function that finds the total number of unique paths in a grid.
• 274. Write a program that checks if a list of intervals can be merged.
• 275. Create a function that finds the first missing positive integer in an unsorted array.
• 276. Implement an algorithm to search for the largest sum contiguous subarray.
• 277. Write a program that finds all subsets of a given set.
• 278. Create a function that counts the number of unique elements in two sorted arrays.
• 279. Implement a program to search for a specific item in a retail store inventory.
• 280. Write a function that finds the longest alternating subsequence in an array.
• 281. Create an algorithm to find the shortest path in an unweighted graph.
• 282. Implement a function that finds the total number of distinct elements in a list.
• 283. Write a program that searches for the longest increasing subsequence in a binary tree.
• 284. Create a function to check if a string contains a valid number.
• 285. Implement an algorithm to search for the longest valid substring of parentheses.
• 286. Write a program that finds the smallest missing positive integer from an array.
• 287. Create a function that finds the intersection of two arrays using hash tables.
• 288. Implement a program to search for the first and last occurrence of a number in a rotated array.
• 289. Write a function that counts the number of unique characters in a string.
• 290. Create an algorithm to find the longest subsequence of consecutive elements.

• More Levels

• Beginner
• Advanced