JavaScript & LeetCode | The Ultimate Interview Bootcamp
Course description
Are you studying for that next coding interview but don’t know where to start? Or are you looking for a concise, easy-to-understand study guide with everything you need to know? Or are you looking for a powerful advantage over the competition to guarantee you that awesome job you’ve always wanted at your dream company?
Read more about the course
THEN THIS IS THE COURSE FOR YOU!
In my LeetCode course, I will walk you through, step-by-step, all the different types of questions that appear during interviews! I am a self-taught programmer so I know what it feels like to really struggle during those technical interviews. Let me put it this way: I created the course I wish I had when I was studying for my technical interviews!
What is LeetCode?
LeetCode is a massive collection (1,050 and counting) of challenging coding problems. It has just about every problem you can imagine. In fact, many companies (including the Big 5 tech giants) use interview questions they find on LeetCode!
I have some good news for you: spending countless hours studying and solving every single problem is unnecessary. This course was designed to help you massively optimize your study time and put you on the quickest path to successfully achieving that dream job.
Contents and Overview
I know LeetCode questions are meant to be difficult, but do not worry! I made it a priority to present each problem in the most simplistic and direct way possible. You will benefit from my painless and easy-to-understand format, as I walk you through each problem, step-by-step. I cover everything from practical application of algorithms, to data structures, to time and space complexity.
I do not believe in wasting your time or my time. This means that unlike most "interview preparation courses" out there, I will not waste time going over obscure computer science theory or elementary programming concepts. Let me let you in on a little secret: obscure theory is almost always useless in an interview setting. On the other hand, my lectures are MASSIVELY practical, as in — they are exclusively about problem solving tricks/techniques and pattern recognition. REMEMBER: Your interviewer won't know (or care) about whether you've spent WEEKS memorizing theory prior to an interview, he or she will ONLY care about whether you can solve the coding challenge or not.
By the time you complete this course, you will be an expert in all the tricks, techniques, and patterns needed to solve even the most challenging of interview problems. Are you ready to supercharge your next technical interview and land that awesome dream job?!
We use basic JavaScript in this course, and even if you are new to JavaScript, do not worry! I have included a bonus crash-course in JavaScript at the start of the course. No prior JavaScript experience is required!
Course material is regularly refreshed to include all of the newest updates and information, and since you are granted lifetime access upon registering, you can rely on this course to keep your technical interviewing skills on the cutting edge.
There is no need to waste your time scouring the internet, frantically trying to piece together ways to solve coding challenges the night before a big, important interview. Invest in yourself, and allow me to show you the easiest ways to ace it!
Feel free to take a preview of this course to see if it is a good fit for you. I am so confident that you will love my course that I even offer a 100% 30-day money-back guarantee. You have absolutely nothing to lose, so come on in, and let's get started!
- Basic Code Literacy (any language is OK!)
- Enthusiasm and Willingness to learn
- Anyone looking to master their next technical interview
- Beginner, intermediate, and advanced JavaScript developers
- Anyone seeking their dream software engineering job
What you'll learn:
- Tricks, Tips, and Skills needed to master your next software engineering technical interview
- Practical application of Algorithms and Data Structures in an interview setting
- Optimal approaches to solving difficult coding questions
- How to successfully land your dream job
Watch Online
| # | Title | Duration |
|---|---|---|
| 1 | Welcome to the Course! | 01:06 |
| 2 | Optional JavaScript Crash-Course (Skip ahead if you already know JavaScript!) | 07:26 |
| 3 | Environment Setup - Windows | 04:56 |
| 4 | Environment Setup - macOS | 04:00 |
| 5 | How to run tests | 04:02 |
| 6 | How to get the most value from this course | 00:29 |
| 7 | Strings Introduction | 01:08 |
| 8 | Valid Palindrome (LC #125) | 07:29 |
| 9 | Longest Palindromic Substring (LC #5) | 07:28 |
| 10 | Longest Substring Without Repeating Characters - Part 1 (LC #3) | 05:10 |
| 11 | Longest Substring Without Repeating Characters - Part 2 (LC #3) | 04:59 |
| 12 | Valid Anagram (LC #242) | 05:45 |
| 13 | Group Anagrams (LC #49) | 05:26 |
| 14 | Valid Parentheses (LC #20) | 05:46 |
| 15 | Dynamic Programming Introduction | 00:30 |
| 16 | Climbing Stairs (LC #70) | 05:14 |
| 17 | House Robber (LC #198) | 06:18 |
| 18 | Jump Game - Part 1 (LC #55) | 03:24 |
| 19 | Jump Game - Part 2 (LC #55) | 03:45 |
| 20 | Longest Increasing Subsequence - Part 1 (LC #300) | 03:55 |
| 21 | Longest Increasing Subsequence - Part 2 (LC #300) | 04:12 |
| 22 | Coin Change - Part 1 (LC #322) | 05:37 |
| 23 | Coin Change - Part 2 (LC #322) | 05:12 |
| 24 | Unique Paths (LC #62) | 07:30 |
| 25 | Arrays Introduction | 00:33 |
| 26 | Contains Duplicate (LC #217) | 03:04 |
| 27 | Product of Array Except Self (LC #238) | 06:07 |
| 28 | Container With Most Water (LC #11) | 06:21 |
| 29 | Best Time to Buy and Sell Stock (LC #121) | 04:39 |
| 30 | Two Sum (LC #1) | 05:09 |
| 31 | 3Sum - Part 1 (LC #15) | 04:33 |
| 32 | 3Sum - Part 2 (LC #15) | 07:39 |
| 33 | Maximum Subarray - Part 1 (LC #53) | 03:34 |
| 34 | Maximum Subarray - Part 2 (LC #53) | 04:34 |
| 35 | Maximum Product Subarray - Part 1 (LC #152) | 04:40 |
| 36 | Maximum Product Subarray - Part 2 (LC #152) | 04:26 |
| 37 | Find Minimum in Rotated Sorted Array - Part 1 (LC #153) | 04:59 |
| 38 | Find Minimum in Rotated Sorted Array - Part 2 (LC #153) | 05:12 |
| 39 | Search in Rotated Sorted Array - Part 1 (LC #33) | 05:16 |
| 40 | Search in Rotated Sorted Array - Part 2 (LC #33) | 07:00 |
| 41 | Interval Introduction | 00:52 |
| 42 | Meeting Rooms (LC #252) | 05:02 |
| 43 | Non-overlapping Intervals (LC #435) | 06:57 |
| 44 | Merge Intervals (LC #56) | 05:58 |
| 45 | Spiral Matrix - Part 1 (LC #54) | 02:23 |
| 46 | Spiral Matrix - Part 2 (LC #54) | 06:10 |
| 47 | Set Matrix Zeroes - Part 1 (LC #73) | 03:45 |
| 48 | Set Matrix Zeroes - Part 2 (LC #73) | 06:03 |
| 49 | Word Search (LC #79) | 08:16 |
| 50 | Linked List Introduction | 00:28 |
| 51 | Reverse Linked List (LC #206) | 04:20 |
| 52 | Linked List Cycle (LC #141) | 04:15 |
| 53 | Remove Nth Node From End of List (LC #19) | 05:07 |
| 54 | Merge Two Sorted Lists (LC #21) | 05:23 |
| 55 | Trees Introduction | 00:48 |
| 56 | Number of Islands (LC #200) | 06:35 |
| 57 | Invert Binary Tree (LC #226) | 03:30 |
| 58 | Maximum Depth of Binary Tree (LC #104) | 03:30 |
| 59 | Binary Tree Level Order Traversal (LC #102) | 04:20 |
| 60 | Same Tree (LC #100) | 04:36 |
| 61 | Validate Binary Search Tree (LC #98) | 06:31 |
| 62 | Lowest Common Ancestor of a Binary Search Tree - Part 1 (LC #235) | 02:42 |
| 63 | Lowest Common Ancestor of a Binary Search Tree - Part 2 (LC #235) | 03:33 |
| 64 | Congratulations! | 00:21 |
Comments
0 commentsSimilar courses
Web security: Injection Attacks with Java & Spring Boot
Learn HTML Canvas - Pixels, Particles & Physics
Complete Web Developer in 2025: Zero to Mastery
Want to join the conversation?
Sign in to comment