Update 0502 - IPO.md

Author: katarianikita2003

dsa-solutions/lc-solutions/0500-0599/0502-IPO.md

@@ -282,7 +282,7 @@ var findMaximizedCapital = function(k, w, profits, capital) {
 3. **Priority Queue Initialization**: Initialize a max-heap (priority queue) to keep track of the most profitable projects that can be started with the current capital.
 4. **Iterative Selection**:
     - For up to `k` times, iterate through the sorted projects.
-    - Push all feasible projects (capital requirement <= current capital) into the max-heap.
+    - Push all feasible projects (capital requirement &lt;= current capital) into the max-heap.
     - If the max-heap is not empty, pop the project with the maximum profit and add its profit to the current capital.
     - Break the loop if no more projects can be started.
 5. **Return Result**: Return the current capital after selecting up to `k` projects.