際際滷

際際滷Share a Scribd company logo
Acing the Coding Interview
Acing the Coding Interview
Ted Xiao, EECS MS 16
50+ Coding Interviews
Too many hours preparing...
 Youre nervous about your first coding interview
 You want to pick up some tips and tricks
 Youre ready to land your dream internship / job
Acing the Coding Interview
Acing the Coding Interview
Acing the Coding Interview
Acing the Coding Interview





How much time do you
have?
<2 days 2 - 7 days 1 week +
What should you do? Review concepts and
research what the
company asks (Glassdoor,
/r/cscareerquestions)
Review concepts,
create a cheat sheet,
do practice problems
Review concepts, learn
gaps in knowledge,
create a cheat sheet,
do a lot of problems
Acing the Coding Interview
Acing the Coding Interview
The cost of a stock on each day is given in an array, find the max profit that you
can make by buying and selling in those days. For example, if the given array is
[100, 180, 260, 310, 40, 535, 695], the maximum profit can earned by buying on
day 0, selling on day 3
Acing the Coding Interview
Acing the Coding Interview

More Related Content

Acing the Coding Interview

  • 3. Ted Xiao, EECS MS 16 50+ Coding Interviews Too many hours preparing...
  • 4. Youre nervous about your first coding interview You want to pick up some tips and tricks Youre ready to land your dream internship / job
  • 6.
  • 7.
  • 8.
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
  • 17.
  • 18.
  • 20. How much time do you have? <2 days 2 - 7 days 1 week + What should you do? Review concepts and research what the company asks (Glassdoor, /r/cscareerquestions) Review concepts, create a cheat sheet, do practice problems Review concepts, learn gaps in knowledge, create a cheat sheet, do a lot of problems
  • 22.
  • 23.
  • 25. The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is [100, 180, 260, 310, 40, 535, 695], the maximum profit can earned by buying on day 0, selling on day 3