The coding test is an important element to evaluate the ability to solve realistic problems. In this course, we will address an algorithm problem with the theme of ‘Making Cocktails’ and explain the necessary concepts and methodologies in detail and systematically.<\/p>\n
As a bartender at a bar, you can make various cocktails using different ingredients. Each cocktail requires different ingredients. Your task is to write a program that determines whether you can make each cocktail based on the given ingredients.<\/p>\n
Given a list of available ingredients and a list of cocktails, check whether the ingredients needed to make each cocktail are included in the given list.<\/p>\n
Return an array that outputs whether each cocktail can be made as To solve this problem, you can approach it in the following steps.<\/p>\n First, it would be good to convert the list A of available ingredients into a When checking the ingredients needed to make each cocktail, you need to split each cocktail string by spaces to obtain the list of ingredients and determine if all ingredients in this list are included in A. This process is repeated to check all cocktails.<\/p>\n Now let’s implement this in Java. Below is the complete code:<\/p>\n The time complexity of this algorithm is as follows:<\/p>\ntrue<\/code> or false<\/code>.<\/p>\nExample<\/h3>\n
\nInput:\nA = [\"Gin\", \"Puff\", \"Lemon\", \"Soda\"]\nB = [\"Gin Tonic\", \"Puff Drink\", \"Mojito\"]\n\nOutput:\n[true, true, false]\n<\/pre>\n
Problem Solving Process<\/h2>\n
1. Choose Data Structure<\/h3>\n
Set<\/code> structure. Set<\/code> does not allow duplicates and can check the existence of elements in O(1)<\/code> time complexity. This allows us to quickly check the inclusion of ingredients.<\/p>\n2. Check Cocktail Ingredients<\/h3>\n
3. Implementation<\/h3>\n
import java.util.HashSet;\nimport java.util.Set;\n\npublic class CocktailMaker {\n public static boolean[] canMakeCocktails(String[] availableIngredients, String[] cocktails) {\n \/\/ Add available ingredients to Set\n Set<String> ingredientsSet = new HashSet<>();\n for (String ingredient : availableIngredients) {\n ingredientsSet.add(ingredient);\n }\n\n boolean[] results = new boolean[cocktails.length];\n\n \/\/ Check the ingredients for each cocktail\n for (int i = 0; i < cocktails.length; i++) {\n String[] requiredIngredients = cocktails[i].split(\" \");\n boolean canMake = true;\n\n for (String ingredient : requiredIngredients) {\n if (!ingredientsSet.contains(ingredient)) {\n canMake = false;\n break;\n }\n }\n results[i] = canMake;\n }\n\n return results;\n }\n\n public static void main(String[] args) {\n String[] A = {\"Gin\", \"Puff\", \"Lemon\", \"Soda\"};\n String[] B = {\"Gin Tonic\", \"Puff Drink\", \"Mojito\"};\n\n boolean[] result = canMakeCocktails(A, B);\n for (boolean res : result) {\n System.out.print(res + \" \");\n }\n }\n}\n<\/code><\/pre>\n4. Performance Evaluation<\/h3>\n