文章平均质量分 75
ActiveCoder
An active programmer
展开
-
Start as a fresh.....
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原创 2016-03-18 03:38:59 · 362 阅读 · 0 评论 -
OnePointThreeAcres Google/April -1
http://www.1point3acres.com/bbs/thread-184034-1-1.html First Question: A string consists of ‘0’, ‘1’ and '?'. The question mark can be either '0' or '1'. Find all possible combinations for a str原创 2016-04-25 12:17:15 · 466 阅读 · 0 评论 -
May 10th
#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原创 2016-05-10 12:41:39 · 375 阅读 · 0 评论 -
Max Number of A's given four keys
/* 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原创 2016-06-09 06:31:26 · 238 阅读 · 0 评论 -
Distinct binary strings of length n with no consecutive 1s
Count all possible distinct binary strings of length n with no consecutive 1s 1: Get the max number ending with 0, Get the max number ending with 1 2: For the next max number ending with 0, we just原创 2016-06-09 06:55:50 · 287 阅读 · 0 评论 -
LeetCode 361. Bomb Enemy
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 0 X 0 Y X 0 X 0 0 You have one bomb and you want to kill as many as possible ene原创 2016-06-19 07:56:50 · 1921 阅读 · 0 评论 -
Permute the array according to the given permutation.
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原创 2016-06-19 04:35:32 · 399 阅读 · 0 评论 -
Facebook Phone Interview: Phone Number to Letter Combinations
Input: string of digits of arbitrary length output: print all possible letter combinations for those digits to screen. // This is a typical DFS algorithm. // Suppose we dont know the phone screen l原创 2016-03-23 07:41:29 · 365 阅读 · 0 评论 -
LeetCode 42. Trapping Rain Water
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]原创 2016-05-02 08:44:41 · 215 阅读 · 0 评论