{"id":2025,"date":"2020-07-01T09:51:25","date_gmt":"2020-07-01T09:51:25","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2025"},"modified":"2022-06-17T09:07:35","modified_gmt":"2022-06-17T09:07:35","slug":"arrange-the-salary","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/","title":{"rendered":"Arrange the Salary"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\" alt=\"\" \/><\/p>\n<h3>CONCEPTS USED:<\/h3>\n<blockquote>\n<p>Basic Pointer Manipulation<\/p>\n<\/blockquote>\n<h3>DIFFICULTY LEVEL:<\/h3>\n<blockquote>\n<p>Medium <\/p>\n<\/blockquote>\n<h3>PROBLEM STATEMENT<code>(<\/code>SIMPLIFIED<code>)<\/code>:<\/h3>\n<blockquote>\n<p>Given a linked list of <code>N<\/code> elements and a value <code>X<\/code>, your task is to arrange the list in such a way that all elements less than <code>X<\/code> comes first, then finally all elements greater than or equal to <code>X<\/code>.<\/p>\n<p><strong><em>NOTE<\/em><\/strong> :  You have to maintain the original relative order of the elements at the time of arranging the salary. <\/p>\n<\/blockquote>\n<p><a href=\"https:\/\/mycode.prepbytes.com\/problems\/linked-list\/PRTN\" title=\"Go to mycode.prepbytes.com\" target=\"_blank\" rel=\"noopener noreferrer\"><u><strong><\/strong><\/u><\/a><\/p>\n<h4>For Example:<\/h4>\n<pre><code>Input :  \n\nlist = 9 -&gt; 6 -&gt; 3 -&gt; 7 -&gt; 1 -&gt; 4\nK = 5\n\nOutput: 3 -&gt; 1 -&gt; 4 -&gt; 9 -&gt; 6 -&gt; 7\n\nExplaination : Elements smaller than 5 i.e. 3, 1, 4 are arranged at the starting while elements greater than 5 are arranged after them without changing the relative order of all the elements.<\/code><\/pre>\n<h3>SOLVING APPROACH:<\/h3>\n<p><strong>BRUTE FORCE METHOD<\/strong>:<\/p>\n<blockquote>\n<ol>\n<li>The idea is to create two additional arrays <code>min_arr<\/code> and <code>max_arr<\/code> for storing the elements less than <code>X<\/code> in <code>min_arr<\/code> while to store elements greater than or equal to <code>X<\/code> in <code>max_arr<\/code>.  <\/li>\n<li>Then simply print elements from <code>min_arr<\/code> first and then <code>max_arr<\/code>.<\/li>\n<li>This approach is not <code>efficient<\/code> as it uses additional <code>O(N)<\/code> space.<\/li>\n<\/ol>\n<\/blockquote>\n<h3>SOLUTIONS:<\/h3>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_2111 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_2111 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_2111 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_2111 .wpsm_nav-tabs > li.active > a, #tab_container_2111 .wpsm_nav-tabs > li.active > a:hover, #tab_container_2111 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_2111 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_2111 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_2111 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_2111 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_2111 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_2111 .wpsm_nav-tabs > li > a:hover , #tab_container_2111 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_2111 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_2111 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_2111 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_2111 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_2111 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_2111 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_2111 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_2111 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_2111 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_2111 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_2111 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_2111\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_2111\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_2111_1\" aria-controls=\"tabs_desc_2111_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++ (using STL)<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_2111\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_2111_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n\r\n#include &lt;bits\/stdc++.h&gt;\r\nusing namespace std;\r\ntypedef struct Node {\r\n    int data;\r\n    struct Node *next;\r\n}Node;\r\nNode* temp = NULL;\r\nNode* insert(Node *head, int data) {\r\n    if(head == NULL) {\r\n        head = new Node();\r\n        head-&gt;data = data;\r\n        head-&gt;next = NULL;\r\n        return temp = head;\r\n    }\r\n    Node* node = new Node();\r\n    node-&gt;data = data;\r\n    node-&gt;next = NULL;\r\n    temp-&gt;next = node;\r\n    temp = temp-&gt;next;\r\n    return head;\r\n}\r\n\r\nvoid print(Node *head) {\r\n    if(head-&gt;next == NULL) {\r\n        cout &lt;&lt; head-&gt;data &lt;&lt; &quot; &quot;;\r\n        return;\r\n    }\r\n    cout &lt;&lt; head-&gt;data &lt;&lt; &quot; &quot;;\r\n    print(head-&gt;next);\r\n}\r\n\r\nNode* ArrangeSalary(Node* head, int X) {\r\n\r\n    if(head == NULL || head-&gt;next == NULL)\r\n      return head;\r\n\r\n    Node *temp = head;\r\n\r\n    vector&lt;int&gt; v_min, v_max;\r\n    while(temp != NULL){\r\n      if(temp-&gt;data &lt; X)\r\n        v_min.push_back(temp-&gt;data);\r\n      else\r\n        v_max.push_back(temp-&gt;data);\r\n      temp = temp-&gt;next;\r\n    }\r\n\r\n    temp = head;\r\n\r\n    while(temp != NULL){\r\n      if(!v_min.empty()){\r\n        temp-&gt;data = v_min.front();\r\n        v_min.erase(v_min.begin());\r\n      }\r\n      else if(!v_max.empty()){\r\n        temp-&gt;data = v_max.front();\r\n        v_max.erase(v_max.begin());\r\n      }\r\n\r\n      temp = temp-&gt;next;\r\n    }\r\n    return head;\r\n\r\n}\r\n\r\nint main()\r\n{\r\n\r\n    Node *head = NULL;\r\n    Node *ptr = NULL;\r\n    int n, X;\r\n    cin &gt;&gt; n &gt;&gt;X;\r\n    for(int i=0; i&lt;n; i++) {\r\n        int data;\r\n        cin &gt;&gt; data;\r\n        head = insert(head, data);\r\n    }\r\n    head = ArrangeSalary(head, X);\r\n    print(head);\r\n    cout &lt;&lt; endl;\r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_2111 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_2111 a\"),jQuery(\"#tab-content_2111\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p><strong>EFFICIENT METHOD<\/strong>:<\/p>\n<blockquote>\n<ol>\n<li>\n<p>The idea is to create two linked list and initialize their head nodes as NULL &#8211;<\/p>\n<ul>\n<li><code>smaller<\/code> list of values smaller than <code>X<\/code>.  <\/li>\n<li><code>larger<\/code> list of values greater than or equal to <code>X<\/code>.<\/li>\n<\/ul>\n<\/li>\n<li>\n<p>Now traverse the original list and if an element is less than <code>X<\/code>, append it to the end of the <code>smaller<\/code> list else append it to the end of the <code>larger<\/code> list. Finally concatenate both the <code>smaller<\/code> and <code>larger<\/code> lists to form the resultant list.<\/p>\n<\/li>\n<\/ol>\n<\/blockquote>\n<h3>SOLUTIONS:<\/h3>\n<p>\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_2036 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_2036 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_2036 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_2036 .wpsm_nav-tabs > li.active > a, #tab_container_2036 .wpsm_nav-tabs > li.active > a:hover, #tab_container_2036 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_2036 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_2036 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_2036 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_2036 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_2036 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_2036 .wpsm_nav-tabs > li > a:hover , #tab_container_2036 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_2036 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_2036 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_2036 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_2036 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_2036 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_2036 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_2036 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_2036 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_2036 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_2036 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_2036 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_2036\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_2036\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_2036_1\" aria-controls=\"tabs_desc_2036_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_2036_2\" aria-controls=\"tabs_desc_2036_2\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_2036_3\" aria-controls=\"tabs_desc_2036_3\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Java<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_2036\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_2036_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"c\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n\r\n#include &lt;stdio.h&gt;\r\n#include &lt;string.h&gt;\r\n#include &lt;stdlib.h&gt;\r\ntypedef struct Node {\r\n    int data;\r\n    struct Node *next;\r\n}Node;\r\nNode* getNode (Node*head, int val)\r\n{\r\n    Node *element = (Node*) malloc(sizeof(Node));\r\n    element-&gt;data = val ;\r\n    element-&gt;next = NULL ;\r\n    Node *temp = head ;\r\n    if ( head == NULL ) {\r\n        head = element ;\r\n        head-&gt;next = NULL ;\r\n        return head ;\r\n    }\r\n    while (temp-&gt;next != NULL)\r\n        temp = temp-&gt;next ;\r\n    temp-&gt;next = element ;\r\n    element-&gt;next = NULL ;\r\n    return head ;\r\n}\r\n\r\n\r\nvoid print(Node *head) {\r\n    if(head-&gt;next == NULL) {\r\n        printf(&quot;%d &quot;, head-&gt;data);\r\n        return;\r\n    }\r\n    printf(&quot;%d &quot;, head-&gt;data);\r\n    print(head-&gt;next);\r\n}\r\n\r\nNode* ArrangeSalary(Node* head, int X) {\r\n\r\n  \/* if list has 0 or 1 elements then return *\/\r\n  if(head == NULL || head-&gt;next == NULL)\r\n    return head;\r\n\r\n  \/* create two lists one for storing smaller elements than X and\r\n    another for storing greater than or equal to elements than X *\/\r\n\r\n  \/* head pointer for smaller list *\/\r\n  Node *smaller = NULL ;\r\n\r\n  \/*pointer to the last element in the smaller list *\/\r\n  Node *temp_smaller;\r\n\r\n   \/* head pointer for greater list *\/\r\n  Node *greater = NULL ;\r\n\r\n  \/*pointer to the last element in the greater list *\/\r\n  Node *temp_greater ;\r\n\r\n  Node *temp = head;\r\n\r\n  while(temp != NULL){\r\n    Node* t = temp;\r\n    temp = temp -&gt; next;\r\n\r\n    if(t-&gt;data &lt; X){\r\n      if(smaller == NULL){\r\n        smaller = t;\r\n        temp_smaller = t;\r\n        t -&gt; next = NULL;\r\n      }\r\n      else{\r\n        temp_smaller -&gt; next = t;\r\n        t -&gt; next = NULL;\r\n        temp_smaller = t;\r\n      }\r\n\r\n    }\r\n    else{\r\n      if(greater == NULL){\r\n        greater = t;\r\n        temp_greater = t;\r\n        t -&gt; next = NULL;\r\n      }\r\n      else{\r\n        temp_greater -&gt; next = t;\r\n        t -&gt; next = NULL;\r\n        temp_greater = t;\r\n      }\r\n    }\r\n  }\r\n\r\n  \/* concatenating both smaller and greater lists *\/\r\n  temp_smaller -&gt; next = greater;\r\n\r\n  return smaller;\r\n\r\n}\r\nint main()\r\n{\r\n\r\n    Node *head = NULL;\r\n    int n, X;\r\n    scanf(&quot;%d %d&quot;, &amp;n,&amp;X);\r\n    for(int i=0; i&lt;n; i++) {\r\n        int data;\r\n        scanf(&quot;%d&quot;, &amp;data);\r\n        head = getNode(head, data);\r\n    }\r\n    head = ArrangeSalary(head, X);\r\n    print(head);\r\n    printf(&quot;&#92;n&quot;);\r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\r\n\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_2036_2\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n\r\n#include &lt;bits\/stdc++.h&gt;\r\nusing namespace std;\r\ntypedef struct Node {\r\n    int data;\r\n    struct Node *next;\r\n}Node;\r\nNode* temp = NULL;\r\nNode* insert(Node *head, int data) {\r\n    if(head == NULL) {\r\n        head = new Node();\r\n        head-&gt;data = data;\r\n        head-&gt;next = NULL;\r\n        return temp = head;\r\n    }\r\n    Node* node = new Node();\r\n    node-&gt;data = data;\r\n    node-&gt;next = NULL;\r\n    temp-&gt;next = node;\r\n    temp = temp-&gt;next;\r\n    return head;\r\n}\r\n\r\nvoid print(Node *head) {\r\n    if(head-&gt;next == NULL) {\r\n        cout &lt;&lt; head-&gt;data &lt;&lt; &quot; &quot;;\r\n        return;\r\n    }\r\n    cout &lt;&lt; head-&gt;data &lt;&lt; &quot; &quot;;\r\n    print(head-&gt;next);\r\n}\r\n\r\nNode* ArrangeSalary(Node* head, int X) {\r\n\r\n  \/* if list has 0 or 1 elements then return *\/\r\n  if(head == NULL || head-&gt;next == NULL)\r\n    return head;\r\n\r\n  \/* create two lists one for storing smaller elements than X and\r\n    another for storing greater than or equal to elements than X *\/\r\n\r\n  \/* head pointer for smaller list *\/\r\n  Node *smaller = NULL ;\r\n\r\n  \/*pointer to the last element in the smaller list *\/\r\n  Node *temp_smaller= NULL;\r\n\r\n   \/* head pointer for greater list *\/\r\n  Node *greater = NULL ;\r\n\r\n  \/*pointer to the last element in the greater list *\/\r\n  Node *temp_greater = NULL;\r\n\r\n  Node *temp = head;\r\n\r\n  while(temp != NULL){\r\n    Node* t = temp;\r\n    temp = temp -&gt; next;\r\n\r\n    if(t-&gt;data &lt; X){\r\n      if(smaller == NULL){\r\n        smaller = t;\r\n        temp_smaller = t;\r\n        t -&gt; next = NULL;\r\n      }\r\n      else{\r\n        temp_smaller -&gt; next = t;\r\n        t -&gt; next = NULL;\r\n        temp_smaller = t;\r\n      }\r\n\r\n    }\r\n    else{\r\n      if(greater == NULL){\r\n        greater = t;\r\n        temp_greater = t;\r\n        t -&gt; next = NULL;\r\n      }\r\n      else{\r\n        temp_greater -&gt; next = t;\r\n        t -&gt; next = NULL;\r\n        temp_greater = t;\r\n      }\r\n    }\r\n  }\r\n\r\n  \/* concatenating both smaller and greater lists *\/\r\n  temp_smaller -&gt; next = greater;\r\n\r\n  return smaller;\r\n}\r\n\r\nint main()\r\n{\r\n\r\n    Node *head = NULL;\r\n    Node *ptr = NULL;\r\n    int n, X;\r\n    cin &gt;&gt; n &gt;&gt;X;\r\n    for(int i=0; i&lt;n; i++) {\r\n        int data;\r\n        cin &gt;&gt; data;\r\n        head = insert(head, data);\r\n    }\r\n    head = ArrangeSalary(head, X);\r\n    print(head);\r\n    cout &lt;&lt; endl;\r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_2036_3\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"java\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n\r\nimport java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n    static class SinglyLinkedListNode {\r\n        public int value;\r\n        public SinglyLinkedListNode next;\r\n\r\n        public SinglyLinkedListNode(int nodeData) {\r\n            this.value = nodeData;\r\n            this.next = null;\r\n        }\r\n    }\r\n\r\n    static class SinglyLinkedList {\r\n        public SinglyLinkedListNode head;\r\n        public SinglyLinkedListNode tail;\r\n\r\n        public SinglyLinkedList() {\r\n            this.head = null;\r\n            this.tail = null;\r\n        }\r\n\r\n        public void insertNode(int nodeData) {\r\n            SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);\r\n\r\n            if (this.head == null) {\r\n                this.head = node;\r\n            } else {\r\n                this.tail.next = node;\r\n            }\r\n\r\n            this.tail = node;\r\n        }\r\n    }\r\n\r\n    static void printLinkedList(SinglyLinkedListNode head) {\r\n        SinglyLinkedListNode temp = head;\r\n        while (temp != null) {\r\n            System.out.print(temp.value + \" \");\r\n            temp = temp.next;\r\n        }\r\n        System.out.println();\r\n    }\r\n\r\nstatic SinglyLinkedListNode ArrangeSalary(SinglyLinkedListNode head, int X) {\r\n\r\n    \/* if list has 0 or 1 elements then return *\/\r\n    if(head == null || head.next == null)\r\n      return head;\r\n\r\n    \/* create two lists one for storing smaller elements than X and\r\n      another for storing greater than or equal to elements than X *\/\r\n\r\n    \/* head pointer for smaller list *\/\r\n    SinglyLinkedListNode smaller = null;\r\n\r\n    \/*pointer to the last element in the smaller list *\/\r\n    SinglyLinkedListNode temp_smaller = null;\r\n\r\n     \/* head pointer for greater list *\/\r\n    SinglyLinkedListNode greater = null;\r\n\r\n    \/*pointer to the last element in the greater list *\/\r\n    SinglyLinkedListNode temp_greater = null;\r\n\r\n    SinglyLinkedListNode temp = head;\r\n\r\n    while(temp != null){\r\n      SinglyLinkedListNode t = temp;\r\n      temp = temp.next;\r\n\r\n      if(t.value < X){\r\n        if(smaller == null){\r\n          smaller = t;\r\n          temp_smaller = t;\r\n          t.next = null;\r\n        }\r\n        else{\r\n          temp_smaller.next = t;\r\n          t.next = null;\r\n          temp_smaller = t;\r\n        }\r\n\r\n      }\r\n      else{\r\n        if(greater == null){\r\n          greater = t;\r\n          temp_greater = t;\r\n          t.next = null;\r\n        }\r\n        else{\r\n          temp_greater.next = t;\r\n          t.next = null;\r\n          temp_greater = t;\r\n        }\r\n      }\r\n    }\r\n\r\n    \/* concatenating both smaller and greater lists *\/\r\n    temp_smaller.next = greater;\r\n\r\n      return smaller;\r\n}\r\n\r\n\r\n    private static final Scanner scanner = new Scanner(System.in);\r\n\r\n    public static void main(String[] args) throws IOException {\r\n\r\n        SinglyLinkedList llist = new SinglyLinkedList();\r\n        int size = scanner.nextInt();\r\n        int X = scanner.nextInt();\r\n\r\n        for (int i = 0; i < size; i++) {\r\n            int llistItem = scanner.nextInt();\r\n\r\n            llist.insertNode(llistItem);\r\n        }\r\n        SinglyLinkedListNode temp = ArrangeSalary(llist.head, X);\r\n        printLinkedList(temp);\r\n\r\n    }\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_2036 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_2036 a\"),jQuery(\"#tab-content_2036\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t<br \/>\n<strong>Space Complexity:<\/strong> <code>O(1)<\/code><\/p>\n<p>[forminator_quiz id=&quot;2131&quot;]<\/p>\n<p>This article tried to discuss the concept of <strong>Basic Pointer Manipulation<\/strong>. Hope this blog helps you understand the concept of Basic Pointer Manipulatio. To practice more problems you can check out <a href=\"#\">MYCODE|COMPETITIVE PROGRAMMING<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>CONCEPTS USED: Basic Pointer Manipulation DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given a linked list of N elements and a value X, your task is to arrange the list in such a way that all elements less than X comes first, then finally all elements greater than or equal to X. NOTE : You have to [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[132],"tags":[],"class_list":["post-2025","post","type-post","status-publish","format-standard","hentry","category-basic-pointer-manipulation"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Arrange the Salary | Basic Pointer Manipulation | Prepbytes<\/title>\n<meta name=\"description\" content=\"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Arrange the Salary | Basic Pointer Manipulation | Prepbytes\" \/>\n<meta property=\"og:description\" content=\"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2020-07-01T09:51:25+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-06-17T09:07:35+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Arrange the Salary\",\"datePublished\":\"2020-07-01T09:51:25+00:00\",\"dateModified\":\"2022-06-17T09:07:35+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\"},\"wordCount\":238,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\",\"articleSection\":[\"Basic Pointer Manipulation\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\",\"name\":\"Arrange the Salary | Basic Pointer Manipulation | Prepbytes\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\",\"datePublished\":\"2020-07-01T09:51:25+00:00\",\"dateModified\":\"2022-06-17T09:07:35+00:00\",\"description\":\"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Basic Pointer Manipulation\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/basic-pointer-manipulation\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Arrange the Salary\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Arrange the Salary | Basic Pointer Manipulation | Prepbytes","description":"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.","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:\/\/prepbytes.com\/blog\/arrange-the-salary\/","og_locale":"en_US","og_type":"article","og_title":"Arrange the Salary | Basic Pointer Manipulation | Prepbytes","og_description":"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.","og_url":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2020-07-01T09:51:25+00:00","article_modified_time":"2022-06-17T09:07:35+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Arrange the Salary","datePublished":"2020-07-01T09:51:25+00:00","dateModified":"2022-06-17T09:07:35+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/"},"wordCount":238,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png","articleSection":["Basic Pointer Manipulation"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/","url":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/","name":"Arrange the Salary | Basic Pointer Manipulation | Prepbytes","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png","datePublished":"2020-07-01T09:51:25+00:00","dateModified":"2022-06-17T09:07:35+00:00","description":"The Idea Is to Create Two Additional Arrays Min_arr and Max_arr for Storing the Elements Less Than X in Min_arr While to Store Elements Greater Than or Equal to X in Max_arr.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/arrange-the-salary\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645095644369-Article_256.png"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/arrange-the-salary\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Basic Pointer Manipulation","item":"https:\/\/prepbytes.com\/blog\/category\/basic-pointer-manipulation\/"},{"@type":"ListItem","position":3,"name":"Arrange the Salary"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/2025","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=2025"}],"version-history":[{"count":12,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/2025\/revisions"}],"predecessor-version":[{"id":8288,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/2025\/revisions\/8288"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=2025"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=2025"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=2025"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}