You are given a 2D grid where each cell is either 1 (indicating a server) or 0 (no server). Two servers are said to communicate if they are in the same row or column. The task is to find the number of servers that can communicate with at least one other server.
You are given a list of unique product names and a search word. As each character of the search word is typed, you need to suggest up to three products that have a prefix matching the current search word. If there are more than three products with the same prefix, return the three lexicographically smallest products.
Given two integers tomatoSlices and cheeseSlices, return the number of Jumbo and Small burgers that can be made, such that all tomatoSlices and cheeseSlices are used. If it is not possible, return an empty list.