NeetCode #292LC-1268MediumBinary Search
← Back to All Problems#292 · #1268 · Search Suggestions System(搜索推荐系统)
📌 Problem Statement & Constraints
You are given an array of strings
products and a string searchWord. After typing each character of searchWord, return up to three lexicographically smallest product names that have the current prefix. Return the results as a list of lists. Constraints: 1 <= products.length <= 1000, 1 <= products[i].length, searchWord.length <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!