<commit_before>---
layout: leetcode
date: 2016-06-28
title: Title
tags: [String, Dynamic Programming]
---

* Contents
{:toc #toc_of_keans_blog}

## Question

> Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
>
>Below is one possible representation of s1 = `"great"`:
>
>         great
>        /    \
>       gr    eat
>      / \    /  \
>     g   r  e   at
>                / \
>               a   t<commit_msg>added /leetcode/87 not yet<commit_after>---
layout: leetcode
date: 2016-06-28
title: Scramble String
tags: [String, Dynamic Programming]
---

* Contents
{:toc #toc_of_keans_blog}

## Question

> Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
>
>Below is one possible representation of s1 = `"great"`:
>
>         great
>        /    \
>       gr    eat
>      / \    /  \
>     g   r  e   at
>                / \
>               a   t
{'fraction_non_alphanumeric': 0.10986775178026449, 'fraction_numerical': 0.022380467955239063, 'mean_word_length': 1.8357348703170029, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 25, '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': '221273', 'n_tokens_mistral': 355, 'n_tokens_neox': 322, 'n_words': 107}