{"id":971,"date":"2025-08-22T11:23:12","date_gmt":"2025-08-22T05:53:12","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=971"},"modified":"2025-08-22T11:23:14","modified_gmt":"2025-08-22T05:53:14","slug":"candy","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/candy\/","title":{"rendered":"Candy | Leetcode 135 | Brute, Better and Optimal Solution"},"content":{"rendered":"\n

You are given an integer array ratings<\/code> representing the rating of each child standing in a line. You must give candies to these children following two rules:<\/p>\n\n\n\n

    \n
  1. Every child must have at least one candy.<\/li>\n\n\n\n
  2. Children with a higher rating than their immediate neighbor must receive more candies than that neighbor.<\/li>\n<\/ol>\n\n\n\n

    Return the minimum total number of candies required.<\/p>\n\n\n\n

    Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

    Example<\/strong><\/p>\n\n\n\n

    <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
    Input:  ratings = [<\/span>1<\/span>, <\/span>0<\/span>, <\/span>2<\/span>]<\/span><\/span>\nOutput: <\/span>5<\/span><\/span>\nOne optimal distribution: [<\/span>2<\/span>, <\/span>1<\/span>, <\/span>2<\/span>]<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
    <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
    Input:  ratings = [<\/span>1<\/span>, <\/span>2<\/span>, <\/span>2<\/span>]<\/span><\/span>\nOutput: <\/span>4<\/span><\/span>\nOne optimal distribution: [<\/span>1<\/span>, <\/span>2<\/span>, <\/span>1<\/span>]<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
    The challenge is to satisfy both rules while minimizing the total candies.<\/p>\n\n\n
    \n\t\t\t
    \n\t\t\t\t
    Contents:<\/div>\n\t\t\t\t
    \n\t\t\t
    \n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
    \n\t\t\t
    \n\t\t\t\t