<commit_before>In this exercise, lets try to solve a classic problem.

Bob is a thief. After months of carefuly planning, he finally manages to crack the security systems of a high-class apartment. 

In front of him are many items, each with a value (v) and weight (w). Bob of course wants to maximize the total value he can get; he would gladly take all of the items if he could. However, to his horror, he realized that the knapsack he carried with him can only hold so much weight(W).

Given a knapsack with a specific capacity (W), help Bob determine the maximum value he can get from the items in the house. Note, Bob can only take only one of each item. 

All values given will be strictly positive integers.Items will be represented as a list of pairs, [wi, vi] where the first element `wi` is the weight of the ith item and `vi` is the value for that item.

For example:

Items: [[5, 10], [4, 40], [6, 30], [4, 50]]
Knapsack Limit: 10

For the above, item 1 has weight 5 and value 10, items 2 has weight 4 and value 40, and so on...

Bob should take item 2 and 4 to maximize his value which in this case is 90. He cannot get more than 90 as his knapsack has a weight limit of 10<commit_msg>Update exercises/knapsack/description.md - add space<commit_after>In this exercise, lets try to solve a classic problem.

Bob is a thief. After months of carefuly planning, he finally manages to crack the security systems of a high-class apartment. 

In front of him are many items, each with a value (v) and weight (w). Bob of course wants to maximize the total value he can get; he would gladly take all of the items if he could. However, to his horror, he realized that the knapsack he carried with him can only hold so much weight(W).

Given a knapsack with a specific capacity (W), help Bob determine the maximum value he can get from the items in the house. Note, Bob can only take only one of each item. 

All values given will be strictly positive integers.  Items will be represented as a list of pairs, [wi, vi] where the first element `wi` is the weight of the ith item and `vi` is the value for that item.

For example:

Items: [[5, 10], [4, 40], [6, 30], [4, 50]]
Knapsack Limit: 10

For the above, item 1 has weight 5 and value 10, items 2 has weight 4 and value 40, and so on...

Bob should take item 2 and 4 to maximize his value which in this case is 90. He cannot get more than 90 as his knapsack has a weight limit of 10
{'fraction_non_alphanumeric': 0.054985638079606075, 'fraction_numerical': 0.024620434961017644, 'mean_word_length': 3.7524366471734893, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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': '6698370', 'n_tokens_mistral': 729, 'n_tokens_neox': 649, 'n_words': 459}