danivijay

package com.google.challenges; 

public class Answer {
	public static int locate(int head, int target, int under) {

		under /= 2;
		int right = head - 1;			// right = head - 1
		int left = head - 1 - under--; // left = head - 1 - under/2

		if (right == target || left == target)

danivijay

The Case For Go

• Iron.io: How We Went from 30 Servers to 2 with Go
• Go at Google: Language Design in the Service of Software Engineering
• Behind the Scenes: Big Data at Torbit
• pool.ntp.org DNS server in Go
• Juju at Canonical
• Go at bitly
• NSQ: realtime distributed message processing at scale

danivijay

package com.google.challenges; 
public class Answer {   
    public static int answer(int[] l) { 

        // Your code goes here.

    } 
}