Inital Commit

001-Two_Sum/main.go

@@ -1,22 +0,0 @@
-package main
-
-import "fmt"
-
-func twoSum(nums []int, target int) []int {
-	var size int = len(nums)
-	var i int = 0
-	var j int = 1
-	outer: for i = 0; i < size - 1; i++ {
-		for j = i + 1; j < size; j++ {
-			if nums[i] + nums[j] == target {
-				break outer
-			}
-		}
-	}
-	return []int{i, j}
-}
-
-func main() {
-	nums := []int{2, 7, 11, 15}
-	fmt.Printf("%v\n", twoSum(nums, 9))
-}

002-Add_Two_Numbers/main.go

@@ -1,120 +0,0 @@
-package main
-
-import (
-	"fmt"
-)
-
-type ListNode struct {
-	Val int
-	Next *ListNode
-}
-
-func (l *ListNode) Print() {
-	var tmp *ListNode = l
-
-	for tmp != nil {
-		fmt.Printf("%v", tmp.Val)
-		tmp = tmp.Next
-	}
-	fmt.Printf("\n")
-}
-
-func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
-	var l1Tmp *ListNode = l1
-	var l2Tmp *ListNode = l2
-	var ret *ListNode = &ListNode{-1, nil}
-	var retTail *ListNode = ret
-	var buf int = 0
-
-	for l1Tmp != nil && l2Tmp != nil {
-		retTail.Val = l1Tmp.Val + l2Tmp.Val
-
-		if buf != 0 {
-			retTail.Val += buf
-		}
-		buf = retTail.Val / 10
-		retTail.Val %= 10
-
-		l1Tmp = l1Tmp.Next
-		l2Tmp = l2Tmp.Next
-
-		if l1Tmp != nil || l2Tmp != nil {
-			retTail.Next = &ListNode{-1, nil}
-			retTail = retTail.Next
-		}
-	}
-
-	for l1Tmp != nil {
-		retTail.Val = l1Tmp.Val
-
-		if buf != 0 {
-			retTail.Val += buf
-			buf = retTail.Val / 10
-			retTail.Val %= 10
-		}
-
-		l1Tmp = l1Tmp.Next
-
-		if l1Tmp != nil {
-			retTail.Next = &ListNode{-1, nil}
-			retTail = retTail.Next
-		}
-	}
-
-	for l2Tmp != nil {
-		if retTail == nil {
-			retTail = &ListNode{-1, nil}
-		}
-		retTail.Val = l2Tmp.Val
-
-		if buf != 0 {
-			retTail.Val += buf
-			buf = retTail.Val / 10
-			retTail.Val %= 10
-		}
-
-		l2Tmp = l2Tmp.Next
-
-		if l2Tmp != nil {
-			retTail.Next = &ListNode{-1, nil}
-			retTail = retTail.Next
-		}
-	}
-
-	if buf != 0 {
-		retTail.Next = &ListNode{buf, nil}
-		retTail = retTail.Next
-	}
-
-	return ret
-}
-
-func arrayToListNode(l []int) *ListNode {
-	var i int = 0
-	var res ListNode = ListNode{l[i], nil}
-	var tmp *ListNode = &res
-	i++
-
-	for ; i < len(l); i++ {
-		tmp.Next = &ListNode{l[i], nil}
-		tmp = tmp.Next
-	}
-
-	return &res
-}
-
-func main() {
-	// tmp11 := ListNode{3, nil}
-	// tmp12 := ListNode{4, &tmp11}
-	// var l1 ListNode = ListNode{2, &tmp12}
-	var l1 *ListNode = arrayToListNode([]int{0})
-	fmt.Printf("l1 => ")
-	l1.Print()
-
-	var l2 *ListNode = arrayToListNode([]int{2, 7, 8})
-	fmt.Printf("l2 => ")
-	l2.Print()
-
-	// fmt.Printf("res => ")
-	addTwoNumbers(l1, l2).Print()
-}

003-Longest_Substring_Without_Repeating_Characters/main.go

@@ -1,39 +0,0 @@
-package main
-
-import "fmt"
-
-
-// Runtime: 360ms Unstable Ram: 24.44mb
-func lengthOfLongestSubstring(s string) int {
-	var m map[uint8]int = make(map[uint8]int)
-	var i int = 0
-	var c uint8 = 0
-	var max int = 0
-
-	if len(s) <= 1 {
-		return len(s)
-	}
-
-	for ; i < len(s); i++ {
-		c = s[i]
-		if _i, ok := m[c]; ok {
-			if len(m) > max {
-				max = len(m)
-			}
-			m = make(map[uint8]int)
-			i = _i
-			continue
-		}
-		m[c] = i
-	}
-
-	if len(m) > max {
-		max = len(m)
-	}
-
-	return max
-}
-
-func main() {
-	fmt.Printf("%v\n", lengthOfLongestSubstring("dvdf"))
-}

Makefile

@@ -1,14 +0,0 @@
-
-
-
-001: 001-Two_Sum/main.go
-	go build 001-Two_Sum/main.go
-
-002: 002-Add_Two_Numbers/main.go
-	go build 002-Add_Two_Numbers/main.go
-
-003: 003-Longest_Substring_Without_Repeating_Characters/main.go
-	go build 003-Longest_Substring_Without_Repeating_Characters/main.go
-
-980: 930-Binary_Subarrays_With_Sum/main.c
-	gcc -o main 930-Binary_Subarrays_With_Sum/main.c

language_chooser.sh

@@ -0,0 +1,15 @@
+#!/bin/sh
+
+
+languages="C++
+Python
+TypeScript
+C
+Go
+Ruby
+PHP
+Elixir
+Erlang
+Racket"
+
+echo "$languages" | shuf | head -n5