formatting

jaebradley · Aug 22, 2017 · df3a1bc · df3a1bc
1 parent 18ac0a8
commit df3a1bc
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/codereview/balancedArraySumIdentifier.md b/codereview/balancedArraySumIdentifier.md
@@ -2,12 +2,12 @@
 
 Extended from [this HackerRank problem](https://www.hackerrank.com/challenges/sherlock-and-array).
 
-> Given an array A of length n, determine if there exists an element in the array such that the sum of the elements on
+> Given an array `A` of length `n`, determine if there exists an element in the array such that the sum of the elements on
 its left is equal to the sum of the elements on its right.
 
 If there are no elements to the left/right, then the sum is considered to be zero.
 
-For example, `[ 1, 1, 1, 2 ]`, the sum of elements to the left and right of index `2`are equal.
+For example, `[ 1, 1, 1, 2 ]`, the sum of elements to the left and right of index `2` are equal.
 
 ## Approach