debug code and update and also, added video content in DSA

Author: ajay-dhangar

dsa-solutions/lc-solutions/0000-0099/0001-two-sum.md

@@ -1,5 +1,5 @@
 ---
-id: two-sum
+id: 01-two-sum
 title: Two Sum Solution
 sidebar_label: 0001 - Two Sum
 tags:
@@ -577,8 +577,14 @@ The hash table approach is the most efficient and is recommended for large input
 
 :::
 
-## References
 
-- **LeetCode Problem:** [LeetCode Problem](https://leetcode.com/problems/two-sum/)
-- **Solution Link:** [Two Sum Solution on LeetCode](https://leetcode.com/problems/two-sum/solutions/4958021/two-sum-problem-solution-using-hash-table-ts-js-java-py-cpp-recommended-solutions)
-- **Authors LeetCode Profile:** [Ajay Dhangar](https://leetcode.com/ajaydhangar49/)
+
+---
+
+<h2>Authors:</h2>
+
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['ajay-dhangar'].map(username => (
+    <Author key={username} username={username} />
+))}
+</div>

dsa-solutions/lc-solutions/0000-0099/0002-Add-Two-Numbers.md

@@ -1,5 +1,5 @@
 ---
-id: add-two-numbers
+id: 02-add-two-numbers
 title: Add Two Numbers Solution
 sidebar_label: 0002 - Add Two Numbers
 tags:
@@ -362,8 +362,12 @@ Output: [8,9,9,9,0,0,0,1]
 
 :::
 
-## Resources
+---
+
+<h2>Authors:</h2>
 
-- **LeetCode Problem:** [Add Two Numbers Problem](https://leetcode.com/problems/add-two-numbers/)
-- **Solution Link:** [Add Two Numbers Solution on LeetCode](https://leetcode.com/problems/add-two-numbers/solutions/3368572/easy-and-understanding-solution-with-intuition-approach-complexity-and-codes)
-- **Authors LeetCode Profile:** [Ajay Dhangar](https://leetcode.com/ajaydhangar49/), [Amruta Jayanti](https://leetcode.com/u/user7669cY/)
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['ajay-dhangar'].map(username => (
+    <Author key={username} username={username} />
+))}
+</div>

dsa-solutions/lc-solutions/0000-0099/0003-Longest-Substring-Without-Repeating-Characters.md

@@ -1,5 +1,5 @@
 ---
-id: longest-substrings-without-repeating-characters
+id: 03-longest-substrings-without-repeating-characters
 title: Longest Substring Without Repeating Characters (LeetCode)
 sidebar_label: 0003 - Longest Substring Without Repeating Characters
 tags:
@@ -424,7 +424,12 @@ We will test the solution with the sample test cases provided in the problem sta
 
 ## Resources
 
+---
+
+<h2>Authors:</h2>
 
-- **LeetCode Problem:** [Longest Substring Without Repeating Characters on LeetCode](https://leetcode.com/problems/longest-substring-without-repeating-characters/)
-- **Solution Link:** [Longest Substring Without Repeating Characters Solution on LeetCode](https://leetcode.com/problems/longest-substring-without-repeating-characters/solutions/2467813/3-longest-substring-without-repeating-characters-solution-with-full-details)
-- **Authors LeetCode Profile:** [Ajay Dhangar](https://leetcode.com/ajaydhangar49/), [Amruta Jayanti](https://leetcode.com/u/user7669cY/)
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['ajay-dhangar'].map(username => (
+    <Author key={username} username={username} />
+))}
+</div>

dsa-solutions/lc-solutions/0000-0099/0004-Median-of-two-Sorted-Array.md

@@ -806,8 +806,12 @@ The key idea is to use binary search to partition the smaller array in such a wa
 
 :::
 
+---
 
-## References
+<h2>Authors:</h2>
 
-- [LeetCode Problem](https://leetcode.com/problems/median-of-two-sorted-arrays/description/)
-- [GeeksforGeeks Article](https://www.geeksforgeeks.org/median-of-two-sorted-arrays/)
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['ajay-dhangar'].map(username => (
+    <Author key={username} username={username} />
+))}
+</div>

dsa-solutions/lc-solutions/0000-0099/0005-Longest-palindrome-substring.md

@@ -206,6 +206,12 @@ def longestPalindrome(s: str) -> str:
 
 We discussed four approaches to solve the "Longest Palindromic Substring" problem, each with varying complexities and trade-offs. The dynamic programming and center expansion approaches provide a good balance of simplicity and efficiency for practical use cases, while Manacher's algorithm offers the optimal theoretical performance.
 
-```
+---
 
-```
+<h2>Authors:</h2>
+
+<div style={{display: 'flex', flexWrap: 'wrap', justifyContent: 'space-between', gap: '10px'}}>
+{['Yashgabani845', 'ajay-dhangar'].map(username => (
+    <Author key={username} username={username} />
+))}
+</div>

dsa-solutions/lc-solutions/0000-0099/0006-ZigZag-Conversion.md

@@ -16,7 +16,6 @@ The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of
 P   A   H   N
 A P L S I I G
 Y   I   R
-
 ```
 
 And then read line by line: "PAHNAPLSIIGYIR"