Merge pull request #3357 from Hitesh4278/lexicographically-smallest-string-after-a-swap

Lexicographically-smallest-string-after-a-swap - Issue No 3289

Author: ajay-dhangar

dsa-problems/leetcode-problems/3200-3299.md

@@ -11,7 +11,7 @@ keywords:
 
 export const problems = [
 {
-"problemName": "3216. Lexicographically Smallest String After a Swap",
+"problemName": "3216.Lexicographically Smallest String After a Swap",
 "difficulty": "Easy",
 "leetCodeLink": "https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/description/",
 "solutionLink": "/dsa-solutions/lc-solutions/3200-3299/lexicographically-smallest-string-after-a-swap"

dsa-solutions/lc-solutions/3200-3299/3216-lexicographically-smallest-string-after-a-swap.md

@@ -28,7 +28,7 @@ s[1] == '5' and s[2] == '3' both have the same parity, and swapping them results
 
 ### Constraints
 - `1 <= s.length <= 10^5`
-## Solution for 3216. Lexicographically Smallest String After a Swap
+## Solution for  3216. Lexicographically Smallest String After a Swap
 
 <Tabs>
   <TabItem value="Solution" label="Solution">