{"id":4723,"date":"2022-12-05T09:38:55","date_gmt":"2022-12-05T09:38:55","guid":{"rendered":"https:\/\/codethataint.com\/blog\/?p=4723"},"modified":"2022-12-05T12:06:11","modified_gmt":"2022-12-05T12:06:11","slug":"code-challenges-1","status":"publish","type":"post","link":"https:\/\/codethataint.com\/blog\/code-challenges-1\/","title":{"rendered":"Code Challenges 1"},"content":{"rendered":"

Find the Minimum and Maximum Sum<\/strong><\/p>\n

Input Format<\/strong>
\nA single line of five space-separated integers.<\/p>\n

Constraints<\/strong><\/p>\n

  <\/span>   <\/span>\"\[1<arr[i]<10^9\]\"<\/p>\n

Output Format<\/strong>
\nPrint two space-separated long integers denoting the respective minimum and maximum values.<\/p>\n

Sample Input<\/strong><\/p>\n

\r\n1 2 3 4 5\r\n<\/pre>\n
Sample Output<\/strong><\/p>\n
\r\n10 14\r\n<\/pre>\n
    \n
  1. Find the Minimum and Maximum Element in array<\/li>\n
  2. When you calculate the minSum and maxSum – discard the maxElement and minElement<\/li>\n
  3. Trick is you may miss logic if the array contains 5 elements and all are of same value. In such case the maximum and minimum value elements are same<\/li>\n
  4. For finding minimum number, start by assigning maximum number to minNum<\/li>\n<\/ol>\n
    \r\n.\r\n.\r\n public static void miniMaxSum(List<Integer> arr) {\r\n        long minNum = 0;\r\n        long maxNum = 0;\r\n\r\n        long minSum = 0;\r\n        long maxSum = 0;\r\n\r\n\r\n        \/\/To find maximum Number\r\n        for(int num=0;num<arr.size();num++){\r\n            if(maxNum<=arr.get(num)){\r\n                maxNum = arr.get(num);\r\n            }\r\n        }\r\n\r\n        \/\/To find minimum Number\r\n        minNum = maxNum;\r\n\r\n        for(int num=0;num<arr.size();num++){\r\n            if(arr.get(num)<=minNum){\r\n                minNum = arr.get(num);\r\n            }\r\n        }\r\n\r\n        for(int num=0;num<arr.size();num++){\r\n            \/\/If the array elements are of same value\r\n            if(num!=0 && arr.get(num) == arr.get(num-1)){\r\n                minSum +=arr.get(num);\r\n                maxSum +=arr.get(num);\r\n            }\r\n\r\n\r\n            if(arr.get(num) != maxNum)\r\n              minSum +=arr.get(num);\r\n\r\n            if(arr.get(num) != minNum)\r\n              maxSum +=arr.get(num);\r\n        }\r\n\r\n        System.out.println(minSum);\r\n        System.out.println(maxSum);\r\n    }\r\n.\r\n.\r\n<\/pre>\n
    Get Count of biggest Element in array – Total Tallest Candles to be blown<\/strong><\/p>\n
    Input Format<\/strong>
    \nArray of Integers<\/p>\n
    Constraints<\/strong><\/p>\n
       <\/span>   <\/span>\"\[1<candles[i]<10^7\]\"<\/p>\n
    Output Format<\/strong>
    \nCount of Biggest Element in array<\/p>\n
    Sample Input<\/strong><\/p>\n
    \r\n3 2 1 3 5 6 5 4 5\r\n<\/pre>\n
    Sample Output<\/strong><\/p>\n
    \r\n1\r\n<\/pre>\n
      \n
    1. In the above example 6 is the biggest element and it occurs only once<\/li>\n
    2. Find the biggest element in array<\/li>\n
    3. Find the count of the biggest element<\/li>\n<\/ol>\n
      \r\npublic static int birthdayCakeCandles(List<Integer> candles) {\r\n        \/\/ Write your code here\r\n        long tallestCandle = 0;\r\n        int tallestCandleCnt = 0;\r\n\r\n        for(int num=0;num<candles.size();num++){\r\n            if(tallestCandle<=candles.get(num)){\r\n                tallestCandle = candles.get(num);\r\n            }\r\n        }\r\n\r\n        for(int num=0;num<candles.size();num++){\r\n            if(candles.get(num) == tallestCandle)\r\n                tallestCandleCnt +=1;\r\n        }\r\n\r\n        return tallestCandleCnt;\r\n    }\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
      Find the Minimum and Maximum Sum Input Format A single line of five space-separated integers. Constraints     Output Format Print two space-separated long integers denoting the respective minimum and maximum values. Sample Input 1 2 3 4 5 Sample Output 10 14 Find the Minimum and Maximum Element in array When you calculate the… Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[283],"tags":[],"class_list":["post-4723","post","type-post","status-publish","format-standard","hentry","category-code-snippets"],"_links":{"self":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/4723","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/comments?post=4723"}],"version-history":[{"count":5,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/4723\/revisions"}],"predecessor-version":[{"id":4740,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/posts\/4723\/revisions\/4740"}],"wp:attachment":[{"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/media?parent=4723"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/categories?post=4723"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codethataint.com\/blog\/wp-json\/wp\/v2\/tags?post=4723"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}