4.52 out of 5
4.52
1860 reviews on Udemy

Data Structures and Algorithms Bootcamp

How to ace your Silicon Valley style coding interview
Instructor:
Jonathan Rasmusson
11,162 students enrolled
English More
How to answer commonly asked Silicon Valley style interview questions
Demonstrate knowledge and mastery of data structures and algorithms
How to pass Silicon Valley style technical interviews
Interview confidently
Land your dream job

This course is about getting you up-to-speed quickly on the fundamental computer science concepts you are going to be expected to know if you want interview at any large Silicon Valley tech company (Google, Apple, Facebook, Amazon, or Spotify).

Topics include

  • Arrays

  • Linked Lists

  • Big O notation

  • Stacks & Queues

  • Hash Tables

  • Binary Trees

  • Binary Heaps

  • Dynamic Programming & Memoization

  • Bubble Sort / Merge Sort / Quick Sort

  • Graphs

  • Breadth First Search

  • Depth First Search

  • More…

What you get

With this course you get

  • Over 115 beautifully hand crafted HD videos walking you through every aspect of how all these data structures and algorithms work

  • Practices questions and personal walkthroughs of the most commonly asked interview questions

  • My personal notes on interviews I have personally had with Spotify, Facebook, Amazon, and others

  • A section called The Classics where we walk through classic interview questions no interviewee should be with out

  • Interview tips on soft skills big tech companies look for when hiring and techniques on how to answer

What you save

By investing in yourself with this course you are saving yourself the most precious thing you’ve got – time. I have spent a year scouring the web looking for the best examples, the simplest explanations, the best visualizations on how to explain how this stuff works, and assembled it all into one, quick, easy to digest place.

Let’s do this together

Learning data structures and algorithms doesn’t have to be a chore. It can be fun. And I want you to know I am here for you every step of the way. Ask me any question. I usually get back to my students with 24 hrs. And together, we will get you the understanding behind how these things work.

I also don’t have a formal computer science background

Look. I know what it’s like not to know how this stuff works. And, like you, I have had to learn this stuff from scratch.

But I am here to tell you it can be done. I have no formal computer science background. I am not classically trained as a computer scientist. But by learning this material, I landed my dream job as an engineer at Spotify in San Francisco. And so can you.

So what are you waiting for? Sign up and get started on your journey today.

Testimonials

Here are some testimonials from students who have taken the course.

Tiffany Scott

Best $10 I’ve ever spent. The explanations are concise and are giving me confidence for my upcoming Microsoft and Facebook interviews. Planning on finishing the course in 4 days to give me ample time to practice problems.

Saif Addin Ellafi

Really, this will sound like exaggeration. But this course is perfect, 5 stars falls short. The instructor puts the content in a an easy to follow order, videos are short to keep attention and leave you wanting to know more. Concise and important points are made very clear, with zero repetition. Native speaker offers no challenge for understanding, especially if you are not a native speaker. Answers questions very quickly. The course WONT teach you how to program, so forget about 100% coding from scratch or having pedagogical exercises. It relies on you to check out the code, re-write it, practice and research deeper the concepts. Examples are written in Java, but they are very agnostic to the language (aside of having to setup a java environment to run tests). Huge focus on acing interviews. A clear target of the course makes it great and an example. Time and pacing are perfect, no need to slow down or speed up. Overall 10 out of 5.

Anna Teittinen

I completed this course in my busy schedule within 3 weeks of learning I will have technical phone interviews with both Google and Facebook. I learned so much and understood everything without memorizing, unlike when I was in school. I recently learned I did well on both phone interviews. I will have a second technical phone interview with both companies again in mid Jan. I highly recommend this course! Thank you very much Jonathan!

Rick A

I took your course in the very beginning of my interview prep to refresh all my concepts. I think you’ve done a great job in this course. After a lot of practice using these concepts I got pretty good at it. I got multiple offers from big N including Google, Facebook, Amazon and Microsoft. I would like to take this moment to thank you for creating the course and being available to answer our queries.

Luciano Sa

Amazing course! Very well explained, great didactic which makes it very easy to follow and understand! I wish these stars were exponential. 🙂

Kavitha Bhasker

I am really thankful I found this course on Udemy. It has been 15 years since I learnt these concepts during my engineering college days and needed to brush up on them for interview prep. This course really nailed the contents and exercise that are asked in tech interviews these days. The tone of the instructor is very friendly and calm and make you think rather than put you in a spot. I was asked for a interview query on whether to use an array vs hashmap in a certain scenario and was able to nail the answer and also give the Time complexity with confidence . I landed the job and will be starting next week. Thank you so much!

Eyal Carmi

Great. I like the that Jonathan filters what we actually need for an interview – instead of being flood with lot’s of data, he notes you what worth remembering. His explanations are clear, and if you don’t understand something, just ask him and he explains it to you.

Flavio Marques Migowski Carvalho

One of the best course I’ve had. It’s very well explained, each step in the coding is shown and explained with drawings. I think some design and architecture problems would be very handy! Thank you for making this course for us!

Adam Mendoza

Best course I’ve seen to brush up on algorithms and data structures to prepare for an interview at competitive companies. Really, a class apart.

Madhu

I love the course overall. Very engaging. The Instructor, Jonathan is a great mentor and has this calm and assuring voice that puts the confidence in anyone who does not have programming experience before. He not only covered the technical aspects of almost all the important algorithms but also added a great ending with the interviewing tips which is really helpful. I would recommend this course to everyone who want to brush up on algorithms and just be ready enough to start with their interview.

Juwan Turner-Howard

I can program. I thought I “knew” about arrays, but this helping me to know the why which can allow me to make better tradeoffs when it’s time to choose between linkedlist(probably O(n) get and set time) versus the O(1) array get and set time. If the rest of the course is consistent with the style and value of information in this first module… whew… I’m in for a good ride. So happy and excited about this course thus far though.

Aung Khant Nyra

I would say Jonathan has done a great job of showing you how to prepare for interview problems by giving you a touch of basic data structures and a bird’s eye view of the a typical interview. I am in the bay area and personally for me, this course is pretty basic and I am preparing for interviews myself, so this course was helpful for me although it didn’t include advanced topics like dynamic programming and so on. Of course, there are countless interview practice problems online so I understand, it’s impossible for him to cover everything. Anyways, I love the course . It is better to learn from a professional who is in the field instead of learning from a professor or a lecturer.

Ramachandran Rajagopalan

Good course to wrap your head around DSA if you are a beginner. For others who have a got a week’s time for the interview and need a refresher then grab this. Thanks, Jonathan. Good work.

Welcome

1
How to get the most out of this course
2
Where to get the code

https://github.com/rasmus4200/algorithms101

3
Link to Github Repo
4
Help Setting Up intelliJ

Help setting up your local development environment.

Arrays

1
What's so special about Arrays?
2
Data Structures vs APIs
3
Three things you need to know about Arrays
4
The Array's Killer Feature
5
How to insert into an Array
6
How to delete an Array element
7
Deleting the Last Element
8
How to resize Arrays dynamically
9
Lab: Let's build a Dynamic Array from scratch
10
What about error handling?
11
What you need to know for the interview

Linked Lists

1
What is a Linked List?
2
What makes a Linked List different from an Array?
3
Add Front
4
Get First / Get Last
5
Add back
6
Size
7
Clear
8
Delete With Value
9
Double Linked Lists
10
What you need to know for the interview
11
Super Common Interview Question

Big O Notation

1
What is Big O Notation?
2
Must know Big O runtimes
3
The Big O Cheat Sheet
4
Lab: Testing ourselves on our Big O Notation
5
What you need to know for the interview

Stacks & Queues

1
What are Stacks and Queues?
2
What is the Stack and Queue killer feature?
3
How to push and pop onto a Stack
4
How to add and remove from a Queue
5
Visualizing adding to a Queue
6
Runtime characteristics of Stacks and Queues
7
What you need to know for the interview

Hash Tables

1
What so great about Hash Tables?
2
How does hashing work?
3
How do you convert a hash into its index?
4
Beep beep! How to deal with collisions
5
Runtime characteristics of Hash Tables
6
Lab: How to build a Hash Table from scratch
7
What you need to know for the interview

Binary Trees

1
What is a Binary Tree?
2
How does find work?
3
How do you insert into a Binary Search Tree?
4
How do you find the minimum in a Binary Search Tree?
5
How does delete work in a Binary Search Tree?
6
Links that help
7
What are some different ways you can traverse Binary Trees?
8
Runtime characteristic of Binary Search Tree
9
What you need to know for the interview

Binary Heaps

1
What are Binary Heaps and what are they good for?
2
How do Binary Heaps work?
3
How do you insert into a Binary Heap?
4
How do you extract the max?
5
Larger Nodes Near the Bottom
6
What makes the Binary Heap so amazing?
7
Lab: How to build a Binary Heap from scratch
8
Runtime characteristics of Binary Heap
9
What you need to know for the interview

AVL & Red-Black Trees

1
What is an AVL Tree?
2
AVL Tree in code
3
AVL Delete
4
What you need to know about AVL for the interview
5
What is the Red-Black Tree?
6
AVL Red-Black Tree Interview Questions
7
What you need to know about Red-Black for your interview

Fibonacci Series & Memoization

1
Houston we have a problem
2
What's a Fibonacci series?
3
What's memoization and how can it help?
4
Lab: How to build a memoized Fibonacci series from scratch
5
Lab: Real Life Recursion
6
What you need to know for the interview

Sorting Algorithms

1
What is the Bubble Sort?
2
Bubble Sort in code
3
Runtime characteristic of Bubble Sort
4
What is Merge Sort?
5
Merge Sort in code
6
Runtime characteristic of Merge Sort
7
What is Quicksort?
8
Quicksort in code
9
Runtime characteristic of Quicksort
10
What you need to know for the interview

Graphs

1
What exactly are graphs?
2
What does the graph data structure look like?
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
4.5
4.5 out of 5
1860 Ratings

Detailed Rating

Stars 5
1021
Stars 4
664
Stars 3
145
Stars 2
16
Stars 1
12
e944ca9476da0576a63abd029eacfabf
30-Day Money-Back Guarantee

Includes

6 hours on-demand video
12 articles
Full lifetime access
Access on mobile and TV
Certificate of Completion