solved #705 created greedy leetcode solutions

docs/leetcode Solutions/greedy-leetcode-solutions.md

@@ -7,15 +7,25 @@ description: "This document contains solutions to LeetCode DSA problems 1-10 con
 tags: [leetcode, algorithms, problem-solving, DSA, data structure]
 ---
 
+
+
 # Greedy-LeetCode Solutions 1-5
 
+
 ## Questions
 1. [The Two Sneaky Numbers of Digitville](#1-the-two-sneaky-numbers-of-digitville)  
 2. [Design Neighbor Sum Service](#2-design-neighbor-sum-service)  
 3. [Find the Number of Winning Players](#3-find-the-number-of-winning-players)  
 4. [Count Pairs That Form a Complete Day I](#4-count-pairs-that-form-a-complete-day-i)  
 5. [Remove Element](#5-remove-element)  
 
+6. [Remove Duplicates from Sorted Array](#6-remove-duplicates-from-sorted-array)  
+7. [Merge Two Sorted Lists](#7-merge-two-sorted-lists)  
+8. [Generate Parentheses](#8-generate-parentheses)  
+9. [Merge k Sorted Lists](#9-merge-k-sorted-lists)  
+10. [Swap Nodes in Pairs](#10-swap-nodes-in-pairs)  
+
+
 ---
 ## 1. The Two Sneaky Numbers of Digitville
 **Description:** In Digitville, there was a list `nums` containing integers from `0` to `n-1`. Two numbers appeared an additional time, making the list longer than usual. Return an array of the two sneaky numbers that appear twice.