Leetcode 刷题记录 & VLIS学长们的战绩

November 28, 2014 Leetcode全垒打！

以此纪念。找工作的路还是很漫长。继续奋斗。有学长学姐们的督促，必须更加努力。

http://mcds.cs.cmu.edu/?q=node/26

2013

  • Chun Chen (Twitter, San Francisco, CA)
  • Yiwen Chen (GOOGLE, Mt. View, CA)
  • Mengwei Ding (GOOGLE, Mt. View, CA)
  • Ge Gao (GOOGLE, Mt. View, CA)
  • Yuan Gu (GOOGLE, Mt. View, CA)
  • Lingpeng Kong (CMU graduate program)
  • Zeyuan Li (Goldman Sachs NY, NY)
  • Zhiqi Li (LiveRamp, San Francisco CA)
  • Pengqi Liu (Microsoft Bing Social, Sunnyvale CA)
  • Li Lu (GOOGLE, Mt. View, CA)
  • Adit Madan (HP Labs, Palo Alto, CA)
  • Mayank Mohta (GOOGLE, Mt. View, CA)
  • Luzheng Sheng (AMAZON - Seattle, WA)
  • Jieru Shi (GOOGLE, Mt. View, CA)
  • Yu Su (GOOGLE, Mt. View, CA)
  • Yang Sun (AMAZON, Toronto, ON, Canada)
  • Yuchen Tian (A9.com Palo Alto, CA)
  • Guanyu Wang (Applying for PHD)
  • Fei Xie (Zazzle, Redwood City CA)
  • Ke Xu (Ebay, Seattle, WA)
  • Bo Yang (GOOGLE, Mt. View, CA)
  • Yuliang Yin (Pinterest, San Francisco CA)
  • Chaomin Yu (GOOGLE, Mt. View, CA)
  • Shu-Hao Yu (Google UK (London))
  • Huanchen Zhang (GOOGLE, Mt. View, CA)
  • Jingge Zhou (Linkedln)
  • Yu Gong (AMAZON, Palo Alto, CA)
  • Daniel Langdon (Groupon, Palo Alto CA)

    2012

  • Guo Chen (GOOGLE, Mt. View, CA)
  • Yilun Cui (AMAZON, Seattle, WA)
  • Yogesh Dalal (Ebay - San Jose, CA)
  • Rui Du (AMAZON, Seattle WA)
  • Elmer Garduno (UPMC, Pittsburgh, PA)
  • Tianle Huang (AMAZON, Seattle, WA)
  • Ms. Ranjitha Kulkarni (Microsoft, Sunnyvale, CA)
  • Kai Liu (AMAZON, Seattle, WA)
  • Lingjuan Peng (Facebook, Menlo Park, CA)
  • Chen Qiu (Storm8)
  • Sadhwi Srinivas (BBN Technologies, Boston)
  • Liuyi Sun (GOOGLE, Mt. View, CA)
  • Shuai Wang (GOOGLE, Mt. View, CA)
  • Xin Wu (GOOGLE, Mt. View, CA)
  • Kai Xia (Microsoft, Bellevue, WA)
  • Guzi Xu (GOOGLE, Mt. View, CA)
  • Cheng Zeng (AMAZON, Seattle, WA)
  • Guannan Zhang (AMAZON, Seattle, WA)
  • Peng Zhang (Yahoo!, Sunnyvale, CA)
  • Yijia Zhang (GOOGLE, Mt. View, CA)
  • Anirudh Koul (Microsoft/ Bing Social Media)
  • Fuyao Zhao (GOOGLE - Pittsburgh)

2011

  • Chaya Hiruncharoenvate (IBM Research)
  • Yaokai Jiang (Medallia, Palo Alto, CA)
  • Dhananhay Kulkarni (Microsoft/ Bing Social Media)
  • Piyush Kumar (Salesforce.com, San Francisco CA)
  • Tarun Kumar (Linkedin, Mt. View CA)
  • Kelvin Law (DSO-Defense Science Org./Singapore)
  • Chung Hau Liang
  • Guimin Lin (Start Up EverAnts in Shenzhen China)
  • Rui Liu (PhD. In LTI)
  • Yootthana Mahitdhiharn (AMAZON - Seattle, WA)
  • Amrut Nagasunder (MEEBO - Mt. View, CA)
  • Junyang Ng (DSO-Defense Science Org./Singapore)
  • Wangshu Pang (CBS Interactive - Boston, MA)
  • Taylor Raack (Groupon - Chicago, IL)
  • Yixiao Shen (Oracle - Santa Clara, CA)
  • Bin Sheng (Apple - Cupertino, CA)
  • Jeffrey Su (Microsoft - Redmond, WA)
  • Yunkai Zhang (Oracle - Nashua, New Hampshire)

2010

  • Himanshu Gahlot (CBS Interactive, San Francisco, CA)
  • Anshul Madan (NetApp Advanced Technology Group)
  • Reinhard Munz (Applying for PhD. Programs)
  • Junli Xian (AMAZON - Seattle, WA)
  • Mikhail Dhruv (MEEBO - Mt. View, CA)
  • Winghong (Andrew) Ko (Medallia, Palo Alto CA)

2009

  • Tao Huang (GOOGLE, Mt. View, CA)
  • Jiping Zhou (SalesForce.com, San Francisco, CA)
  • Tejal Desai (YAHOO! , Sunnyvale, CA)
  • Jing Yang (AMAZON, Seattle, WA)
  • Ashutosh Singh Chauhan (YAHOO! , Sunnyvale, CA)
  • Dmitriy Ryaboy (Twitter, Inc. - San Francisco, CA)
  • Yun Huang (GOOGLE, Mt. View, CA)
  • U Kang (CMU PhD. Student LTI)

2008

  • Chaiyong Ragkhitwetsagul (National Economic & Social Dev. Office Thailand)
  • Faraz Shaikh (VM Ware - Palo Alto, CA)
  • Min Yan (Next Jump Nations - New York, NY)
  • Huanian Zheng
  • Guillermo Marinero (CMU Employee)
  • Evan Stade (GOOGLE - Long Beach, CA)
  • Isaac Simmons (CMU Employee)
  • Marty McGuire (CMU Employee)

2007

  • Woo Tae Kim
  • Shivani Kirubanandan
时间： 2024-10-13 15:59:20

Leetcode 刷题记录 & VLIS学长们的战绩的相关文章

leetcode刷题记录(2)

301. Remove Invalid Parentheses Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may contain letters other than the parentheses ( and ). Examples: "()())()&q

Leetcode刷题记录[python]——344 Reverse String

一.前言 不是计算机专业出身,却有一颗程序猿的心. 昨日开始leetcode第一次刷题,选择了菜鸟方式,从AC率最高且难度为Easy的题开始,不管题是简单还是难,都想做个记录,既是方便以后回顾,又是以此作为一个激励,督促自己每天都能有所进步. 二.题344 Reverse String Write a function that takes a string as input and returns the string reversed. class Solution(object): def

Leetcode刷题记录[python]——349 Intersection of Two Arrays

一.前言 做了两题才慢慢摸清了leetcode的操作. 二.题349 Intersection of Two Arrays Given two arrays, write a function to compute their intersection. class Solution(object): def intersection(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int]

Leetcode刷题记录[python]——283 Move Zeroes

一.前言 题是上周五做的,开始思路有点问题,考虑不全,导致submit了3次才AC. 二.题283 Move Zeroes Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after call

leetcode刷题记录-Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that

Leetcode刷题记录[python]——258 Add Digits

一.前言 做这题有个小收获,关于Digital root的解法,有个极方便的小公式: 二.题258 Add Digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. class Solution(object): def addDigits(self, num): """ :type num: int :rtype: i

Leetcode刷题记录[python]——104 Maximum Depth of Binary Tree

一.前言 对于这类抽象问题还有self用法,还要多做多练习,此题是参考其他答案所做. 二.题104 Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. # Definitio

Leetcode刷题记录[python]——561 Array Partition I

一.前言 二.题561 Array Partition I Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible. Example 1: Inp

LeetCode刷题记录_27. 移除元素

题目: 给定一个数组 nums 和一个值 val,你需要原地移除所有数值等于 val 的元素,返回移除后数组的新长度. 不要使用额外的数组空间,你必须在原地修改输入数组并在使用 O(1) 额外空间的条件下完成. 元素的顺序可以改变.你不需要考虑数组中超出新长度后面的元素. 示例 1: 给定 nums = [3,2,2,3], val = 3, 函数应该返回新的长度 2, 并且 nums 中的前两个元素均为 2. 你不需要考虑数组中超出新长度后面的元素. 示例 2: 给定 nums = [0,1,