One Paragraph of project description goes here
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
| package main | |
| import ( | |
| "bufio" | |
| "database/sql" | |
| "fmt" | |
| "os" | |
| "strconv" | |
| _ "github.com/lib/pq" |
| package main | |
| import "fmt" | |
| func solution(index int) int { | |
| num, counter, val := 2, 0, 0 | |
| for { | |
| var clean = true | |
| for i := 2; i <= num-1; i++ { |
| package main | |
| import "fmt" | |
| func solution(limit int) int { | |
| sum, ssq := 0, 0 | |
| for i := 1; i <= limit; i++ { | |
| square := i * i | |
| ssq += square | |
| sum += i |
| package main | |
| import "fmt" | |
| func solution() int { | |
| var min int | |
| num := 21 | |
| found := false | |
| for !found { | |
| var clean bool |
| package main | |
| import "fmt" | |
| func flip(n int) int { | |
| var v int | |
| for n != 0 { //to make it cater for negative numbers | |
| remainder := n % 10 | |
| v = v*10 + remainder | |
| n /= 10 |
| package main | |
| import ( | |
| "fmt" | |
| ) | |
| func primeNumbers(n int, pChan chan int) { | |
| defer close(pChan) | |
| for i := 2; i <= n; i++ { | |
| prime := true |
| func chanFib(n int, f chan int) { | |
| fmt.Println("N is: ", n) | |
| defer close(f) | |
| i, j := 0, 1 | |
| for { | |
| temp := i + j | |
| f <- i + j | |
| j, i = i+j, j | |
| if temp >= n { |
| package main | |
| import "fmt" | |
| func producer(p chan int, items int) { | |
| defer close(p) | |
| for i := 1; i <= items; i++ { | |
| fmt.Println("Produer Producing ", i) | |
| p <- i | |
| } |
| public class Node{ | |
| int data; | |
| Node next; | |
| Node(int d){ | |
| data=d; | |
| } | |
| } |