Sandra Dai
BAN USERSANDRA TIANXIN DAI
PO Box 15603, Stanford, CA 94309 | tianxind@stanford.edu | 650.862.4283
EDUCATION
Stanford University, Stanford, CA Expected Graduation: 06/2013
Major: B.A. Economics, M.S. Computer Science. GPA: 3.95/4.00. GRE: Verbal – 166 Math – 170 Writing – 4.0
President’s Award for Academic Excellence (top 3% of class).
Relevant Coursework: Java, C, C++ Programming, Computer Organization and Systems, Operating System (in
progress), Algorithms, Databases, Networking, Computer Graphics, Computer and Network Security.
Programming: Familiar with Windows/Macintosh OS/Linux platforms. Solid UNIX and networking protocol
knowledge, proficiency with C/C++/Java, experience with OpenGL, SQL, XML, XPath, XQuery, PHP, PDO, Javascript,
JQuery, HTML/CSS.
Shanghai Foreign Language School, Shanghai, China 09/2001 – 06/2008
International German Olympics for Non-native Speakers, 1st place among 120 national champions.
Math Olympiad, National Bronze Medalist.
PROJECTS
myBuuk.com, Chief Programmer, Stanford, CA 10/2011 – Present
myBuuk.com is a website that tries to revolutionize the way people manage their contacts and relationships.
Founded the website together with two other Stanford students, designed user interface and database, currently
implementing more front- and back-end features.
CS106A Section Leader, Stanford, CA 01/2012 – Present
Led a weekly section containing 8-12 students for the introductory Java class. Also responsible for grading programming
assignments, midterm and final, and holding weekly office hours.
Strongly Connected Components Program, Stanford, CA 10/2011
Implemented Tarjan’s algorithm which computes Google’s web graph with 875,714 nodes and 5,105,043 edges in 1.5s.
Won honorable mention in a class of 200+ students.
WORK EXPERIENCE
Morgan Stanley, Investment Banking Analyst, Menlo Park, CA 06/2011 – 08/2011
Worked with a 5-member team on Groupon’s $30Bn IPO, built bottom-up revenue model and prepared roadshow.
Conducted mobile/server industry research and M&A target analysis for one of the biggest semiconductor company.
Worked on corporate development projects including share buy-back, debt structure and M&A analysis for major
semiconductor and software companies.
Hall Capital Partners, Investment Research Intern, San Francisco, CA 06/2010 – 08/2010
Worked with a 22-person research team of a private wealth management firm with $19.5B of assets under management.
Conducted two research projects on the state-owned enterprise reform in China and impacts of recent trends in technology
industry. Presented findings to the research group and portfolio managers.
UBS Wealth Management, Wealth Management Intern, Palo Alto, CA 10/2009 – 01/2010
Managed transaction records and paperwork for 375 client accounts with an average net worth of $15-20mm each.
Reviewed financial goals of clients and helped build investment proposals tailored to the client’s risk preference.
LEADERSHIP & EXTRACURRICULARS
J.P. Morgan Winning Women Leadership Event, New York City 11/05/2010
One of the three students from Stanford to participate in a day-long event of panels with senior female executives, skillbuilding
sessions, mock interviews and job shadows.
Stanford Women in Business, Internship Director, Stanford, CA 10/2008 – 06/2011
Recruited 9 partner companies to provide a total of 30 “Springternships” in spring for club members.
Developed mini-MBA and business education program and supervised 15 interns through evaluation system.
ADDITIONAL INFORMATION
Awards: Outstanding Award in “Across The Strait” Art Competition for Youth in Mainland and Taiwan. Weekly Champion in
“SK Quiz Bowl” hosted by Beijing TV station.
Interests: Member of Stanford ACM. Chinese painting, specializing in figure drawing. Manga, Financial officer of Stanford
Go Club.
use Java regular expression
- Sandra Dai January 19, 2012I think this solution is correct, pseudo code here:
min_len = infinity;
most_recent_pos[n] = -1;
foreach word in document
int sequenceStart = min (the most recent position of all words in pattern except the current word)
int curr_len = pos of curr word - sequenceStart
if curr_len < min_len min_len = curr_len
most_recent_pos[current word] = position of current word
Repmelodyakeel, Consultant at Progress
Hello I am Melody. I am working as Human resource clerks, also called human resource assistants. I can maintain employee ...
Repcardiroy, Backend Developer at Accolite software
Hi,I am from Taxes, USA. Enthusiastic multilingual translator with years involvement with Spanish-English translations.Looking to additionally improve interpretation ...
RepMariaHobbs, Consultant at Adobe
Hi, I am Maria Hobbs from NewYork.Teach career development courses for designated areas. Develop, evaluate and revise course materials ...
Repsheenaamajors, System Administrator at Achieve Internet
Teach art classes to a diverse array of students of varying ages and abilities. Strong desire to incorporate a multidimensional ...
RepDonnaWHale, Data Engineer at ADP
Hi, I am passionate writer with a BA in English from the Ohio State University.5+ years of experience writing ...
You can just use two vectors to solve this
- Sandra Dai January 19, 2012