<?php
function searchStrings($inputArray, $searchString) {
$results = [];
foreach ($inputArray as $item) {
if (stripos($item, $searchString) !== false) {
$results[] = $item; // Case-insensitive search
}
}
return $results;
}
// Example usage
$data = ['apple', 'banana', 'apricot', 'cherry'];
$searchTerm = 'ap';
$foundItems = searchStrings($data, $searchTerm);
print_r($foundItems); // Output: Array ( [0] => apple [1] => apricot )
?>
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?