For with Labels

Author: BenderScript

add_two_numbers/main.go

@@ -0,0 +1,15 @@
+//You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+//
+//You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+//
+//Example:
+//
+//Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+//Output: 7 -> 0 -> 8
+//Explanation: 342 + 465 = 807.
+
+package main
+
+func main() {
+
+}

go_routines_gotchas/main.go

@@ -1,3 +1,5 @@
+// From book Concurrency in Go.
+
 package main
 
 import (

longest_substring/main.go

@@ -1,3 +1,4 @@
+// Leetcode problem
 //Given a string, find the longest substring without repeating characters.
 //
 //Example 1:

median_sorted_arrays/main.go

@@ -1,3 +1,4 @@
+// Leetcode problem
 //There are two sorted arrays nums1 and nums2 of size m and n respectively.
 //
 //Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).