diff --git a/Week_01/id_93/is_anagram.go b/Week_01/id_93/is_anagram.go
new file mode 100644
index 00000000..cb63799e
--- /dev/null
+++ b/Week_01/id_93/is_anagram.go
@@ -0,0 +1,35 @@
+package main
+
+import "fmt"
+
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+
+	sarr := make([]int ,26)
+	tarr := make([]int, 26)
+
+	for i:=0; i<len(s); i++ {
+		sarr[s[i]-'a']++
+	}
+
+	for j:=0; j<len(t); j++ {
+		tarr[t[j]-'a']++
+	}
+
+	for i:=0; i<26; i++ {
+		if sarr[i] != tarr[i] {
+			return false
+		}
+	}
+
+	return true
+}
+
+func main() {
+	s := "anagram"
+	t := "nagaram"
+
+	fmt.Println(isAnagram(s, t))
+}
diff --git a/Week_01/id_93/longest_univalue_path.go b/Week_01/id_93/longest_univalue_path.go
new file mode 100644
index 00000000..c2840372
--- /dev/null
+++ b/Week_01/id_93/longest_univalue_path.go
@@ -0,0 +1,72 @@
+package main
+
+import (
+	"fmt"
+	"math"
+)
+
+type TreeNode struct{
+	Val int
+	Left *TreeNode
+	Right *TreeNode
+}
+
+/*
+5
+/ \
+4   5
+/ \   \
+1   1   5
+*/
+
+var max int
+func longestUnivaluePath(root *TreeNode) int {
+	getMax2(root, root.Val)
+	return max
+}
+
+func getMax2(r *TreeNode, val int) int {
+	if r == nil {
+		return 0
+	}
+	left := getMax(r.Left, r.Val)
+	right := getMax(r.Right, r.Val)
+	max = int(math.Max(float64(max),float64(left)+float64(right)))
+	if r.Val == val {
+		return int(math.Max(float64(left), float64(right)))+1
+	}
+	return 0
+}
+
+func getMax(root *TreeNode, val int) int {
+	if root == nil {
+		return 0
+	}
+
+	left := getMax(root.Left, root.Val)
+	right := getMax(root.Right, root.Val)
+
+	max = int(math.Max(float64(max),float64(left)+float64(right)))
+
+	if root.Val != val {
+		return 0
+	} else {
+		return int(math.Max(float64(left), float64(right)))+1
+	}
+}
+
+
+
+
+
+
+func main() {
+
+	Node5 := TreeNode{Val:5,Left:nil,Right:nil}
+	Node4 := TreeNode{Val:1,Left:nil,Right:nil}
+	Node3 := TreeNode{Val:1,Left:nil,Right:nil}
+	Node2 := TreeNode{Val:4,Left:nil,Right:&Node5}
+	Node1 := TreeNode{Val:4,Left:&Node3,Right:&Node4}
+	Node := TreeNode{Val:5,Left:&Node1,Right:&Node2}
+	fmt.Println(longestUnivaluePath(&Node))
+}
diff --git a/Week_01/id_93/max_imum_gap.go b/Week_01/id_93/max_imum_gap.go
new file mode 100644
index 00000000..df27d62f
--- /dev/null
+++ b/Week_01/id_93/max_imum_gap.go
@@ -0,0 +1,27 @@
+package main
+
+import (
+	"fmt"
+	"sort"
+)
+
+func maximumGap(nums []int) int {
+	if len(nums) < 2 {
+		return 0
+	}
+	max := 0
+	sort.Ints(nums)
+	for i:=len(nums)-1; i>=1; i-- {
+		if nums[i]-nums[i-1] > max {
+			max = nums[i]-nums[i-1]
+		}
+	}
+
+
+	return max
+}
+
+func main() {
+	nums := []int{1,10000000}
+	fmt.Println(maximumGap(nums))
+}
diff --git a/Week_01/id_93/wiggle_sort.go b/Week_01/id_93/wiggle_sort.go
new file mode 100644
index 00000000..179bba26
--- /dev/null
+++ b/Week_01/id_93/wiggle_sort.go
@@ -0,0 +1,36 @@
+package main
+
+import (
+	"fmt"
+	"sort"
+)
+
+func wiggleSort(nums []int) []int {
+	if len(nums) < 2 {
+		return nums
+	}
+	ret := []int{}
+	sort.Ints(nums)
+	mid := len(nums)/2
+	right := len(nums)-1
+	left := mid-1
+	for len(ret) < len(nums) {
+		if len(ret) < len(nums) {
+			ret = append(ret, nums[right])
+			right--
+		}
+
+		if len(ret) < len(nums) {
+			ret = append(ret, nums[left])
+			left--
+		}
+	}
+	nums = ret
+	return nums
+
+}
+
+func main() {
+	nums := []int{1, 5, 1, 1, 6, 4}
+	fmt.Println(wiggleSort(nums))
+}