<commit_before>---
title: 'Divide and Conquer'
date: 2017-08-04
permalink: /posts/2017/08/04/blog-post-1/
---

## 53. Maximum Subarray
<pre>
class Solution(object):
    
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """<commit_msg>Update 2017-08-04-blog-post-1.md<commit_after>---
title: 'Divide and Conquer'
date: 2017-08-04
permalink: /posts/2017/08/04/blog-post-1/
---

In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.

## 53. Maximum Subarray
<pre>
class Solution(object):
    
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
{'fraction_non_alphanumeric': 0.11345381526104417, 'fraction_numerical': 0.04718875502008032, 'mean_word_length': 3.004016064257028, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6623607', 'n_tokens_mistral': 351, 'n_tokens_neox': 307, 'n_words': 111}