@@ -4,7 +4,7 @@ https://leetcode.com/problems/range-sum-query-immutable/[LeetCode - Range Sum Qu
 
 Given an integer array _nums_, find the sum of the elements between indices _i_ and _j_ (_i_ ≤ _j_), inclusive.
 
-*Example:*<br>
+*Example:*
 [subs="verbatim,quotes,macros"]
 ----
 Given nums = [-2, 0, 3, -5, 2, -1]
@@ -15,7 +15,7 @@ sumRange(0, 5) -> -3
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . You may assume that the array does not change.
 . There are many calls to _sumRange_ function.
 
@@ -11,7 +11,7 @@ image::https://leetcode.com/static/images/courses/range_sum_query_2d.png[]
 [.small]#The above rectangle (with the red border) is defined by (row1, col1) = *(2, 1)* and (row2, col2) = *(4, 3)*, which contains sum = *8*.#
 
 
-*Example:*<br>
+*Example:*
 [subs="verbatim,quotes,macros"]
 ----
 Given matrix = [
@@ -28,7 +28,7 @@ sumRegion(1, 2, 2, 4) -> 12
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . You may assume that the matrix does not change.
 . There are many calls to _sumRegion_ function.
 
@@ -24,5 +24,5 @@ return 13.
 ----
 
 
-*Note: *<br>
+*Note: *
 You may assume k is always valid, 1 ≤ k ≤ n^2^.
@@ -14,7 +14,8 @@ Given a non-negative integer _n_ which represents the number of LEDs that are cu
 *Example:*
 [subs="verbatim,quotes,macros"]
 ----
-Input: n = 1<br>Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
+Input: n = 1
+Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
 ----
 
 
 
@@ -32,4 +32,6 @@ XXXX
 ----
 This is an invalid board that you will not receive - as battleships will always have a cell separating between them.
 
-*Follow up:*<br>Could you do it in *one-pass*, using only *O(1) extra memory* and *without modifying* the value of the board?
+*Follow up:*
+
+Could you do it in *one-pass*, using only *O(1) extra memory* and *without modifying* the value of the board?
@@ -14,11 +14,13 @@ A concatenated word is defined as a string that is comprised entirely of at leas
 
 *Output:* ["catsdogcats","dogcatsdog","ratcatdogcat"]
 
-*Explanation:* "catsdogcats" can be concatenated by "cats", "dog" and "cats"; <br> "dogcatsdog" can be concatenated by "dog", "cats" and "dog"; <br>"ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".
+*Explanation:* "catsdogcats" can be concatenated by "cats", "dog" and "cats";
+               "dogcatsdog" can be concatenated by "dog", "cats" and "dog";
+               "ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The number of elements of the given array will not exceed `10,000 `
 . The length sum of elements in the given array will not exceed `600,000`. 
 
@@ -30,7 +30,7 @@ Remember the story of Little Match Girl? By now, you know exactly what matchstic
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length sum of the given matchsticks is in the range of `0` to `10^9`.
 . The length of the given matchstick array will not exceed `15`.
 
@@ -4,7 +4,7 @@ https://leetcode.com/problems/number-complement/[LeetCode - Number Complement]
 
 Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
 
-*Note:*<br>
+*Note:*
 
 . The given integer is guaranteed to fit within the range of a 32-bit signed integer.
 . You could assume no leading zero bit in the integer’s binary representation.
 
@@ -22,7 +22,7 @@ HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . Elements of the given array are in the range of `0 ` to `10^9`
 . Length of the array will not exceed `10^4`. 
 
@@ -36,7 +36,7 @@ Note that the two extra dashes are not needed and can be removed.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length of string S will not exceed 12,000, and K is a positive integer.
 . String S consists only of alphanumerical characters (a-z and/or A-Z and/or 0-9) and dashes(-).