This repository contains common programming problems solved in GO language.
To install, simply go to GO's website and download the installer and run it: https://golang.org/
When the installation is done, the "go" command is going to be avaialable in terminal.(You have to restart an opened terminal)
To run any of the applications, navigate to the desired folder and type this command:
go build <name_of_go_file>
The previous command will compile the go file into a runnable.
Once the runnable is created then it can be run in terminal, for example:
./<name_of_runnable>
Source: https://tour.golang.org/welcome/1
Write a program that prints “Hello, world!” in Japanese (using Japanese characters) to the screen.
Source: https://tour.golang.org/welcome/4
Write a program that prints the current time and date to the console.
Source: http://wiki.c2.com/?FizzBuzzTest
Write a program that prints the numbers from 1 to 100, except for the following conditions. For multiples of three print “Fizz” instead of the number, and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”.
Write a function that calculates the sum of the digits of the factorial of a number. n! means n x (n − 1) … x 3 x 2 x 1. For example, 10! = 10 x 9 x … x 3 x 2 x 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100!
Source: https://adriann.github.io/programming_problems.html
Write a guessing game where the user must guess a secret number. After every guess the program tells the user whether their number was too large or too small. At the end the number of tries needed should be printed. It counts only as one try if they input the same number multiple times consecutively.
Source: https://adriann.github.io/programming_problems.html
Write a function that returns the largest and smallest elements in a list.
Source: https://adriann.github.io/programming_problems.html
Write a function that tests whether a string is a palindrome.
Source: https://adriann.github.io/programming_problems.html
Write a function that merges two sorted lists into a new sorted list. [1,4,6],[2,3,5] → [1,2,3,4,5,6].
Source: https://tour.golang.org/flowcontrol/8
Implement the square root function using Newton’s method. In this case, Newton’s method is to approximate sqrt(x) by picking a starting point z and then repeating:
z_next = z - ((z*z - x) / (2 * z)) To begin with, just repeat that calculation 10 times and see how close you get to the answer for various values (1, 2, 3, …). Next, change the loop condition to stop once the value has stopped changing (or only changes by a very small delta). How close are you to the math.Sqrt value?
Hint: to declare and initialize a floating point value, give it floating point syntax or use a conversion:
z := float64(1) z := 1.0
Write a function to reverse a string in Go.