Vishal Rana vishr

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                vishr
                / keybase.md
            
            
              Created
              December 13, 2016 03:24
            
          
    Keybase proof

I hereby claim:

I am vishr on github.
I am vishr (https://keybase.io/vishr) on keybase.
I have a public key whose fingerprint is 53F1 DD5B 0967 D764 766A  791F 2227 6FFB B2AA DBB6

To claim this, I am signing this object:

  
## lookup_test.go
package test

import (
	"sort"
	"testing"
)

type (
	People []*Person
	Person struct {

## client.html
<!DOCTYPE html>
<html>
<head>
  <script src="http://code.jquery.com/jquery-1.8.0.min.js"></script>
  <script type="text/javascript">
    var sock = null;
    var wsuri = "ws://localhost:3000";

    window.onload = function() {
      sock = new WebSocket(wsuri);

## ProducerConsumer.java
/**
 *
 */
package com.qwata.concurrency;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;

/**

## dfs.py
from collections import defaultdict

def recursive_dfs(tree, node, path=[]):
    """
    Recursive depth first search
    """
    path.append(node)
    for child in tree[node]:
        path = recursive_dfs(tree, child, path)
    return path

## bfs.py
from collections import defaultdict

def iterative_bfs(tree, node, path=[]):
    """
    Iterative breadth first search
    """
    queue = [node]
    while queue:
        n = queue.pop(0)
        path.append(n)

## gist:1130605
# Repairing mongod in Ubuntu:
sudo rm /var/lib/mongodb/mongod.lock
sudo -u mongodb mongod -f /etc/mongodb.conf --repair

## BasicJavaCode.java
import java.util.Arrays;

/**
 * @author Vishal Rana
 *
 */
public class BasicJavaCode {

    // Factorial
    public int factorial(int x) {
	package test

	import (
	"sort"
	"testing"
	)

	type (
	People []*Person
	Person struct {
	<!DOCTYPE html>
	<html>
	<head>
	<script src="http://code.jquery.com/jquery-1.8.0.min.js"></script>
	<script type="text/javascript">
	var sock = null;
	var wsuri = "ws://localhost:3000";

	window.onload = function() {
	sock = new WebSocket(wsuri);
	/**
	*
	*/
	package com.qwata.concurrency;

	import java.util.concurrent.ExecutorService;
	import java.util.concurrent.Executors;
	import java.util.concurrent.TimeUnit;

	/**
	from collections import defaultdict

	def recursive_dfs(tree, node, path=[]):
	"""
	Recursive depth first search
	"""
	path.append(node)
	for child in tree[node]:
	path = recursive_dfs(tree, child, path)
	return path
	from collections import defaultdict

	def iterative_bfs(tree, node, path=[]):
	"""
	Iterative breadth first search
	"""
	queue = [node]
	while queue:
	n = queue.pop(0)
	path.append(n)
	# Repairing mongod in Ubuntu:
	sudo rm /var/lib/mongodb/mongod.lock
	sudo -u mongodb mongod -f /etc/mongodb.conf --repair
	import java.util.Arrays;

	/**
	* @author Vishal Rana
	*
	*/
	public class BasicJavaCode {

	// Factorial
	public int factorial(int x) {