Pinned Repositories
.password-store
airline_ontime
Cloud computing capstone project 1
Anagrams
Find anagrams from an array
ansible-nu-elk
ansible playbook to setup logstash on cluster
codervinod.github.io
docker.swagger-flask-bootstrap
Dockerfile and configuration files to build a working Flask container with uwsgi and nginx
key-value-store
Fault-Tolerant Key-Value Store
membership-protocol
SimpleKvDb
Simple key value database
community-images
:gem: RapidFort hardened secure images
codervinod's Repositories
codervinod/docker-registry-client
A Go API client for the v2 Docker Registry API
codervinod/rundeck-rest-step-plugin
codervinod/commvault_app
codervinod/strict-rfc3339
Strict, simple, lightweight RFC3339 functions
codervinod/mergeJsLists
codervinod/pygraph
codervinod/storm-docker
Dockerfiles for building a storm cluster.
codervinod/PyDs
codervinod/virtual-hadoop-cluster
A virtual Hadoop cluster running CDH5
codervinod/PingIp
codervinod/google-concurrency-library
Automatically exported from code.google.com/p/google-concurrency-library
codervinod/graphs2
codervinod/udp_average_tracker
codervinod/node_debug_demo_prog
codervinod/word-search
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once. For example, Given board = [ ["ABCE"], ["SFCS"], ["ADEE"] ] word = "ABCCED", -> returns true, word = "SEE", -> returns true, word = "ABCB", -> returns false.
codervinod/nconf_test
Nconf testing util
codervinod/PossibleWords
codervinod/PermuteString
codervinod/RotateMatrix
codervinod/MultiSubString
codervinod/MinifyString
codervinod/Graphs
codervinod/BST
codervinod/Heap
codervinod/ConsecutiveKsum
codervinod/Roman2Decimal
Roman 2 deciman conversion
codervinod/DutchFlag
Sort an array of 0s, 1s and 2s
codervinod/CharSorter
Sort characters in sentence
codervinod/StringSearch
codervinod/SimpleRegex