viveksyngh

Deploy OpenFaaS on docker swarm using deploy script.

Use --no-auth if you want to disable basic authentication

./deploy_stack.sh --no-auth

Deploy local docker registry.

docker service rm registry

viveksyngh

package function

import (
	"fmt"
)

// Handle a serverless request
func Handle(req []byte) string {
	return fmt.Sprintf("Hello, Go. You said: %s", string(req))
}

viveksyngh

package main

import (
	"fmt"
	"net/http"
	"encoding/json"
	"html/template"
)

type User struct  {

viveksyngh

class Solution:
    # @param A : list of integers
    # @param B : integer
    # @return a list of integers
    def dNums(self, A, B):
        mapOfNums = {}
        count = 0
        ptr = -1
        res = []
        if B > len(A) :

viveksyngh

__author__ = 'Vivek'

#Given an array of integers, find two numbers such that they add up to a specific target number.

class Solution:
    # @param A : tuple of integers
    # @param B : integer
    # @return a list of integers
    def twoSum(self, A, B):
        Map = {}

viveksyngh

__author__ = 'Vivek'

#Given a binary tree, flatten it to a linked list in-place.

# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

viveksyngh

__author__ = 'Vivek'
# Definition for singly-linked list.
class ListNode:
     def __init__(self, x):
         self.val = x
         self.next = None
import heapq

class Solution:
    # @param A : list of linked list

viveksyngh

__author__ = 'Vivek'

#Given preorder and inorder traversal of a tree, construct the binary tree.

# Definition for a  binary tree node
class TreeNode:
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None

viveksyngh

__author__ = 'Vivek'

#Given inorder and postorder traversal of a tree, construct the binary tree.

# Definition for a  binary tree node
class TreeNode:
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None

viveksyngh

__author__ = 'Vivek'

#Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
#An example is the root-to-leaf path 1->2->3 which represents the number 123.
#Find the total sum of all root-to-leaf numbers % 1003.


# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):