{"id":6964,"date":"2022-08-02T23:15:00","date_gmt":"2022-08-02T17:45:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6964"},"modified":"2022-07-08T18:05:29","modified_gmt":"2022-07-08T12:35:29","slug":"richest-customer-wealth-leetcode-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/","title":{"rendered":"Richest Customer Wealth &#8211; Leetcode Solution"},"content":{"rendered":"\n<p>In this post, we are going to solve the<strong> 1672. Richest Customer Wealth<\/strong> problem of Leetcode. This problem <strong>1672. Richest Customer Wealth<\/strong> is a Leetcode <strong>easy <\/strong>level problem. Let&#8217;s see the code, <strong><strong>1672. Richest Customer Wealth<\/strong><\/strong> <strong>&#8211; Leetcode Solution<\/strong>.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-663034a7acf0f\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-663034a7acf0f\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Problem\" title=\"Problem\">Problem<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Example_1\" title=\"Example 1 :\">Example 1 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Example_2\" title=\"Example 2 :\">Example 2 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Example_3\" title=\"Example 3 :\">Example 3 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#Richest_Customer_Wealth_%E2%80%93_Leetcode_Solution\" title=\"Richest Customer Wealth &#8211; Leetcode Solution\">Richest Customer Wealth &#8211; Leetcode Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#1672_Richest_Customer_Wealth_%E2%80%93_Solution_in_Java\" title=\"1672. Richest Customer Wealth &#8211; Solution in Java\">1672. Richest Customer Wealth &#8211; Solution in Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#1672_Richest_Customer_Wealth_%E2%80%93_Solution_in_C\" title=\"1672. Richest Customer Wealth &#8211; Solution in C++\">1672. Richest Customer Wealth &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/richest-customer-wealth-leetcode-solution\/#1672_Richest_Customer_Wealth%E2%80%93_Solution_in_Python\" title=\"1672. Richest Customer Wealth&#8211; Solution in Python\">1672. Richest Customer Wealth&#8211; Solution in Python<\/a><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem\"><\/span><strong>Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>You are given an <code>m x n<\/code> integer grid <code>accounts<\/code> where <code>accounts[i][j]<\/code> is the amount of money the <code>i\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b<sup>th<\/sup><\/code>\u200b\u200b\u200b\u200b customer has in the <code>j<\/code><sup><code>\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200b\u200bth<\/code>\u200b\u200b\u200b\u200b<\/sup> bank. Return <em>the <strong>wealth<\/strong> that the richest customer has.<\/em><\/p>\n\n\n\n<p>A customer&#8217;s <strong>wealth<\/strong> is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum <strong>wealth<\/strong>.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_1\"><\/span><strong>Example 1 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: accounts = &#91;&#91;1,2,3],&#91;3,2,1]]\r\nOutput: 6\r\nExplanation:\r\n1st customer has wealth = 1 + 2 + 3 = 6\r\n2nd customer has wealth = 3 + 2 + 1 = 6\r\nBoth customers are considered the richest with a wealth of 6 each, so return 6.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_2\"><\/span><strong>Example 2 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: accounts = &#91;&#91;1,5],&#91;7,3],&#91;3,5]]\r\nOutput: 10\r\nExplanation: \r\n1st customer has wealth = 6\r\n2nd customer has wealth = 10 \r\n3rd customer has wealth = 8\r\nThe 2nd customer is the richest with a wealth of 10.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_3\"><\/span><strong>Example 3 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: accounts = &#91;&#91;2,8,7],&#91;7,1,3],&#91;1,9,5]]\r\nOutput: 17<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<ul><li><code>m == accounts.length<\/code><\/li><li><code>n == accounts[i].length<\/code><\/li><li><code>1 &lt;= m, n &lt;= 50<\/code><\/li><li><code>1 &lt;= accounts[i][j] &lt;= 100<\/code><\/li><\/ul>\n\n\n\n<p>Now, let&#8217;s see the code of <strong>1672. Richest Customer Wealth<\/strong> &#8211; Leetcode Solution.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Richest_Customer_Wealth_%E2%80%93_Leetcode_Solution\"><\/span><strong><strong><strong>Richest Customer Wealth &#8211; Leetcode Solution<\/strong><\/strong><\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1672_Richest_Customer_Wealth_%E2%80%93_Solution_in_Java\"><\/span><strong><strong><strong><strong><strong><strong><strong>1672. Richest Customer Wealth<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Solution in Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\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=\"\">class Solution {\n    public int maximumWealth(int[][] accounts) {\n        int max = Integer.MIN_VALUE;\n        int sum=0;\n        for(int i=0;i&lt;accounts.length;i++){\n            sum=0;\n            for(int element : accounts[i]){\n                sum+=element;\n                if(sum > max) max=sum;\n            }\n        }\n        return max;\n    }\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1672_Richest_Customer_Wealth_%E2%80%93_Solution_in_C\"><\/span><strong><strong><strong><strong><strong><strong><strong><strong>1672. Richest Customer Wealth<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Solution in <\/strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\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=\"\">class Solution {\npublic:\n    int maximumWealth(vector&lt;vector&lt;int>>&amp; accounts) {\n        int res = 0;\n        for(int i =0;i&lt;accounts.size();i++){\n            int temp = 0;\n            for(int j = 0;j&lt;accounts[i].size();j++){\n                temp+=accounts[i][j];\n            }\n            res = max(res,temp);\n        }\n        return res;\n    }\n};<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1672_Richest_Customer_Wealth%E2%80%93_Solution_in_Python\"><\/span><strong><strong><strong><strong><strong><strong><strong><strong><strong>1672. Richest Customer Wealth<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong>&#8211; Solution in <\/strong><\/strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution:\n    def maximumWealth(self, accounts: List[List[int]]) -> int:\n        wealthy_person=0\n        for balance in accounts:\n            total=sum(balance)\n            wealthy_person=max(wealthy_person,total)\n        return wealthy_person<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong><a href=\"https:\/\/leetcode.com\/problems\/richest-customer-wealth\/\" target=\"_blank\" rel=\"noreferrer noopener\">1672. Richest Customer Wealth<\/a><\/strong> is generated by <strong><a href=\"https:\/\/leetcode.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">Leetcode<\/a> <\/strong>but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we are going to solve the 1672. Richest Customer Wealth problem of Leetcode. This problem 1672. Richest Customer Wealth is a Leetcode easy level problem. Let&#8217;s see the code, 1672. Richest Customer Wealth &#8211; Leetcode Solution.<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[688],"tags":[130,689,718],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6964"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=6964"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6964\/revisions"}],"predecessor-version":[{"id":6967,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6964\/revisions\/6967"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6964"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6964"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6964"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}