Motivation is spread all over the internet. Sometimes it does not reach the right people. Sometimes it does not reach at the right time.
Motivation Machine is an app ( or series of apps ) that will try to collect motivational posts, pictures etc. from the right sources and deliver them to people.
All the app(s) are going to be open sourced and all the contents that are shared inside the app will be accompanied by a hyperlink to where it originated.
| Date | To | How much | Comments |
|---|---|---|---|
| 4 JUNE 2017 | Wikimedia Foundation | $5 = 337.48 INR | <3 Wikipedia |
| 4 JUNE 2017 | Khan Academy | $5 = 337.48 INR | <3 Khan academy |
| 4 JUNE 2017 | Canonical Ltd. | $5 = 337.48 INR | <3 Ubuntu |
| 4 JUNE 2017 | Harvard Tamil Chair | $5 = 337.48 INR | தமிழ் வாழ்க |
| // Uses github.com/garyburd/redigo/redis Go Library | |
| log.Println("Initializing Redis Message Queue") | |
| conn, err := redis.Dial("tcp", fmt.Sprintf("%s:%s", os.Getenv("REDIS_HOSTNAME"), os.Getenv("REDIS_PORT"))) | |
| if err != nil { | |
| log.Fatalln("Failed to initialize redis message queue", err) | |
| } | |
| defer conn.Close() | |
| log.Println("Initialized Redis Message Queue successfully") |
| // Uses github.com/garyburd/redigo/redis Go Library | |
| // push to queue | |
| _, err := conn.Do("LPUSH", "badge:worker", []byte("some data")) | |
| // Blocking pop from queue | |
| payload, err := redis.Strings(redisConn.Do("BRPOP", "badge:worker", 0)) | |
| if err != nil { | |
| log.Fatalln("Failed to do blocking RPOP on badge:worker", err) | |
| } |
| remote := "https://github.com/scriptnull/scribble" | |
| jsonPayload := "{}" // assume some dummy data | |
| redisConn.Send("MULTI") | |
| // add to a set | |
| redisConn.Send("SADD", "badgeit:queuedRemotes", remote) | |
| // push to queue | |
| redisConn.Send("LPUSH", "badge:worker", []byte(jsonPayload)) | |
| _, err = redisConn.Do("EXEC") |
| /** | |
| * Definition for a binary tree node. | |
| * type TreeNode struct { | |
| * Val int | |
| * Left *TreeNode | |
| * Right *TreeNode | |
| * } | |
| */ | |
| func preorderTraversal(root *TreeNode) []int { | |
| var result []int |
| /** | |
| * Definition for a binary tree node. | |
| * public class TreeNode { | |
| * int val; | |
| * TreeNode left; | |
| * TreeNode right; | |
| * TreeNode(int x) { val = x; } | |
| * } | |
| */ | |
| class Solution { |
| /** | |
| * Definition for a binary tree node. | |
| * type TreeNode struct { | |
| * Val int | |
| * Left *TreeNode | |
| * Right *TreeNode | |
| * } | |
| */ | |
| func inorderTraversal(root *TreeNode) []int { | |
| var result []int |
| /** | |
| * Definition for a binary tree node. | |
| * public class TreeNode { | |
| * int val; | |
| * TreeNode left; | |
| * TreeNode right; | |
| * TreeNode(int x) { val = x; } | |
| * } | |
| */ | |
| class Solution { |
| /** | |
| * Definition for a binary tree node. | |
| * type TreeNode struct { | |
| * Val int | |
| * Left *TreeNode | |
| * Right *TreeNode | |
| * } | |
| */ | |
| func inorderTraversal(root *TreeNode) []int { | |
| var result []int |