Merge branch 'main' into teamcard

Author: zalabhavy

dsa-problems/gfg-problems/easy/0101-0200.md

@@ -25,7 +25,7 @@ export const problems = [
   {
     "difficulty": "Easy",
     "gfgLink": "https://www.geeksforgeeks.org/problems/index-of-an-extra-element/1",
-    "solutionLink": "#",
+    "solutionLink": "/dsa-solutions/gfg-solutions/easy/index-of-an-extra-element",
     "problemName": "Index of an Extra Element"
   },
   {

dsa-solutions/gfg-solutions/easy/index-of-an-extra-element.md

@@ -0,0 +1,77 @@
+---
+id: index-of-an-extra-element
+title: Index of an Extra Element
+sidebar_label: 0103-Index of an Extra Element
+
+tags:
+  - arrays
+  - searching
+  - data structures
+  - algorithms
+description: "A solution to the problem of determining the index of the extra element in the array "
+---
+
+In this page, we will solve the problem of determining the index of the extra element in the array.
+
+## Problem Description
+
+You have given two sorted arrays arr1[] & arr2[] of distinct elements. The first array has one element extra added in between. Return the index of the extra element.
+
+Note: 0-based indexing is followed.
+
+### Examples
+
+**Example 1:**
+
+```plaintext
+Input: n = 7, arr1[] = {2,4,6,8,9,10,12}, arr2[] = {2,4,6,8,10,12}
+
+Output: 4
+
+Explanation: In the first array, 9 is extra added and it's index is 4.
+```
+
+**Example 2:**
+
+```plaintext
+Input: n = 6, arr1[] = {3,5,7,8,11,13}, arr2[] = {3,5,7,11,13}
+
+Output: 3
+
+Explanation: In the first array, 8 is extra and it's index is 3.
+```
+
+### Constraints
+
+- $1 \leq N \leq10^5$, where $N$ is number of nodes
+- $1 \leq arr1[i], arr2[i] \leq 10^6$
+## Solution
+
+### Intuition and Approach
+
+This problem can be solved by iterating over the array by runnig the loop from o to the length of the smallest array 
+<Tabs>
+ <tabItem value="Inorder Traversal" label="Inorder Traversal">
+
+### Approach: Inorder Traversal
+
+1. Run a for loop from 0 to length of the smallest array.
+2. If at any point in loop the element on ith index of both arrays are different then return the index as it is the answer
+3. If loop runs completely and didn't terminate this means the last index of the largest array is the answer and return that index       
+
+#### Code in Python
+```python
+class Solution:
+    def findExtra(self,n,a,b):
+        for i in range(min(len(a),len(b))):
+            if a[i]!=b[i]:return i
+        return i+1
+```
+
+#### Complexity Analysis
+
+- **Time Complexity:** $O(N)$
+- **Space Complexity:** $O(1)$
+
+</tabItem>
+</Tabs>

dsa-solutions/lc-solutions/0300-0399/0194-transpose-file.md

@@ -0,0 +1,73 @@
+---
+id: transpose-file
+title: Transpose File
+difficulty: Medium
+sidebar_label: 0194-Transpose-File
+tags:
+  - Shell
+  - LeetCode Medium
+---
+
+## Problem Description
+Given a text file `file.txt`, transpose its content.
+
+You may assume that each row has the same number of columns and each field is separated by the `' '` character.
+
+### Example
+**Example 1:**
+```plaintext
+Assume that `file.txt` has the following content:
+name age
+alice 21
+ryan 30
+
+Your script should output the following transposed content:
+name alice ryan
+age 21 30
+```
+
+### Constraints
+- The file `file.txt` will be at most 10^3 lines.
+- Each line in the file will have at most 10^3 characters.
+- Each field in the file is separated by a single space character.
+
+## Solution Approach
+
+### Approach Overview
+We can use a combination of `awk`, `paste`, and `cut` commands in a bash script to transpose the content of the file.
+
+### Detailed Steps
+
+1. **Read Each Line and Store Columns**:
+   - Use `awk` to read each line and store columns in arrays.
+   
+2. **Print Transposed Content**:
+   - Loop through the columns and print them as rows.
+
+## Code Examples
+
+### Shell Script
+```sh
+awk '
+{
+    for (i = 1; i <= NF; i++) {
+        if (NR == 1) {
+            s[i] = $i;
+        } else {
+            s[i] = s[i] " " $i;
+        }
+    }
+}
+END {
+    for (i = 1; i <= NF; i++) {
+        print s[i];
+    }
+}
+' file.txt
+```
+
+## Complexity
+
+- **Time Complexity**: `O(n * m)`, where `n` is the number of rows and `m` is the number of columns. Each element is processed once.
+  
+- **Space Complexity**: `O(n * m)`, as we store each element in memory to perform the transposition.

dsa-solutions/lc-solutions/0300-0399/0195-tenth-line.md

@@ -0,0 +1,89 @@
+---
+id: tenth-line
+title: Tenth Line
+difficulty: Easy
+sidebar_label: 0195-Tenth-Line
+tags:
+  - Shell
+  - LeetCode Easy
+---
+
+## Problem Description
+Given a text file `file.txt`, print just the 10th line of the file.
+
+If the file has less than 10 lines, what should you output? There's no need to output anything (an empty output).
+
+### Example
+**Example 1:**
+```plaintext
+Assume that `file.txt` has the following content:
+Line 1
+Line 2
+Line 3
+Line 4
+Line 5
+Line 6
+Line 7
+Line 8
+Line 9
+Line 10
+
+Your script should output the following:
+Line 10
+```
+
+**Example 2:**
+```plaintext
+Assume that `file.txt` has the following content:
+Line 1
+Line 2
+Line 3
+
+Your script should output nothing since there are less than 10 lines in the file.
+```
+
+### Constraints
+- The file `file.txt` will have at most 10^3 lines.
+- Each line in the file will have at most 10^3 characters.
+
+## Solution Approach
+
+### Approach Overview
+There are multiple ways to achieve this using different shell commands. Here, we demonstrate solutions using `sed`, `awk`, and `tail` with `head`.
+
+### Detailed Steps
+
+1. **Using `sed`**:
+   - The `sed` command can directly print the 10th line.
+
+2. **Using `awk`**:
+   - The `awk` command can be used to check the line number and print the 10th line.
+
+3. **Using `tail` and `head`**:
+   - The `tail` command can be used to get the last lines starting from the 10th, and then `head` can get the first of those lines.
+
+## Code Examples
+
+### Shell Script Using `sed`
+```sh
+# Using sed to print the 10th line
+sed -n '10p' file.txt
+```
+
+### Shell Script Using `awk`
+```sh
+# Using awk to print the 10th line
+awk 'NR == 10' file.txt
+```
+
+### Shell Script Using `tail` and `head`
+```sh
+# Using tail and head to print the 10th line
+tail -n +10 file.txt | head -n 1
+```
+
+## Complexity
+
+- **Time Complexity**: `O(n)`, where `n` is the number of lines in the file. Each line is read once until the 10th line.
+  
+- **Space Complexity**: `O(1)`, as no additional space is used beyond the required output.

dsa-solutions/lc-solutions/0300-0399/0196-delete-duplicate-emails.md

@@ -0,0 +1,81 @@
+---
+id: delete-duplicate-emails
+title: Delete Duplicate Emails
+difficulty: Easy
+sidebar_label: 0196-Delete-Duplicate-Emails
+tags:
+  - SQL
+  - LeetCode Easy
+---
+
+## Problem Description
+Write a SQL query to delete all the duplicate emails, keeping only one unique email with the smallest `id`.
+
+Assume the table `Person` has the following structure:
+```plaintext
++----+------------------+
+| id | email            |
++----+------------------+
+| 1  | john@example.com |
+| 2  | bob@example.com  |
+| 3  | john@example.com |
++----+------------------+
+```
+
+### Example
+**Example 1:**
+```plaintext
+Assume that the `Person` table has the following content:
++----+------------------+
+| id | email            |
++----+------------------+
+| 1  | john@example.com |
+| 2  | bob@example.com  |
+| 3  | john@example.com |
++----+------------------+
+
+Your query should delete the duplicate emails and the result table should look like:
++----+------------------+
+| id | email            |
++----+------------------+
+| 1  | john@example.com |
+| 2  | bob@example.com  |
++----+------------------+
+```
+
+### Constraints
+- The `Person` table will have at most 10^4 rows.
+- Each email in the `Person` table will have at most 100 characters.
+
+## Solution Approach
+
+### Approach Overview
+To delete duplicate emails while keeping the record with the smallest `id`, we can use a subquery to identify the duplicates and then delete them based on their `id`.
+
+### Detailed Steps
+
+1. **Identify Duplicates**:
+   - Use a subquery to find the smallest `id` for each duplicate email.
+   
+2. **Delete Duplicates**:
+   - Delete from the `Person` table where the `id` is not in the list of smallest `id`s for each email.
+
+## Code Examples
+
+### SQL Query
+```sql
+DELETE p1 FROM Person p1
+JOIN Person p2
+ON p1.email = p2.email
+AND p1.id > p2.id;
+```
+
+### Explanation
+- The `JOIN` operation matches each row in the `Person` table with every other row having the same email.
+- The `DELETE` statement removes rows from the `Person` table where the `id` is greater than the smallest `id` for each email, effectively keeping only one unique email with the smallest `id`.
+
+## Complexity
+
+- **Time Complexity**: `O(n^2)` in the worst case, where `n` is the number of rows in the `Person` table, due to the `JOIN` operation. However, for practical purposes with indexing and optimizations, the performance may be better.
+  
+- **Space Complexity**: `O(1)`, as no additional space is required beyond the query execution.