ActiveCoder的博客

I interned in Google Inc. twice. First internship was in Privacy & Infrastructure team, mentored by Christopher (Belgian Cryptographer )  and Daniel (Swiss Cryptographer). My project mainly focused

http://www.1point3acres.com/bbs/thread-184034-1-1.htmlFirst Question:A string consists of ‘0’, ‘1’ and '?'. The question mark can be either '0' or '1'. Find all possible combinations for a str

#include #include using namespace std;/* Write a function that takes in a string and returns the length of the longest prefix in which all characters are arranged in alphabetical order. Exam

/* Imagine you have a special keyboard with following four keys: Key 1: Prints 'A' on screenKey 2: (Ctrl-A): Select screen Key 3: (Ctrl-C): Copy selection to bufferKey 4: (Ctrl-V): Print buffer on s

Count all possible distinct binary strings of length n with no consecutive 1s1: Get the max number ending with 0, Get the max number ending with 12: For the next max number ending with 0,  we just

We have a 2D grid. Each cell is either a wall, an enemy or empty.For example (0-empty, X-enemy, Y-wall):0 X 0 0X 0 Y X0 X 0 0You have one bomb and you want to kill as many as possible ene

Some one posted this interview question asked by Google.#include #include #include using namespace std;// array permutation according to the given permutation/* Given permutation {3, 2, 1, 0

Input: string of digits of arbitrary lengthoutput: print all possible letter combinations for those digits to screen.// This is a typical DFS algorithm.// Suppose we dont know the phone screen l

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]