Update 338-counting-bits.md

Author: ajay-dhangar

dsa-solutions/lc-solutions/0300-0399/338-counting-bits.md

@@ -15,7 +15,7 @@ sidebar_position: 5
 
 ## Problem Description
 
-Given an integer `n`, return an array `ans` of length `n + 1` such that for each `i` (0 <= `i` <= `n`), `ans[i]` is the number of `1`s in the binary representation of `i`.
+Given an integer `n`, return an array `ans` of length `n + 1` such that for each `i` (0 &lt;= `i` &lt;= `n`), `ans[i]` is the number of `1`s in the binary representation of `i`.
 
 ### Examples
 
@@ -182,4 +182,4 @@ class Solution:
 {['ImmidiSivani'].map(username => (
  <Author key={username} username={username} />
 ))}
-</div>
+</div>