leetcode

Author: ayoubzulfiqar

Create-File.ps1

@@ -0,0 +1,22 @@
+Param(
+    [Parameter(Mandatory=$true)]
+    [string]$FileName
+)
+
+# Convert the file name to lowercase
+$NewFileName = $FileName.ToLower()
+
+# Replace spaces with underscores
+$NewFileName = $NewFileName -replace '\s', '_'
+
+# Check if the file already exists
+if (Test-Path -Path $NewFileName -PathType Leaf) {
+    Write-Output "File '$NewFileName' already exists."
+    # You can choose to skip the creation of the new file or rename the existing file here.
+}
+else {
+    # Create a new file with the modified name
+    $NewFile = New-Item -ItemType File -Path $NewFileName -ErrorAction Stop
+    # Output the new file name
+    Write-Output "New file created: $NewFileName"
+}

Create-Folder.ps1

@@ -0,0 +1,38 @@
+param (
+    [Parameter(Mandatory=$true)]
+    [string]$folderName
+)
+
+# Function to capitalize the first letter of each word
+function Capitalize-FirstLetter {
+    param (
+        [Parameter(Mandatory=$true, ValueFromPipeline=$true, ValueFromPipelineByPropertyName=$true)]
+        [string]$string
+    )
+
+    $cultureInfo = (Get-Culture).TextInfo
+    $cultureInfo.ToTitleCase($string.ToLower())
+}
+
+# Split the folder name into individual words
+$words = $folderName -split ' '
+
+# Remove spaces from each word and capitalize the first letter
+$capitalizedWords = foreach ($word in $words) {
+    $word = $word -replace '\s', ''
+    Capitalize-FirstLetter -string $word
+}
+
+# Join the capitalized words back into a single string
+$folderName = $capitalizedWords -join ''
+
+# Check if the folder already exists
+if (Test-Path $folderName) {
+    Write-Host "Folder '$folderName' already exists."
+    exit 1
+}
+
+# Create the folder
+New-Item -ItemType Directory -Path $folderName -Force | Out-Null
+
+Write-Host "Folder '$folderName' created successfully."

FizzBuzz/fizz_buzz.go

@@ -35,3 +35,20 @@ func fizzBuzz2(n int) []string {
 	}
 	return answer
 }
+
+func fizzBuzz3(n int) []string {
+	answer := make([]string, n)
+	for i := 1; i <= n; i++ {
+		switch {
+		case i%3 == 0 && i%5 == 0:
+			answer[i-1] = "FizzBuzz"
+		case i%3 == 0:
+			answer[i-1] = "Fizz"
+		case i%5 == 0:
+			answer[i-1] = "Buzz"
+		default:
+			answer[i-1] = fmt.Sprintf("%d", i)
+		}
+	}
+	return answer
+}

README.md

@@ -228,6 +228,7 @@ This repo contain leetcode solution using DART and GO programming language. Most
 - [**744.** Find Smallest Letter Greater Than Target](FindSmallestLetterGreaterThanTarget/find_smallest_letter_greater_than_target.dart)
 - [**1802.** Maximum Value at a Given Index in a Bounded Array](MaximumValueAtAGivenIndexInABoundedArray/maximum_value_at_a_given_index_in_a_bounded_array.dart)
 - [**412.** Fizz Buzz](FizzBuzz/fizz_buzz.dart)
+- [**414.** Third Maximum Number](ThirdMaximumNumber/third_maximum_number.dart)
 
 ## Reach me via
 

ThirdMaximumNumber/third_maximum_number.dart

@@ -0,0 +1,59 @@
+/*
+
+-* 414. Third Maximum Number *-
+
+Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.
+
+ 
+
+Example 1:
+
+Input: nums = [3,2,1]
+Output: 1
+Explanation:
+The first distinct maximum is 3.
+The second distinct maximum is 2.
+The third distinct maximum is 1.
+Example 2:
+
+Input: nums = [1,2]
+Output: 2
+Explanation:
+The first distinct maximum is 2.
+The second distinct maximum is 1.
+The third distinct maximum does not exist, so the maximum (2) is returned instead.
+Example 3:
+
+Input: nums = [2,2,3,1]
+Output: 1
+Explanation:
+The first distinct maximum is 3.
+The second distinct maximum is 2 (both 2's are counted together since they have the same value).
+The third distinct maximum is 1.
+ 
+
+Constraints:
+
+1 <= nums.length <= 104
+-231 <= nums[i] <= 231 - 1
+ 
+
+Follow up: Can you find an O(n) solution?
+
+
+*/
+
+class Solution {
+  int thirdMax(List<int> nums) {
+    Set<int> unique = Set<int>()..addAll(nums..sort((a, b) => a - b));
+    if (unique.length < 3) {
+      return unique.elementAt(unique.length - 3);
+    }
+    return unique.elementAt(unique.length - 3);
+  }
+}
+
+void main() {
+  final Solution sol = Solution();
+  print(sol.thirdMax([2, 2, 3, 1]));
+}

ThirdMaximumNumber/third_maximum_number.go

@@ -0,0 +1,29 @@
+package main
+
+import "sort"
+
+func thirdMax(nums []int) int {
+	// Create a HashSet using a map[int]bool
+	unique := make(map[int]bool)
+
+	// Add elements to the HashSet
+	for _, num := range nums {
+		unique[num] = true
+	}
+
+	// Create a slice to store unique numbers
+	uniqueNums := make([]int, 0, len(unique))
+	for num := range unique {
+		uniqueNums = append(uniqueNums, num)
+	}
+
+	// Sort the unique numbers in ascending order
+	sort.Ints(uniqueNums)
+
+	// Check if the unique numbers have at least 3 elements
+	if len(uniqueNums) < 3 {
+		return uniqueNums[len(uniqueNums)-1]
+	}
+
+	return uniqueNums[len(uniqueNums)-3]
+}