Crack Data Structures & Algorithms for the Coding Interview

STAND OUT FROM YOUR COMPETITION. CRACK THE CODING INTERVIEW AND BUILD YOUR DREAM CAREER.

Learn the technical skills and proven techniques necessary to wow recruiters and work for the hottest companies in Silicon Valley - from people who have done it themselves!

Facebook, Google, Cruise, and more all require applicants to showcase their technical expertise AND their creative thinking abilities. In this course, you will develop your skills until complex interviews become second nature!

This course will teach you:

- Big-o complexity (how it is utilized and how to determine big-o time/space complexity for a given algorithm)

- The most common data structures, with specific practice problems for analyzing their complexity

- Critical patterns of thought required to solve technical interview questions.

- Search and sort algorithms including selection-sort, merge sort, heap sort, stacks, queues, search, finding the minimum and maximum, successor and predecessor, insertion and deletion.

Who is this course for?

- New engineering graduate students who are interviewing for software engineering jobs

- Professionals from other fields with some programming knowledge looking to change to a software role

- Software professionals with several years of experience who want to brush up on core concepts

- Students planning to take AP Computer Science!

The course will culminate in a professionally run mock interview with each student to test your newly developed skills.