Basic Update

Author: Hunterdii

.github/FUNDING.yml

@@ -0,0 +1,15 @@
+# These are supported funding model platforms
+
+github: Hunterdii # Replace with up to 4 GitHub Sponsors-enabled usernames e.g., [user1, user2]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+lfx_crowdfunding: # Replace with a single LFX Crowdfunding project-name e.g., cloud-foundry
+polar: # Replace with a single Polar username
+buy_me_a_coffee: het81857 # Replace with a single Buy Me a Coffee username
+thanks_dev: gh/hunterdii # Replace with a single thanks.dev username
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']

.github/ISSUE_TEMPLATE/custom.md

@@ -0,0 +1,10 @@
+---
+name: Custom issue template
+about: Describe this issue template's purpose here.
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+

.github/PULL_REQUEST_TEMPLATE.md

@@ -0,0 +1,12 @@
+## What type of PR is this? (check all applicable)
+
+
+- [ ] 🚀 Add Any Lang Solutions. (e.g., C++, Java, Python)
+- [ ] 📝 Documentation Update (.md File update)
+- [ ] 🌟 ed the repo
+- [ ] 🚩 Other
+ 
+
+## Write Full Code with header & Footer of Code in Solution 
+
+## Description

160 Days Of Problem Solving/GFG - 160 (Arrays)/Day 1 - Second Largest.md

@@ -0,0 +1,189 @@
+---
+Difficulty: Easy
+Source: 160 Days of Problem Solving
+Tags:
+  - Arrays
+  - Searching
+---
+
+# _Day 1. Second Largest_
+
+The problem can be found at the following link: [Problem Link](https://www.geeksforgeeks.org/problems/second-largest3735/1)
+
+## 💡 **Problem Description:**
+
+Given an array of positive integers `arr[]`, return the second largest element from the array. If the second largest element doesn't exist, return `-1`.
+
+**Note:** The second largest element should not be equal to the largest element.
+
+## 🔍 **Example Walkthrough:**
+
+**Input:**
+
+```
+arr[] = [12, 35, 1, 10, 34, 1]
+```
+
+**Output:**
+
+```
+34
+```
+
+**Explanation:**  
+The largest element of the array is 35, and the second largest element is 34.
+
+**Input:**
+
+```
+arr[] = [10, 5, 10]
+```
+
+**Output:**
+
+```
+5
+```
+
+**Explanation:**  
+The largest element of the array is 10, and the second largest element is 5.
+
+**Input:**
+
+```
+arr[] = [10, 10, 10]
+```
+
+**Output:**
+
+```
+-1
+```
+
+**Explanation:**  
+The largest element of the array is 10, and there is no distinct second largest element.
+
+### Constraints:
+
+- $\(2 \leq \text{arr.size()} \leq 10^5\)$
+- $\(1 \leq \text{arr[i]} \leq 10^5\)$
+
+## 🎯 **My Approach:**
+
+1. **Tracking Largest and Second Largest:**
+
+   - Initialize two variables, `first` and `second`, to the smallest possible values.
+   - Traverse through the array:
+     - If the current element is greater than `first`, update `second` to `first`, and then set `first` to the current element.
+     - If the current element is less than `first` but greater than `second`, update `second`.
+   - If no valid second largest element is found, return `-1`.
+
+2. **Edge Cases:**
+   - If all elements are the same, return `-1`.
+   - If the array has only two distinct elements, return the smaller of the two if it’s not equal to the largest.
+
+## 🕒 **Time and Auxiliary Space Complexity**📝
+
+- **Expected Time Complexity:** O(n), where `n` is the number of elements in the array. The algorithm makes a single pass through the array to determine the largest and second largest elements.
+- **Expected Auxiliary Space Complexity:** O(1), as we only use a constant amount of additional space to store `first` and `second`.
+
+## 📝 **Solution Code**
+
+## Code (C++)
+
+```cpp
+class Solution {
+public:
+    int getSecondLargest(const std::vector<int>& arr) {
+        int first = INT_MIN, second = INT_MIN;
+
+        for (int num : arr) {
+            if (num > first) {
+                second = first;
+                first = num;
+            } else if (num > second && num < first) {
+                second = num;
+            }
+        }
+
+        return second == INT_MIN ? -1 : second;
+    }
+};
+```
+
+<details>
+  <summary><h2 align='center'>👨‍💻 Alternative Approaches</h2></summary>
+
+### Alternative Approach (Using Sorting)
+
+```cpp
+class Solution {
+public:
+    int getSecondLargest(std::vector<int>& arr) {
+        std::sort(arr.rbegin(), arr.rend());
+        int first = arr[0];
+        for (int num : arr) {
+            if (num < first) return num;
+        }
+        return -1;
+    }
+};
+```
+
+</details>
+
+## Code (Java)
+
+```java
+class Solution {
+    public int getSecondLargest(int[] arr) {
+        int first = Integer.MIN_VALUE;
+        int second = Integer.MIN_VALUE;
+
+        for (int num : arr) {
+            if (num > first) {
+                second = first;
+                first = num;
+            } else if (num > second && num < first) {
+                second = num;
+            }
+        }
+
+        return second == Integer.MIN_VALUE ? -1 : second;
+    }
+}
+```
+
+## Code (Python)
+
+```python
+class Solution:
+    def getSecondLargest(self, arr):
+        first = float('-inf')
+        second = float('-inf')
+
+        for num in arr:
+            if num > first:
+                second = first
+                first = num
+            elif num > second and num < first:
+                second = num
+
+        return -1 if second == float('-inf') else second
+```
+
+# 🎯 **Contribution and Support:**
+
+For discussions, questions, or doubts related to this solution, feel free to connect on LinkedIn: [Any Questions](https://www.linkedin.com/in/het-patel-8b110525a/). Let’s make this learning journey more collaborative!
+
+⭐ If you find this helpful, please give this repository a star! ⭐
+
+---
+
+<div align="center">
+  <h3><b>📍Visitor Count</b></h3>
+</div>
+
+<p align="center">
+  <img src="https://profile-counter.glitch.me/Hunterdii/count.svg" />
+</p>