\n Having a basic understanding of programming languages is essential for solving algorithm problems, which are a crucial element of coding tests. In particular, JavaScript is a language that is essential for web development and frontend fields, and many companies are presenting problems using JavaScript. In this course, we will learn the applicability of JavaScript through the problem of ‘Good Numbers’ and explain the algorithm problem-solving process in detail.\n <\/p>\n
\n The ‘Good Numbers’ problem is about finding numbers that satisfy certain conditions among the given numbers. The specifics of this problem are as follows:\n <\/p>\n
Problem:<\/strong> Given an array of positive integers, write a function that removes duplicates from the array and prints all numbers less than 10. Additionally, calculate the average of the remaining numbers up to one decimal place and return it.<\/p>\n \n Input: An array of positive integers arr ([1, 2, 2, 3, 10, 5, 7, 15]) \n To solve the problem, we need to follow the steps of removing duplicates from the array and calculating the average of the filtered array. We will look at how to perform these tasks step by step using JavaScript.\n <\/p>\n \n We can use the Set object to remove duplicate elements from the array. The Set object does not allow duplicates automatically, so we can easily obtain the desired result using this object.\n <\/p>\n \n Now, we will perform the task of filtering numbers less than 10 from the array with duplicates removed. We can use JavaScript’s filter() method to extract only the elements that meet the condition.\n <\/p>\n \n To calculate the average of the filtered array, we can use the reduce() method. We can get the average by summing all the elements of the array and dividing the total by the number of elements.\n <\/p>\n \n Now, we will integrate all the described processes into a single function to write the final code.\n <\/p>\n \n When the code above is executed, the following result can be obtained.\n <\/p>\n \n The above problem-solving method works well in practical applications. However, when dealing with large datasets, additional considerations regarding performance may be necessary. For example, while using a Set is a convenient way to extract unique values, it may lead to increased memory usage if the size of the array is very large. In such cases, several methods can be considered to improve the algorithm’s performance:\n <\/p>\n \n In this course, we explored the process of solving the ‘Good Numbers’ problem using JavaScript. By removing duplicates, filtering numbers according to conditions, and calculating averages, we were able to enhance our basic algorithm problem-solving skills. It is important to practice solving such problems frequently while preparing for coding tests. I hope you gain a deeper understanding by utilizing the various features of JavaScript.\n <\/p>\n \n If this course has helped you prepare for JavaScript coding tests, try challenging other algorithm problems as well. Feel free to leave any difficulties or questions in the comments. I hope you have the opportunity to share your learning journey and grow together.\n <\/p>\n <\/body><\/p>\n","protected":false},"excerpt":{"rendered":"Input and Output Format<\/h2>\n
\n Output:
\n 1. List of numbers less than 10 after removing duplicates
\n 2. Average of the remaining numbers (up to one decimal place)\n <\/p>\nExample<\/h2>\n
\n Input: [1, 2, 2, 3, 10, 5, 7, 15]\n Output: \n Numbers after removing duplicates (less than 10): [1, 2, 3, 5, 7]\n Average: 3.6\n <\/pre>\n
Problem-Solving Approach<\/h2>\n
Step 1: Remove Duplicates<\/h3>\n
\nconst arr = [1, 2, 2, 3, 10, 5, 7, 15];\nconst uniqueArr = [...new Set(arr)];\nconsole.log(uniqueArr); \/\/ [1, 2, 3, 10, 5, 7, 15]\n <\/code><\/pre>\nStep 2: Filtering<\/h3>\n
\nconst filteredArr = uniqueArr.filter(num => num < 10);\nconsole.log(filteredArr); \/\/ [1, 2, 3, 5, 7]\n <\/code><\/pre>\nStep 3: Calculate Average<\/h3>\n
\nconst average = filteredArr.reduce((acc, num) => acc + num, 0) \/ filteredArr.length;\nconsole.log(average.toFixed(1)); \/\/ 3.6\n <\/code><\/pre>\nComplete Code<\/h2>\n
\nfunction goodNumbers(arr) {\n const uniqueArr = [...new Set(arr)];\n const filteredArr = uniqueArr.filter(num => num < 10);\n const average = filteredArr.reduce((acc, num) => acc + num, 0) \/ filteredArr.length;\n return {\n filteredNumbers: filteredArr,\n average: average.toFixed(1)\n };\n}\n\nconst inputArr = [1, 2, 2, 3, 10, 5, 7, 15];\nconst result = goodNumbers(inputArr);\nconsole.log(result);\n <\/code><\/pre>\nResult<\/h2>\n
\n{\n filteredNumbers: [1, 2, 3, 5, 7],\n average: \"3.6\"\n}\n <\/code><\/pre>\nOptimization and Considerations<\/h2>\n
\n
Conclusion<\/h2>\n
Did You Find This Helpful?<\/h2>\n