{"id":33482,"date":"2024-11-01T09:17:00","date_gmt":"2024-11-01T09:17:00","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=33482"},"modified":"2024-11-01T11:38:26","modified_gmt":"2024-11-01T11:38:26","slug":"java-coding-test-course-queueing","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/33482\/","title":{"rendered":"Java Coding Test Course, Queueing"},"content":{"rendered":"<div class=\"post\">\n<p>In this lecture, we will cover useful algorithm problems for job preparation using Java. The topic is &#8220;Queue Formation,&#8221; and through this problem, you can enhance your basic understanding of data structures, sorting, and algorithms and develop skills that can be applied in actual coding tests.<\/p>\n<h2>Problem Description<\/h2>\n<p>This is a problem of lining up students based on their heights. We want to arrange students with different heights in a line. In other words, when there are N students and their height information is provided, please write a program that sorts them and outputs their heights in order.<\/p>\n<h3>Input<\/h3>\n<ul>\n<li>The first line contains the number of students N. (1 \u2264 N \u2264 100,000)<\/li>\n<li>The second line contains each student&#8217;s height, separated by spaces. (1 \u2264 height \u2264 200)<\/li>\n<\/ul>\n<h3>Output<\/h3>\n<p>Output the students&#8217; heights in ascending order.<\/p>\n<h2>Example Input<\/h2>\n<pre>\n5\n170 165 180 175 160\n    <\/pre>\n<h2>Example Output<\/h2>\n<pre>\n160 165 170 175 180\n    <\/pre>\n<h2>Problem Solving Process<\/h2>\n<h3>1. Understanding the Problem<\/h3>\n<p>To solve the problem, we first need to clearly understand the requirements. We need to sort the students&#8217; heights provided as input and output them. Considering the possible large input size, it is necessary to choose an efficient sorting algorithm.<\/p>\n<h3>2. Algorithm Selection<\/h3>\n<p>The number of students can be up to 100,000, and each height value ranges from 1 to 200. In this case, we can use comparison-based sorting algorithms such as Quick Sort and Merge Sort, but given the limited range of heights, it is more efficient to use the Counting Sort algorithm.<\/p>\n<h3>3. Explanation of Counting Sort Algorithm<\/h3>\n<p>Counting Sort can perform sorting with a time complexity of O(N + k), where k is the range of values of the data being sorted. In this problem, since each student&#8217;s height is an integer between 1 and 200, k becomes 200. The Counting Sort process is as follows:<\/p>\n<ol>\n<li>Create an array to store the number of times each height appears.<\/li>\n<li>Read each input height one by one and increase the corresponding index.<\/li>\n<li>Output the sorted values using the count array.<\/li>\n<\/ol>\n<h3>4. Java Code Implementation<\/h3>\n<p>Below is the Java code based on the above algorithm:<\/p>\n<pre>\npublic class Main {\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        \n        \/\/ Input number of students N\n        int N = scanner.nextInt();\n        \/\/ Declare array to hold the number of heights (1-200)\n        int[] heightCount = new int[201];\n\n        \/\/ Input heights of students and count them\n        for (int i = 0; i &lt; N; i++) {\n            int height = scanner.nextInt();\n            heightCount[height]++;\n        }\n\n        \/\/ Output sorted heights\n        StringBuilder result = new StringBuilder();\n        for (int i = 1; i &lt;= 200; i++) {\n            while (heightCount[i] &gt; 0) {\n                result.append(i).append(\" \");\n                heightCount[i]--;\n            }\n        }\n        System.out.println(result.toString().trim());\n\n        scanner.close();\n    }\n}\n    <\/pre>\n<h2>5. Code Explanation<\/h2>\n<p>In the code above, we create a count switch array based on the number of students, counting each student&#8217;s height by index. Then, we traverse the count array to output the indices where values exist in the result string.<\/p>\n<h2>6. Time Complexity<\/h2>\n<p>The time complexity of this algorithm is O(N + k). N is the number of students, and k is the range of heights. Therefore, this algorithm is very efficient and suitable for meeting the constraints of the problem.<\/p>\n<h2>Conclusion<\/h2>\n<p>In this lecture, we learned how to solve the &#8220;Queue Formation&#8221; problem using the Counting Sort algorithm. This technique is particularly useful in situations where the range of values is limited or easily predictable. Since you are likely to encounter similar problems in actual coding tests, try to further develop your own algorithm skills!<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>In this lecture, we will cover useful algorithm problems for job preparation using Java. The topic is &#8220;Queue Formation,&#8221; and through this problem, you can enhance your basic understanding of data structures, sorting, and algorithms and develop skills that can be applied in actual coding tests. Problem Description This is a problem of lining up &hellip; <a href=\"https:\/\/atmokpo.com\/w\/33482\/\" class=\"more-link\">\ub354 \ubcf4\uae30<span class=\"screen-reader-text\"> &#8220;Java Coding Test Course, Queueing&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[139],"tags":[],"class_list":["post-33482","post","type-post","status-publish","format-standard","hentry","category-java-coding-test"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/atmokpo.com\/w\/33482\/\" \/>\n<meta property=\"og:locale\" content=\"ko_KR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"In this lecture, we will cover useful algorithm problems for job preparation using Java. The topic is &#8220;Queue Formation,&#8221; and through this problem, you can enhance your basic understanding of data structures, sorting, and algorithms and develop skills that can be applied in actual coding tests. Problem Description This is a problem of lining up &hellip; \ub354 \ubcf4\uae30 &quot;Java Coding Test Course, Queueing&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/33482\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:17:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T11:38:26+00:00\" \/>\n<meta name=\"author\" content=\"root\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:site\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:label1\" content=\"\uae00\uc4f4\uc774\" \/>\n\t<meta name=\"twitter:data1\" content=\"root\" \/>\n\t<meta name=\"twitter:label2\" content=\"\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04\" \/>\n\t<meta name=\"twitter:data2\" content=\"3\ubd84\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"Java Coding Test Course, Queueing\",\"datePublished\":\"2024-11-01T09:17:00+00:00\",\"dateModified\":\"2024-11-01T11:38:26+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/\"},\"wordCount\":468,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"Java Coding Test\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/\",\"url\":\"https:\/\/atmokpo.com\/w\/33482\/\",\"name\":\"Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:17:00+00:00\",\"dateModified\":\"2024-11-01T11:38:26+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/33482\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/33482\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Java Coding Test Course, Queueing\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/atmokpo.com\/w\/#website\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/atmokpo.com\/w\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"ko-KR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"contentUrl\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"width\":400,\"height\":400,\"caption\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\"},\"image\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/x.com\/bebubo4\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\",\"name\":\"root\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"caption\":\"root\"},\"sameAs\":[\"http:\/\/atmokpo.com\/w\"],\"url\":\"https:\/\/atmokpo.com\/w\/author\/root\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/atmokpo.com\/w\/33482\/","og_locale":"ko_KR","og_type":"article","og_title":"Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"In this lecture, we will cover useful algorithm problems for job preparation using Java. The topic is &#8220;Queue Formation,&#8221; and through this problem, you can enhance your basic understanding of data structures, sorting, and algorithms and develop skills that can be applied in actual coding tests. Problem Description This is a problem of lining up &hellip; \ub354 \ubcf4\uae30 \"Java Coding Test Course, Queueing\"","og_url":"https:\/\/atmokpo.com\/w\/33482\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:17:00+00:00","article_modified_time":"2024-11-01T11:38:26+00:00","author":"root","twitter_card":"summary_large_image","twitter_creator":"@bebubo4","twitter_site":"@bebubo4","twitter_misc":{"\uae00\uc4f4\uc774":"root","\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04":"3\ubd84"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/atmokpo.com\/w\/33482\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/33482\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"Java Coding Test Course, Queueing","datePublished":"2024-11-01T09:17:00+00:00","dateModified":"2024-11-01T11:38:26+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/33482\/"},"wordCount":468,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["Java Coding Test"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/33482\/","url":"https:\/\/atmokpo.com\/w\/33482\/","name":"Java Coding Test Course, Queueing - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:17:00+00:00","dateModified":"2024-11-01T11:38:26+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/33482\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/33482\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/33482\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"Java Coding Test Course, Queueing"}]},{"@type":"WebSite","@id":"https:\/\/atmokpo.com\/w\/#website","url":"https:\/\/atmokpo.com\/w\/","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","description":"","publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/atmokpo.com\/w\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"ko-KR"},{"@type":"Organization","@id":"https:\/\/atmokpo.com\/w\/#organization","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","url":"https:\/\/atmokpo.com\/w\/","logo":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/","url":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","contentUrl":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","width":400,"height":400,"caption":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8"},"image":{"@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/x.com\/bebubo4"]},{"@type":"Person","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7","name":"root","image":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","caption":"root"},"sameAs":["http:\/\/atmokpo.com\/w"],"url":"https:\/\/atmokpo.com\/w\/author\/root\/"}]}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/33482","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/comments?post=33482"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/33482\/revisions"}],"predecessor-version":[{"id":33483,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/33482\/revisions\/33483"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=33482"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=33482"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=33482"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}