Cracking Coding Interviews - Mastering Algorithms

Name: Cracking Coding Interviews - Mastering Algorithms
Rating: 3.7 (58 reviews)

Ace your next Google, Facebook, Amazon, Airbnb, Uber interviews and learn all the tricks to solve algorithm problems

Created byChristopher Chang

Last updated 4/2019

English

What you'll learn

Master common algorithms and data structure questions asked in coding interviews
Practice dozens of algorithms and data structure questions to ace your next coding interview
Tackle interview common questions asked by Big-N companies such as Google, Facebook, Microsoft, Amazon etc.
Use algorithms and data structures to solve easy, medium and difficult word problems

Course content

7 sections • 24 lectures • 2h 57m total length

Breakdown of a Technical Interview9:08
Get a breakdown of what a technical interview in Silicon Valley will look like.
Big O Notation4:40
Learn about Big-O notation along with time and space complexity to evaluate the efficiency of an algorithm.
Top 3 Secret Tips for Passing Any Technical Interview7:58
Get my top 3 personal tips on how to ace your next technical interview.

Unique Characters6:02
Learn to solve the unique characters problem in an interview setting.
Anagrams6:00
Learn to solve the anagram problem in an interview setting using arrays and hash maps.
Two Sum5:28
Learn to solve the two sum problem in an interview setting by using arrays and hash maps.
Group Anagrams6:39
Learn to solve the group anagrams problem in an interview setting using hash maps and analyzing complex time and space complexities.

Binary Tree Inorder4:17
Learn to traverse a binary tree inorder.
Binary Search Tree Search5:57
Learn to search a binary search tree in O(logn) time.
Same Binary Tree?6:37
Learn to compare 2 trees to see if they are the same using recursion.
Symmetric Binary Tree?8:03
Learn to see if 2 binary trees are symmetrical or not using recursion.
Validate Binary Search Tree7:01
Learn to validate if a binary tree is a binary search tree using recursion.
Binary Tree to Doubly Linked List10:28
Learn to convert a binary search tree to a doubly linked list using recursion.

Unique Paths - Bottom Up6:48
Learn to find the number of unique paths a robot can travel using the bottom up dynamic programming method.
Unique Paths - Top Down Memoization9:34
Learn to find the number of unique paths a robot can travel using the top down dynamic programming method with memoization.
Climbing Stairs5:34
Learn to find the number of unique paths to climb stairs using the top down dynamic programming method with memoization

Requirements

All levels

Description

This course will teach you how to ace a technical job interview at a large Silicon Valley company such as Google, Microsoft, Facebook, Amazon, Uber, Airbnb, etc.

You will get my top 3 secret tips for acing any interview at a top tier Silicon Valley company along with preparation tips for the different types of data structures and algorithm questions you can expect to see. I will walk through many examples of how to explain and code your solution during a technical interview.

If you want to land your dream job, then let's get started today!

Who this course is for:

Beginner programmers looking to find a job in tech
Students interested in passing white boarding technical interviews

Cracking Coding Interviews - Mastering Algorithms

What you'll learn

Explore related topics

Course content

Introduction3 lectures • 22min

Arrays and Strings4 lectures • 24min

Stacks1 lecture • 6min

Trees6 lectures • 42min

Graphs4 lectures • 34min

Backtracking3 lectures • 26min

Dynamic Programming3 lectures • 22min

Requirements

Description

Who this course is for: