Update: description

Author: openset

problems/maximum-xor-of-two-numbers-in-an-array/README.md

@@ -11,21 +11,23 @@
 
 ## 421. Maximum XOR of Two Numbers in an Array (Medium)
 
-<p>Given a <b>non-empty</b> array of numbers, a<sub>0</sub>, a<sub>1</sub>, a<sub>2</sub>, … , a<sub>n-1</sub>, where 0 &le; a<sub>i</sub> < 2<sup>31</sup>.</p>
+<p>Given a <b>non-empty</b> array of numbers, a<sub>0</sub>, a<sub>1</sub>, a<sub>2</sub>, &hellip; , a<sub>n-1</sub>, where 0 &le; a<sub>i</sub> &lt; 2<sup>31</sup>.</p>
 
 <p>Find the maximum result of a<sub>i</sub> XOR a<sub>j</sub>, where 0 &le; <i>i</i>, <i>j</i> &lt; <i>n</i>.</p>
 
 <p>Could you do this in O(<i>n</i>) runtime?</p>
 
-<p><b>Example:</b>
+<p><b>Example:</b></p>
+
 <pre>
 <b>Input:</b> [3, 10, 5, 25, 2, 8]
 
 <b>Output:</b> 28
 
 <b>Explanation:</b> The maximum result is <b>5</b> ^ <b>25</b> = 28.
 </pre>
-</p>
+
+<p>&nbsp;</p>
 
 ### Related Topics
   [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]

problems/partition-equal-subset-sum/README.md

@@ -11,35 +11,40 @@
 
 ## 416. Partition Equal Subset Sum (Medium)
 
-<p>Given a <b>non-empty</b> array containing <b>only positive integers</b>, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
-</p>
+<p>Given a <b>non-empty</b> array containing <b>only positive integers</b>, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.</p>
+
+<p><b>Note:</b></p>
 
-<p><b>Note:</b><br />
 <ol>
-<li>Each of the array element will not exceed 100.</li>
-<li>The array size will not exceed 200.</li>
+	<li>Each of the array element will not exceed 100.</li>
+	<li>The array size will not exceed 200.</li>
 </ol>
-</p>
 
-<p><b>Example 1:</b>
+<p>&nbsp;</p>
+
+<p><b>Example 1:</b></p>
+
 <pre>
 Input: [1, 5, 11, 5]
 
 Output: true
 
 Explanation: The array can be partitioned as [1, 5, 5] and [11].
 </pre>
-</p>
 
-<p><b>Example 2:</b>
+<p>&nbsp;</p>
+
+<p><b>Example 2:</b></p>
+
 <pre>
 Input: [1, 2, 3, 5]
 
 Output: false
 
 Explanation: The array cannot be partitioned into equal sum subsets.
 </pre>
-</p>
+
+<p>&nbsp;</p>
 
 ### Related Topics
   [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]

problems/word-pattern/README.md

@@ -40,7 +40,7 @@
 <strong>Output:</strong> false</pre>
 
 <p><b>Notes:</b><br />
-You may assume <code>pattern</code> contains only lowercase letters, and <code>str</code> contains lowercase letters separated by a single space.</p>
+You may assume <code>pattern</code> contains only lowercase letters, and <code>str</code> contains lowercase letters that may be separated by a single space.</p>
 
 ### Related Topics
   [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]